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