Start: n_start
Program_Vars: Arg_0
Temp_Vars: A_P
Locations: n_eval___1, n_eval___2, n_start
Transitions:
0:n_eval___1(Arg_0) -> n_eval___1(A_P):|:0<=Arg_0 && 0<=A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
1:n_eval___2(Arg_0) -> n_eval___1(A_P):|:0<=A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
2:n_start(Arg_0) -> n_eval___2(Arg_0)
Found invariant 0<=Arg_0 for location n_eval___1
Start: n_start
Program_Vars: Arg_0
Temp_Vars: A_P
Locations: n_eval___1, n_eval___2, n_start
Transitions:
0:n_eval___1(Arg_0) -> n_eval___1(A_P):|:0<=Arg_0 && 0<=Arg_0 && 0<=A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
1:n_eval___2(Arg_0) -> n_eval___1(A_P):|:0<=A_P && Arg_0<=A_P+1 && 1+A_P<=Arg_0
2:n_start(Arg_0) -> n_eval___2(Arg_0)
new bound:
Arg_0+1 {O(n)}
MPRF:
n_eval___1 [Arg_0+1 ]
Overall timebound:Arg_0+3 {O(n)}
0: n_eval___1->n_eval___1: Arg_0+1 {O(n)}
1: n_eval___2->n_eval___1: 1 {O(1)}
2: n_start->n_eval___2: 1 {O(1)}
Overall costbound: Arg_0+3 {O(n)}
0: n_eval___1->n_eval___1: Arg_0+1 {O(n)}
1: n_eval___2->n_eval___1: 1 {O(1)}
2: n_start->n_eval___2: 1 {O(1)}
0: n_eval___1->n_eval___1, Arg_0: Arg_0 {O(n)}
1: n_eval___2->n_eval___1, Arg_0: Arg_0 {O(n)}
2: n_start->n_eval___2, Arg_0: Arg_0 {O(n)}