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