Start: f300
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7, Arg_8, Arg_9, Arg_10
Temp_Vars: L, M, N, O, P, Q, R
Locations: f1, f2, f300
Transitions:
1:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f1(Arg_0,L,M,Arg_3,Arg_4,Arg_5,N,Arg_7,Arg_8,Arg_9,Arg_10):|:Arg_0<=1
0:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f2(Arg_0,L,M,N,Arg_5,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10):|:2<=Arg_0
3:f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f1(Arg_0,L,M,Arg_3,N,P,O,Arg_7,Q,N,R):|:Arg_7<=0
2:f300(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7,Arg_8,Arg_9,Arg_10) -> f2(Arg_0,L,M,N,O,O,Arg_6,Arg_7,P,Q,R):|:1<=Arg_7
Eliminate variables {L,M,N,O,P,Q,R,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_8,Arg_9,Arg_10} that do not contribute to the problem
Found invariant 1<=Arg_7 for location f2
Start: f300
Program_Vars: Arg_0, Arg_7
Temp_Vars:
Locations: f1, f2, f300
Transitions:
8:f2(Arg_0,Arg_7) -> f1(Arg_0,Arg_7):|:1<=Arg_7 && Arg_0<=1
7:f2(Arg_0,Arg_7) -> f2(Arg_0,Arg_7):|:1<=Arg_7 && 2<=Arg_0
10:f300(Arg_0,Arg_7) -> f1(Arg_0,Arg_7):|:Arg_7<=0
9:f300(Arg_0,Arg_7) -> f2(Arg_0,Arg_7):|:1<=Arg_7
Overall timebound:inf {Infinity}
7: f2->f2: inf {Infinity}
8: f2->f1: 1 {O(1)}
9: f300->f2: 1 {O(1)}
10: f300->f1: 1 {O(1)}
Overall costbound: inf {Infinity}
7: f2->f2: inf {Infinity}
8: f2->f1: 1 {O(1)}
9: f300->f2: 1 {O(1)}
10: f300->f1: 1 {O(1)}
7: f2->f2, Arg_0: Arg_0 {O(n)}
7: f2->f2, Arg_7: Arg_7 {O(n)}
8: f2->f1, Arg_0: Arg_0 {O(n)}
8: f2->f1, Arg_7: Arg_7 {O(n)}
9: f300->f2, Arg_0: Arg_0 {O(n)}
9: f300->f2, Arg_7: Arg_7 {O(n)}
10: f300->f1, Arg_0: Arg_0 {O(n)}
10: f300->f1, Arg_7: Arg_7 {O(n)}