Start: f300
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: D, E
Locations: f1, f2, f300
Transitions:
2:f2(Arg_0,Arg_1,Arg_2) -> f1(Arg_0-1,D,E):|:1<=D && Arg_0<=1
3:f2(Arg_0,Arg_1,Arg_2) -> f1(Arg_0-1,D,E):|:D+1<=0 && Arg_0<=1
5:f2(Arg_0,Arg_1,Arg_2) -> f1(Arg_0,0,D):|:Arg_0<=0
0:f2(Arg_0,Arg_1,Arg_2) -> f2(Arg_0-1,D,Arg_2):|:1<=D && 2<=Arg_0
1:f2(Arg_0,Arg_1,Arg_2) -> f2(Arg_0-1,D,Arg_2):|:D+1<=0 && 2<=Arg_0
4:f2(Arg_0,Arg_1,Arg_2) -> f2(Arg_0,0,Arg_2):|:1<=Arg_0
6:f300(Arg_0,Arg_1,Arg_2) -> f2(Arg_0,Arg_1,Arg_2)
Eliminate variables {E,Arg_1,Arg_2} that do not contribute to the problem
Found invariant Arg_0<=0 for location f1
Start: f300
Program_Vars: Arg_0
Temp_Vars: D
Locations: f1, f2, f300
Transitions:
16:f2(Arg_0) -> f1(Arg_0-1):|:1<=D && Arg_0<=1
17:f2(Arg_0) -> f1(Arg_0-1):|:D+1<=0 && Arg_0<=1
19:f2(Arg_0) -> f1(Arg_0):|:Arg_0<=0
14:f2(Arg_0) -> f2(Arg_0-1):|:1<=D && 2<=Arg_0
15:f2(Arg_0) -> f2(Arg_0-1):|:D+1<=0 && 2<=Arg_0
18:f2(Arg_0) -> f2(Arg_0):|:1<=Arg_0
20:f300(Arg_0) -> f2(Arg_0)
new bound:
Arg_0 {O(n)}
MPRF:
f2 [Arg_0 ]
new bound:
Arg_0 {O(n)}
MPRF:
f2 [Arg_0 ]
Overall timebound:inf {Infinity}
14: f2->f2: Arg_0 {O(n)}
15: f2->f2: Arg_0 {O(n)}
16: f2->f1: 1 {O(1)}
17: f2->f1: 1 {O(1)}
18: f2->f2: inf {Infinity}
19: f2->f1: 1 {O(1)}
20: f300->f2: 1 {O(1)}
Overall costbound: inf {Infinity}
14: f2->f2: Arg_0 {O(n)}
15: f2->f2: Arg_0 {O(n)}
16: f2->f1: 1 {O(1)}
17: f2->f1: 1 {O(1)}
18: f2->f2: inf {Infinity}
19: f2->f1: 1 {O(1)}
20: f300->f2: 1 {O(1)}
14: f2->f2, Arg_0: 3*Arg_0 {O(n)}
15: f2->f2, Arg_0: 3*Arg_0 {O(n)}
16: f2->f1, Arg_0: 10*Arg_0+4 {O(n)}
17: f2->f1, Arg_0: 10*Arg_0+4 {O(n)}
18: f2->f2, Arg_0: 3*Arg_0 {O(n)}
19: f2->f1, Arg_0: Arg_0 {O(n)}
20: f300->f2, Arg_0: Arg_0 {O(n)}