Start: n_f0
Program_Vars: Arg_0
Temp_Vars: A_P
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0) -> n_f1___2(A_P):|:2<=A_P
1:n_f1___1(Arg_0) -> n_f1___1(A_P):|:0<=1+Arg_0 && Arg_0<=1 && A_P<=1 && 0<=1+A_P
2:n_f1___2(Arg_0) -> n_f1___1(A_P):|:2<=Arg_0 && A_P<=1 && 0<=1+A_P
Found invariant 2<=Arg_0 for location n_f1___2
Found invariant Arg_0<=1 && 0<=1+Arg_0 for location n_f1___1
Start: n_f0
Program_Vars: Arg_0
Temp_Vars: A_P
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0) -> n_f1___2(A_P):|:2<=A_P
1:n_f1___1(Arg_0) -> n_f1___1(A_P):|:Arg_0<=1 && 0<=1+Arg_0 && 0<=1+Arg_0 && Arg_0<=1 && A_P<=1 && 0<=1+A_P
2:n_f1___2(Arg_0) -> n_f1___1(A_P):|:2<=Arg_0 && 2<=Arg_0 && A_P<=1 && 0<=1+A_P
Overall timebound:inf {Infinity}
0: n_f0->n_f1___2: 1 {O(1)}
1: n_f1___1->n_f1___1: inf {Infinity}
2: n_f1___2->n_f1___1: 1 {O(1)}
Overall costbound: inf {Infinity}
0: n_f0->n_f1___2: 1 {O(1)}
1: n_f1___1->n_f1___1: inf {Infinity}
2: n_f1___2->n_f1___1: 1 {O(1)}
1: n_f1___1->n_f1___1, Arg_0: 1 {O(1)}
2: n_f1___2->n_f1___1, Arg_0: 1 {O(1)}