Start: n_f1
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: NoDet0
Locations: n_f0___3, n_f0___4, n_f1, n_f2___1, n_f2___2
Transitions:
0:n_f0___3(Arg_0,Arg_1,Arg_2) -> n_f0___3(Arg_0+Arg_2,Arg_1,Arg_2-1):|:2+Arg_2<=Arg_0 && 1<=Arg_0
1:n_f0___3(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0,NoDet0,Arg_2):|:2+Arg_2<=Arg_0 && Arg_0<=0
2:n_f0___4(Arg_0,Arg_1,Arg_2) -> n_f0___3(Arg_0+Arg_2,Arg_1,Arg_2-1):|:1<=Arg_0
3:n_f0___4(Arg_0,Arg_1,Arg_2) -> n_f2___2(Arg_0,NoDet0,Arg_2):|:Arg_0<=0
4:n_f1(Arg_0,Arg_1,Arg_2) -> n_f0___4(Arg_0,Arg_1,Arg_2)
Eliminate variables {NoDet0,Arg_1} that do not contribute to the problem
Found invariant 2+Arg_2<=0 && 2+Arg_2<=Arg_0 && 2+Arg_0+Arg_2<=0 && Arg_0<=0 for location n_f2___1
Found invariant 2+Arg_2<=Arg_0 for location n_f0___3
Found invariant Arg_0<=0 for location n_f2___2
Start: n_f1
Program_Vars: Arg_0, Arg_2
Temp_Vars:
Locations: n_f0___3, n_f0___4, n_f1, n_f2___1, n_f2___2
Transitions:
10:n_f0___3(Arg_0,Arg_2) -> n_f0___3(Arg_0+Arg_2,Arg_2-1):|:2+Arg_2<=Arg_0 && 2+Arg_2<=Arg_0 && 1<=Arg_0
11:n_f0___3(Arg_0,Arg_2) -> n_f2___1(Arg_0,Arg_2):|:2+Arg_2<=Arg_0 && 2+Arg_2<=Arg_0 && Arg_0<=0
12:n_f0___4(Arg_0,Arg_2) -> n_f0___3(Arg_0+Arg_2,Arg_2-1):|:1<=Arg_0
13:n_f0___4(Arg_0,Arg_2) -> n_f2___2(Arg_0,Arg_2):|:Arg_0<=0
14:n_f1(Arg_0,Arg_2) -> n_f0___4(Arg_0,Arg_2)
Overall timebound:inf {Infinity}
10: n_f0___3->n_f0___3: inf {Infinity}
11: n_f0___3->n_f2___1: 1 {O(1)}
12: n_f0___4->n_f0___3: 1 {O(1)}
13: n_f0___4->n_f2___2: 1 {O(1)}
14: n_f1->n_f0___4: 1 {O(1)}
Overall costbound: inf {Infinity}
10: n_f0___3->n_f0___3: inf {Infinity}
11: n_f0___3->n_f2___1: 1 {O(1)}
12: n_f0___4->n_f0___3: 1 {O(1)}
13: n_f0___4->n_f2___2: 1 {O(1)}
14: n_f1->n_f0___4: 1 {O(1)}
12: n_f0___4->n_f0___3, Arg_0: Arg_0+Arg_2 {O(n)}
12: n_f0___4->n_f0___3, Arg_2: Arg_2+1 {O(n)}
13: n_f0___4->n_f2___2, Arg_0: Arg_0 {O(n)}
13: n_f0___4->n_f2___2, Arg_2: Arg_2 {O(n)}
14: n_f1->n_f0___4, Arg_0: Arg_0 {O(n)}
14: n_f1->n_f0___4, Arg_2: Arg_2 {O(n)}