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