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