Start: n_f3
Program_Vars: Arg_0, Arg_1
Temp_Vars: NoDet0
Locations: n_f2___2, n_f3, n_f300___1
Transitions:
0:n_f2___2(Arg_0,Arg_1) -> n_f2___2(NoDet0,Arg_1):|:1+Arg_0<=0
1:n_f2___2(Arg_0,Arg_1) -> n_f2___2(NoDet0,Arg_1):|:1<=Arg_0
2:n_f2___2(Arg_0,Arg_1) -> n_f300___1(0,NoDet0):|:Arg_0<=0 && 0<=Arg_0
3:n_f3(Arg_0,Arg_1) -> n_f2___2(Arg_0,Arg_1)
Eliminate variables {Arg_1} that do not contribute to the problem
Found invariant Arg_0<=0 && 0<=Arg_0 for location n_f300___1
Start: n_f3
Program_Vars: Arg_0
Temp_Vars: NoDet0
Locations: n_f2___2, n_f3, n_f300___1
Transitions:
8:n_f2___2(Arg_0) -> n_f2___2(NoDet0):|:1+Arg_0<=0
9:n_f2___2(Arg_0) -> n_f2___2(NoDet0):|:1<=Arg_0
10:n_f2___2(Arg_0) -> n_f300___1(0):|:Arg_0<=0 && 0<=Arg_0
11:n_f3(Arg_0) -> n_f2___2(Arg_0)
Overall timebound:inf {Infinity}
8: n_f2___2->n_f2___2: inf {Infinity}
9: n_f2___2->n_f2___2: inf {Infinity}
10: n_f2___2->n_f300___1: 1 {O(1)}
11: n_f3->n_f2___2: 1 {O(1)}
Overall costbound: inf {Infinity}
8: n_f2___2->n_f2___2: inf {Infinity}
9: n_f2___2->n_f2___2: inf {Infinity}
10: n_f2___2->n_f300___1: 1 {O(1)}
11: n_f3->n_f2___2: 1 {O(1)}
10: n_f2___2->n_f300___1, Arg_0: 0 {O(1)}
11: n_f3->n_f2___2, Arg_0: Arg_0 {O(n)}