Start: f0
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E
Locations: f0, f15, f23, f25, f28, f9
Transitions:
6:f0(Arg_0,Arg_1,Arg_2,Arg_3) -> f9(E,0,Arg_2,0)
1:f15(Arg_0,Arg_1,Arg_2,Arg_3) -> f15(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_2
4:f15(Arg_0,Arg_1,Arg_2,Arg_3) -> f9(E,Arg_1,Arg_2,0):|:Arg_2<=0
2:f23(Arg_0,Arg_1,Arg_2,Arg_3) -> f23(Arg_0,Arg_1,Arg_2,Arg_3)
3:f25(Arg_0,Arg_1,Arg_2,Arg_3) -> f28(Arg_0,Arg_1,Arg_2,Arg_3)
0:f9(Arg_0,Arg_1,Arg_2,Arg_3) -> f15(Arg_0,0,E,Arg_3):|:Arg_0<=0 && 1<=E
5:f9(Arg_0,Arg_1,Arg_2,Arg_3) -> f23(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_0
Cut unreachable locations [f25; f28] from the program graph
Cut unsatisfiable transition 4: f15->f9
Eliminate variables {Arg_1,Arg_3} that do not contribute to the problem
Found invariant 1<=Arg_2 && 1+Arg_0<=Arg_2 && Arg_0<=0 for location f15
Found invariant 1<=Arg_0 for location f23
Start: f0
Program_Vars: Arg_0, Arg_2
Temp_Vars: E
Locations: f0, f15, f23, f9
Transitions:
14:f0(Arg_0,Arg_2) -> f9(E,Arg_2)
15:f15(Arg_0,Arg_2) -> f15(Arg_0,Arg_2):|:1<=Arg_2 && 1+Arg_0<=Arg_2 && Arg_0<=0 && 1<=Arg_2
16:f23(Arg_0,Arg_2) -> f23(Arg_0,Arg_2):|:1<=Arg_0
17:f9(Arg_0,Arg_2) -> f15(Arg_0,E):|:Arg_0<=0 && 1<=E
18:f9(Arg_0,Arg_2) -> f23(Arg_0,Arg_2):|:1<=Arg_0
Overall timebound:inf {Infinity}
14: f0->f9: 1 {O(1)}
15: f15->f15: inf {Infinity}
16: f23->f23: inf {Infinity}
17: f9->f15: 1 {O(1)}
18: f9->f23: 1 {O(1)}
Overall costbound: inf {Infinity}
14: f0->f9: 1 {O(1)}
15: f15->f15: inf {Infinity}
16: f23->f23: inf {Infinity}
17: f9->f15: 1 {O(1)}
18: f9->f23: 1 {O(1)}
14: f0->f9, Arg_2: Arg_2 {O(n)}
16: f23->f23, Arg_2: Arg_2 {O(n)}
18: f9->f23, Arg_2: Arg_2 {O(n)}