Start: f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6
Temp_Vars: H, I, J, K
Locations: f0, f1, f2
Transitions:
1:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f0(H,Arg_1,Arg_2,I,0,Arg_5,Arg_6):|:Arg_0+1<=Arg_1
2:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f0(H,Arg_1,Arg_2,I,J,K,Arg_6):|:J+1<=0 && Arg_0+1<=Arg_1
3:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f0(H,Arg_1,Arg_2,I,J,K,Arg_6):|:1<=J && Arg_0+1<=Arg_1
0:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f2(H,Arg_1,I,Arg_3,Arg_4,Arg_5,Arg_6):|:Arg_1<=Arg_0
4:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,H)
Eliminate variables {I,K,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6} that do not contribute to the problem
Start: f1
Program_Vars: Arg_0, Arg_1
Temp_Vars: H, J
Locations: f0, f1, f2
Transitions:
11:f0(Arg_0,Arg_1) -> f0(H,Arg_1):|:Arg_0+1<=Arg_1
12:f0(Arg_0,Arg_1) -> f0(H,Arg_1):|:J+1<=0 && Arg_0+1<=Arg_1
13:f0(Arg_0,Arg_1) -> f0(H,Arg_1):|:1<=J && Arg_0+1<=Arg_1
10:f0(Arg_0,Arg_1) -> f2(H,Arg_1):|:Arg_1<=Arg_0
14:f1(Arg_0,Arg_1) -> f0(Arg_0,Arg_1)
Overall timebound:inf {Infinity}
10: f0->f2: 1 {O(1)}
11: f0->f0: inf {Infinity}
12: f0->f0: inf {Infinity}
13: f0->f0: inf {Infinity}
14: f1->f0: 1 {O(1)}
Overall costbound: inf {Infinity}
10: f0->f2: 1 {O(1)}
11: f0->f0: inf {Infinity}
12: f0->f0: inf {Infinity}
13: f0->f0: inf {Infinity}
14: f1->f0: 1 {O(1)}
10: f0->f2, Arg_1: 10*Arg_1 {O(n)}
11: f0->f0, Arg_1: 3*Arg_1 {O(n)}
12: f0->f0, Arg_1: 3*Arg_1 {O(n)}
13: f0->f0, Arg_1: 3*Arg_1 {O(n)}
14: f1->f0, Arg_0: Arg_0 {O(n)}
14: f1->f0, Arg_1: Arg_1 {O(n)}