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