Start: n_f1
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: NoDet0
Locations: n_f1, n_f2___2, n_f2___3, n_f2___4, n_f300___1
Transitions:
0:n_f1(Arg_0,Arg_1,Arg_2) -> n_f2___4(Arg_0,Arg_1,Arg_2)
1:n_f2___2(Arg_0,Arg_1,Arg_2) -> n_f2___2(Arg_0+1,Arg_1,Arg_2):|:1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 2+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
2:n_f2___3(Arg_0,Arg_1,Arg_2) -> n_f2___3(Arg_0+1,Arg_1,Arg_2):|:Arg_0<=Arg_1 && 1+Arg_0<=Arg_1
3:n_f2___3(Arg_0,Arg_1,Arg_2) -> n_f300___1(Arg_0,Arg_0,NoDet0):|:Arg_0<=Arg_1 && Arg_0<=Arg_1 && Arg_1<=Arg_0
4:n_f2___4(Arg_0,Arg_1,Arg_2) -> n_f2___2(Arg_0+1,Arg_1,Arg_2):|:1+Arg_1<=Arg_0
5:n_f2___4(Arg_0,Arg_1,Arg_2) -> n_f2___3(Arg_0+1,Arg_1,Arg_2):|:1+Arg_0<=Arg_1
6:n_f2___4(Arg_0,Arg_1,Arg_2) -> n_f300___1(Arg_0,Arg_0,NoDet0):|:Arg_0<=Arg_1 && Arg_1<=Arg_0
Eliminate variables {NoDet0,Arg_2} that do not contribute to the problem
Found invariant Arg_1<=Arg_0 && Arg_0<=Arg_1 for location n_f300___1
Found invariant 2+Arg_1<=Arg_0 for location n_f2___2
Found invariant Arg_0<=Arg_1 for location n_f2___3
Start: n_f1
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f1, n_f2___2, n_f2___3, n_f2___4, n_f300___1
Transitions:
14:n_f1(Arg_0,Arg_1) -> n_f2___4(Arg_0,Arg_1)
15:n_f2___2(Arg_0,Arg_1) -> n_f2___2(Arg_0+1,Arg_1):|:2+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 2+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
16:n_f2___3(Arg_0,Arg_1) -> n_f2___3(Arg_0+1,Arg_1):|:Arg_0<=Arg_1 && Arg_0<=Arg_1 && 1+Arg_0<=Arg_1
17:n_f2___3(Arg_0,Arg_1) -> n_f300___1(Arg_0,Arg_0):|:Arg_0<=Arg_1 && Arg_0<=Arg_1 && Arg_0<=Arg_1 && Arg_1<=Arg_0
18:n_f2___4(Arg_0,Arg_1) -> n_f2___2(Arg_0+1,Arg_1):|:1+Arg_1<=Arg_0
19:n_f2___4(Arg_0,Arg_1) -> n_f2___3(Arg_0+1,Arg_1):|:1+Arg_0<=Arg_1
20:n_f2___4(Arg_0,Arg_1) -> n_f300___1(Arg_0,Arg_0):|:Arg_0<=Arg_1 && Arg_1<=Arg_0
new bound:
Arg_0+Arg_1+2 {O(n)}
MPRF:
n_f2___3 [Arg_1+1-Arg_0 ]
Overall timebound:inf {Infinity}
14: n_f1->n_f2___4: 1 {O(1)}
15: n_f2___2->n_f2___2: inf {Infinity}
16: n_f2___3->n_f2___3: Arg_0+Arg_1+2 {O(n)}
17: n_f2___3->n_f300___1: 1 {O(1)}
18: n_f2___4->n_f2___2: 1 {O(1)}
19: n_f2___4->n_f2___3: 1 {O(1)}
20: n_f2___4->n_f300___1: 1 {O(1)}
Overall costbound: inf {Infinity}
14: n_f1->n_f2___4: 1 {O(1)}
15: n_f2___2->n_f2___2: inf {Infinity}
16: n_f2___3->n_f2___3: Arg_0+Arg_1+2 {O(n)}
17: n_f2___3->n_f300___1: 1 {O(1)}
18: n_f2___4->n_f2___2: 1 {O(1)}
19: n_f2___4->n_f2___3: 1 {O(1)}
20: n_f2___4->n_f300___1: 1 {O(1)}
14: n_f1->n_f2___4, Arg_0: Arg_0 {O(n)}
14: n_f1->n_f2___4, Arg_1: Arg_1 {O(n)}
15: n_f2___2->n_f2___2, Arg_1: Arg_1 {O(n)}
16: n_f2___3->n_f2___3, Arg_0: 2*Arg_0+Arg_1+3 {O(n)}
16: n_f2___3->n_f2___3, Arg_1: Arg_1 {O(n)}
17: n_f2___3->n_f300___1, Arg_0: 3*Arg_0+Arg_1+4 {O(n)}
17: n_f2___3->n_f300___1, Arg_1: 3*Arg_0+Arg_1+4 {O(n)}
18: n_f2___4->n_f2___2, Arg_0: Arg_0+1 {O(n)}
18: n_f2___4->n_f2___2, Arg_1: Arg_1 {O(n)}
19: n_f2___4->n_f2___3, Arg_0: Arg_0+1 {O(n)}
19: n_f2___4->n_f2___3, Arg_1: Arg_1 {O(n)}
20: n_f2___4->n_f300___1, Arg_0: Arg_0 {O(n)}
20: n_f2___4->n_f300___1, Arg_1: Arg_0 {O(n)}