Start: n_f5
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6
Temp_Vars:
Locations: n_f4___3, n_f4___5, n_f5, n_f6___1, n_f6___2, n_f6___4
Transitions:
0:n_f4___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f4___3(Arg_0+Arg_1,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6):|:Arg_1<=Arg_0 && 1+Arg_1<=0 && 0<=Arg_0
1:n_f4___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f6___1(Arg_0,Arg_1,0,0,0,0,0):|:Arg_1<=Arg_0 && 1+Arg_1<=0 && 1+Arg_0<=0
2:n_f4___5(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f4___3(Arg_0+Arg_1,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6):|:1+Arg_1<=0 && 0<=Arg_0
3:n_f4___5(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f6___2(Arg_0,Arg_1,0,0,0,0,0):|:1+Arg_1<=0 && 1+Arg_0<=0
4:n_f5(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f4___5(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6):|:1+Arg_1<=0
5:n_f5(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f6___4(Arg_0,Arg_1,0,0,0,0,0):|:0<=Arg_1
Eliminate variables {Arg_2,Arg_3,Arg_4,Arg_5,Arg_6} that do not contribute to the problem
Found invariant 1+Arg_1<=0 && Arg_1<=Arg_0 for location n_f4___3
Found invariant 0<=Arg_1 for location n_f6___4
Found invariant 1+Arg_1<=0 && 2+Arg_0+Arg_1<=0 && 1+Arg_0<=0 for location n_f6___2
Found invariant 1+Arg_1<=0 && Arg_1<=Arg_0 && 2+Arg_0+Arg_1<=0 && 1+Arg_0<=0 for location n_f6___1
Found invariant 1+Arg_1<=0 for location n_f4___5
Start: n_f5
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f4___3, n_f4___5, n_f5, n_f6___1, n_f6___2, n_f6___4
Transitions:
11:n_f4___3(Arg_0,Arg_1) -> n_f4___3(Arg_0+Arg_1,Arg_1):|:1+Arg_1<=0 && Arg_1<=Arg_0 && Arg_1<=Arg_0 && 1+Arg_1<=0 && 0<=Arg_0
12:n_f4___3(Arg_0,Arg_1) -> n_f6___1(Arg_0,Arg_1):|:1+Arg_1<=0 && Arg_1<=Arg_0 && Arg_1<=Arg_0 && 1+Arg_1<=0 && 1+Arg_0<=0
13:n_f4___5(Arg_0,Arg_1) -> n_f4___3(Arg_0+Arg_1,Arg_1):|:1+Arg_1<=0 && 1+Arg_1<=0 && 0<=Arg_0
14:n_f4___5(Arg_0,Arg_1) -> n_f6___2(Arg_0,Arg_1):|:1+Arg_1<=0 && 1+Arg_1<=0 && 1+Arg_0<=0
15:n_f5(Arg_0,Arg_1) -> n_f4___5(Arg_0,Arg_1):|:1+Arg_1<=0
16:n_f5(Arg_0,Arg_1) -> n_f6___4(Arg_0,Arg_1):|:0<=Arg_1
new bound:
Arg_0+Arg_1+1 {O(n)}
MPRF:
n_f4___3 [Arg_0+1 ]
Overall timebound:Arg_0+Arg_1+6 {O(n)}
11: n_f4___3->n_f4___3: Arg_0+Arg_1+1 {O(n)}
12: n_f4___3->n_f6___1: 1 {O(1)}
13: n_f4___5->n_f4___3: 1 {O(1)}
14: n_f4___5->n_f6___2: 1 {O(1)}
15: n_f5->n_f4___5: 1 {O(1)}
16: n_f5->n_f6___4: 1 {O(1)}
Overall costbound: Arg_0+Arg_1+6 {O(n)}
11: n_f4___3->n_f4___3: Arg_0+Arg_1+1 {O(n)}
12: n_f4___3->n_f6___1: 1 {O(1)}
13: n_f4___5->n_f4___3: 1 {O(1)}
14: n_f4___5->n_f6___2: 1 {O(1)}
15: n_f5->n_f4___5: 1 {O(1)}
16: n_f5->n_f6___4: 1 {O(1)}
11: n_f4___3->n_f4___3, Arg_0: 3*Arg_1+Arg_0 {O(n)}
11: n_f4___3->n_f4___3, Arg_1: Arg_1 {O(n)}
12: n_f4___3->n_f6___1, Arg_0: 2*Arg_0+4*Arg_1 {O(n)}
12: n_f4___3->n_f6___1, Arg_1: 2*Arg_1 {O(n)}
13: n_f4___5->n_f4___3, Arg_0: Arg_0+Arg_1 {O(n)}
13: n_f4___5->n_f4___3, Arg_1: Arg_1 {O(n)}
14: n_f4___5->n_f6___2, Arg_0: Arg_0 {O(n)}
14: n_f4___5->n_f6___2, Arg_1: Arg_1 {O(n)}
15: n_f5->n_f4___5, Arg_0: Arg_0 {O(n)}
15: n_f5->n_f4___5, Arg_1: Arg_1 {O(n)}
16: n_f5->n_f6___4, Arg_0: Arg_0 {O(n)}
16: n_f5->n_f6___4, Arg_1: Arg_1 {O(n)}