Start: n_eval0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_eval0, n_eval1___1, n_eval1___2, n_eval1___3
Transitions:
0:n_eval0(Arg_0,Arg_1,Arg_2) -> n_eval1___3(Arg_0,Arg_1,Arg_2):|:1<=Arg_0
1:n_eval1___2(Arg_0,Arg_1,Arg_2) -> n_eval1___1(Arg_0,Arg_1,Arg_1-Arg_0):|:1+Arg_0<=Arg_2 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1+Arg_0<=Arg_2 && 1+Arg_1<=2*Arg_0 && 1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_0<=Arg_2
2:n_eval1___2(Arg_0,Arg_1,Arg_2) -> n_eval1___2(Arg_0,Arg_0+Arg_1,Arg_2):|:1+Arg_0<=Arg_2 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1+Arg_0<=Arg_2 && 1+Arg_1<=2*Arg_0 && 1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_0<=Arg_2
3:n_eval1___3(Arg_0,Arg_1,Arg_2) -> n_eval1___1(Arg_0,Arg_1,Arg_1-Arg_0):|:1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_0<=Arg_2
4:n_eval1___3(Arg_0,Arg_1,Arg_2) -> n_eval1___2(Arg_0,Arg_0+Arg_1,Arg_2):|:1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_0<=Arg_2
Found invariant 1+Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_0 for location n_eval1___1
Found invariant 2<=Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_0<=Arg_2 && 1<=Arg_0 for location n_eval1___2
Found invariant 1<=Arg_0 for location n_eval1___3
Start: n_eval0
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_eval0, n_eval1___1, n_eval1___2, n_eval1___3
Transitions:
0:n_eval0(Arg_0,Arg_1,Arg_2) -> n_eval1___3(Arg_0,Arg_1,Arg_2):|:1<=Arg_0
1:n_eval1___2(Arg_0,Arg_1,Arg_2) -> n_eval1___1(Arg_0,Arg_1,Arg_1-Arg_0):|:2<=Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_0<=Arg_2 && 1<=Arg_0 && 1+Arg_0<=Arg_2 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1+Arg_0<=Arg_2 && 1+Arg_1<=2*Arg_0 && 1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_0<=Arg_2
2:n_eval1___2(Arg_0,Arg_1,Arg_2) -> n_eval1___2(Arg_0,Arg_0+Arg_1,Arg_2):|:2<=Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_0<=Arg_2 && 1<=Arg_0 && 1+Arg_0<=Arg_2 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1+Arg_0<=Arg_2 && 1+Arg_1<=2*Arg_0 && 1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_0<=Arg_2
3:n_eval1___3(Arg_0,Arg_1,Arg_2) -> n_eval1___1(Arg_0,Arg_1,Arg_1-Arg_0):|:1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_0<=Arg_2
4:n_eval1___3(Arg_0,Arg_1,Arg_2) -> n_eval1___2(Arg_0,Arg_0+Arg_1,Arg_2):|:1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_0<=Arg_2
new bound:
3*Arg_0+Arg_1 {O(n)}
MPRF:
n_eval1___2 [2*Arg_0-Arg_1 ]
Overall timebound:3*Arg_0+Arg_1+4 {O(n)}
0: n_eval0->n_eval1___3: 1 {O(1)}
1: n_eval1___2->n_eval1___1: 1 {O(1)}
2: n_eval1___2->n_eval1___2: 3*Arg_0+Arg_1 {O(n)}
3: n_eval1___3->n_eval1___1: 1 {O(1)}
4: n_eval1___3->n_eval1___2: 1 {O(1)}
Overall costbound: 3*Arg_0+Arg_1+4 {O(n)}
0: n_eval0->n_eval1___3: 1 {O(1)}
1: n_eval1___2->n_eval1___1: 1 {O(1)}
2: n_eval1___2->n_eval1___2: 3*Arg_0+Arg_1 {O(n)}
3: n_eval1___3->n_eval1___1: 1 {O(1)}
4: n_eval1___3->n_eval1___2: 1 {O(1)}
0: n_eval0->n_eval1___3, Arg_0: Arg_0 {O(n)}
0: n_eval0->n_eval1___3, Arg_1: Arg_1 {O(n)}
0: n_eval0->n_eval1___3, Arg_2: Arg_2 {O(n)}
1: n_eval1___2->n_eval1___1, Arg_0: 2*Arg_0 {O(n)}
1: n_eval1___2->n_eval1___1, Arg_1: 2*Arg_0*Arg_1+6*Arg_0*Arg_0+2*Arg_1+4*Arg_0 {O(n^2)}
1: n_eval1___2->n_eval1___1, Arg_2: 2*Arg_0*Arg_1+6*Arg_0*Arg_0+2*Arg_1+6*Arg_0 {O(n^2)}
2: n_eval1___2->n_eval1___2, Arg_0: Arg_0 {O(n)}
2: n_eval1___2->n_eval1___2, Arg_1: 2*Arg_0*Arg_1+6*Arg_0*Arg_0+3*Arg_0+Arg_1 {O(n^2)}
2: n_eval1___2->n_eval1___2, Arg_2: Arg_2 {O(n)}
3: n_eval1___3->n_eval1___1, Arg_0: Arg_0 {O(n)}
3: n_eval1___3->n_eval1___1, Arg_1: Arg_1 {O(n)}
3: n_eval1___3->n_eval1___1, Arg_2: Arg_0+Arg_1 {O(n)}
4: n_eval1___3->n_eval1___2, Arg_0: Arg_0 {O(n)}
4: n_eval1___3->n_eval1___2, Arg_1: Arg_0+Arg_1 {O(n)}
4: n_eval1___3->n_eval1___2, Arg_2: Arg_2 {O(n)}