Start: f28
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4
Temp_Vars:
Locations: f11, f12, f20, f28
Transitions:
0:f12(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f11(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4)
1:f28(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4) -> f20(Arg_0,1,Arg_0,1,Arg_0):|:1<=Arg_0
Cut unreachable locations [f11; f12] from the program graph
Eliminate variables {Arg_1,Arg_2,Arg_3,Arg_4} that do not contribute to the problem
Found invariant 1<=Arg_0 for location f20
Start: f28
Program_Vars: Arg_0
Temp_Vars:
Locations: f20, f28
Transitions:
3:f28(Arg_0) -> f20(Arg_0):|:1<=Arg_0
Overall timebound:1 {O(1)}
3: f28->f20: 1 {O(1)}
Overall costbound: 1 {O(1)}
3: f28->f20: 1 {O(1)}