Start: f3
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6
Temp_Vars: H, I
Locations: f0, f1, f2, f3, f4
Transitions:
1:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f0(Arg_0-1,Arg_2,Arg_2-1,Arg_0,Arg_4,Arg_5,Arg_6):|:1<=Arg_0
0:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6):|:Arg_0<=0
2:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f0(Arg_0-1,Arg_1,Arg_2-1,Arg_3,Arg_2,Arg_0,Arg_6):|:1<=Arg_0 && 1<=Arg_2
4:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f0(H,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6):|:1<=H && 1<=Arg_2
3:f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> f4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,H):|:Arg_2<=0
5:f3(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)
Cut unreachable locations [f1] from the program graph
Eliminate variables {Arg_1,Arg_3,Arg_4,Arg_5,Arg_6} that do not contribute to the problem
Found invariant 0<=Arg_0 for location f0
Found invariant Arg_2<=0 for location f4
Start: f3
Program_Vars: Arg_0, Arg_2
Temp_Vars: H, I
Locations: f0, f2, f3, f4
Transitions:
13:f0(Arg_0,Arg_2) -> f0(Arg_0-1,Arg_2-1):|:0<=Arg_0 && 1<=Arg_0
12:f0(Arg_0,Arg_2) -> f2(Arg_0,Arg_2):|:0<=Arg_0 && Arg_0<=0
15:f2(Arg_0,Arg_2) -> f0(H,Arg_2):|:1<=H && 1<=Arg_2
14:f2(Arg_0,Arg_2) -> f4(Arg_0,Arg_2):|:Arg_2<=0
16:f3(Arg_0,Arg_2) -> f2(H,I)
Overall timebound:inf {Infinity}
12: f0->f2: inf {Infinity}
13: f0->f0: inf {Infinity}
14: f2->f4: 1 {O(1)}
15: f2->f0: inf {Infinity}
16: f3->f2: 1 {O(1)}
Overall costbound: inf {Infinity}
12: f0->f2: inf {Infinity}
13: f0->f0: inf {Infinity}
14: f2->f4: 1 {O(1)}
15: f2->f0: inf {Infinity}
16: f3->f2: 1 {O(1)}
12: f0->f2, Arg_0: 0 {O(1)}