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