Start: n_f2
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6, Arg_7
Temp_Vars: NoDet0, NoDet1, NoDet2
Locations: n_f1___2, n_f1___3, n_f1___4, n_f2, n_f300___1
Transitions:
0:n_f1___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> n_f1___2(Arg_0,Arg_1,NoDet0,NoDet1,NoDet2,Arg_5,Arg_6,Arg_7):|:1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1
1:n_f1___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> n_f1___3(Arg_0,Arg_1,NoDet0,NoDet1,NoDet2,Arg_5,Arg_6,Arg_7):|:1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
2:n_f1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> n_f1___2(Arg_0,Arg_1,NoDet0,NoDet1,NoDet2,Arg_5,Arg_6,Arg_7):|:1+Arg_0<=Arg_1
3:n_f1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> n_f1___3(Arg_0,Arg_1,NoDet0,NoDet1,NoDet2,Arg_5,Arg_6,Arg_7):|:1+Arg_1<=Arg_0
4:n_f1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> n_f300___1(Arg_0,Arg_0,NoDet0,NoDet1,Arg_4,NoDet2,Arg_6,Arg_7):|:Arg_0<=Arg_1 && Arg_1<=Arg_0
5:n_f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7) -> n_f1___4(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,NoDet0,NoDet1)
Eliminate variables {NoDet0,NoDet1,NoDet2,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6,Arg_7} that do not contribute to the problem
Found invariant Arg_1<=Arg_0 && Arg_0<=Arg_1 for location n_f300___1
Found invariant 1+Arg_0<=Arg_1 for location n_f1___2
Found invariant 1+Arg_1<=Arg_0 for location n_f1___3
Start: n_f2
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f1___2, n_f1___3, n_f1___4, n_f2, n_f300___1
Transitions:
12:n_f1___2(Arg_0,Arg_1) -> n_f1___2(Arg_0,Arg_1):|:1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1 && 1+Arg_0<=Arg_1
13:n_f1___3(Arg_0,Arg_1) -> n_f1___3(Arg_0,Arg_1):|:1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0
14:n_f1___4(Arg_0,Arg_1) -> n_f1___2(Arg_0,Arg_1):|:1+Arg_0<=Arg_1
15:n_f1___4(Arg_0,Arg_1) -> n_f1___3(Arg_0,Arg_1):|:1+Arg_1<=Arg_0
16:n_f1___4(Arg_0,Arg_1) -> n_f300___1(Arg_0,Arg_0):|:Arg_0<=Arg_1 && Arg_1<=Arg_0
17:n_f2(Arg_0,Arg_1) -> n_f1___4(Arg_0,Arg_1)
Overall timebound:inf {Infinity}
12: n_f1___2->n_f1___2: inf {Infinity}
13: n_f1___3->n_f1___3: inf {Infinity}
14: n_f1___4->n_f1___2: 1 {O(1)}
15: n_f1___4->n_f1___3: 1 {O(1)}
16: n_f1___4->n_f300___1: 1 {O(1)}
17: n_f2->n_f1___4: 1 {O(1)}
Overall costbound: inf {Infinity}
12: n_f1___2->n_f1___2: inf {Infinity}
13: n_f1___3->n_f1___3: inf {Infinity}
14: n_f1___4->n_f1___2: 1 {O(1)}
15: n_f1___4->n_f1___3: 1 {O(1)}
16: n_f1___4->n_f300___1: 1 {O(1)}
17: n_f2->n_f1___4: 1 {O(1)}
12: n_f1___2->n_f1___2, Arg_0: Arg_0 {O(n)}
12: n_f1___2->n_f1___2, Arg_1: Arg_1 {O(n)}
13: n_f1___3->n_f1___3, Arg_0: Arg_0 {O(n)}
13: n_f1___3->n_f1___3, Arg_1: Arg_1 {O(n)}
14: n_f1___4->n_f1___2, Arg_0: Arg_0 {O(n)}
14: n_f1___4->n_f1___2, Arg_1: Arg_1 {O(n)}
15: n_f1___4->n_f1___3, Arg_0: Arg_0 {O(n)}
15: n_f1___4->n_f1___3, Arg_1: Arg_1 {O(n)}
16: n_f1___4->n_f300___1, Arg_0: Arg_0 {O(n)}
16: n_f1___4->n_f300___1, Arg_1: Arg_0 {O(n)}
17: n_f2->n_f1___4, Arg_0: Arg_0 {O(n)}
17: n_f2->n_f1___4, Arg_1: Arg_1 {O(n)}