Start: f3
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5
Temp_Vars: G
Locations: f0, f1, f3
Transitions:
0:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(Arg_0-1,Arg_2,Arg_2-1,Arg_0,Arg_4,Arg_5):|:1<=Arg_0
2:f0(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(5000,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5):|:Arg_0<=0 && 1<=Arg_2
1:f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(Arg_0-1,Arg_1,Arg_2-1,Arg_3,Arg_2,Arg_0):|:1<=Arg_0 && 1<=Arg_2
3:f3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> f0(5000,Arg_1,G,Arg_3,Arg_4,Arg_5):|:1<=G
Cut unreachable locations [f1] from the program graph
Eliminate variables {Arg_1,Arg_3,Arg_4,Arg_5} that do not contribute to the problem
Found invariant 0<=4999+Arg_2 && 0<=4999+Arg_0+Arg_2 && Arg_0<=4999+Arg_2 && Arg_0<=5000 && 0<=Arg_0 for location f0
Start: f3
Program_Vars: Arg_0, Arg_2
Temp_Vars: G
Locations: f0, f3
Transitions:
9:f0(Arg_0,Arg_2) -> f0(Arg_0-1,Arg_2-1):|:0<=4999+Arg_2 && 0<=4999+Arg_0+Arg_2 && Arg_0<=4999+Arg_2 && Arg_0<=5000 && 0<=Arg_0 && 1<=Arg_0
10:f0(Arg_0,Arg_2) -> f0(5000,Arg_2):|:0<=4999+Arg_2 && 0<=4999+Arg_0+Arg_2 && Arg_0<=4999+Arg_2 && Arg_0<=5000 && 0<=Arg_0 && Arg_0<=0 && 1<=Arg_2
11:f3(Arg_0,Arg_2) -> f0(5000,G):|:1<=G
Overall timebound:inf {Infinity}
9: f0->f0: inf {Infinity}
10: f0->f0: inf {Infinity}
11: f3->f0: 1 {O(1)}
Overall costbound: inf {Infinity}
9: f0->f0: inf {Infinity}
10: f0->f0: inf {Infinity}
11: f3->f0: 1 {O(1)}
9: f0->f0, Arg_0: 10000 {O(1)}
10: f0->f0, Arg_0: 5000 {O(1)}
11: f3->f0, Arg_0: 5000 {O(1)}