Start: n_start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_eval___1, n_eval___2, n_eval___3, n_start
Transitions:
0:n_eval___1(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_0+Arg_2,Arg_1,Arg_2-2):|:2+Arg_2<=Arg_0 && 0<=Arg_0
1:n_eval___1(Arg_0,Arg_1,Arg_2) -> n_eval___2(Arg_0+Arg_1,Arg_1-2,Arg_2+1):|:2+Arg_2<=Arg_0 && 0<=Arg_0
2:n_eval___2(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_0+Arg_2,Arg_1,Arg_2-2):|:2+Arg_1<=Arg_0 && 0<=Arg_0
3:n_eval___2(Arg_0,Arg_1,Arg_2) -> n_eval___2(Arg_0+Arg_1,Arg_1-2,Arg_2+1):|:2+Arg_1<=Arg_0 && 0<=Arg_0
4:n_eval___3(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_0+Arg_2,Arg_1,Arg_2-2):|:0<=Arg_0
5:n_eval___3(Arg_0,Arg_1,Arg_2) -> n_eval___2(Arg_0+Arg_1,Arg_1-2,Arg_2+1):|:0<=Arg_0
6:n_start(Arg_0,Arg_1,Arg_2) -> n_eval___3(Arg_0,Arg_1,Arg_2)
Found invariant 2+Arg_2<=Arg_0 for location n_eval___1
Found invariant 2+Arg_1<=Arg_0 for location n_eval___2
Start: n_start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_eval___1, n_eval___2, n_eval___3, n_start
Transitions:
0:n_eval___1(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_0+Arg_2,Arg_1,Arg_2-2):|:2+Arg_2<=Arg_0 && 2+Arg_2<=Arg_0 && 0<=Arg_0
1:n_eval___1(Arg_0,Arg_1,Arg_2) -> n_eval___2(Arg_0+Arg_1,Arg_1-2,Arg_2+1):|:2+Arg_2<=Arg_0 && 2+Arg_2<=Arg_0 && 0<=Arg_0
2:n_eval___2(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_0+Arg_2,Arg_1,Arg_2-2):|:2+Arg_1<=Arg_0 && 2+Arg_1<=Arg_0 && 0<=Arg_0
3:n_eval___2(Arg_0,Arg_1,Arg_2) -> n_eval___2(Arg_0+Arg_1,Arg_1-2,Arg_2+1):|:2+Arg_1<=Arg_0 && 2+Arg_1<=Arg_0 && 0<=Arg_0
4:n_eval___3(Arg_0,Arg_1,Arg_2) -> n_eval___1(Arg_0+Arg_2,Arg_1,Arg_2-2):|:0<=Arg_0
5:n_eval___3(Arg_0,Arg_1,Arg_2) -> n_eval___2(Arg_0+Arg_1,Arg_1-2,Arg_2+1):|:0<=Arg_0
6:n_start(Arg_0,Arg_1,Arg_2) -> n_eval___3(Arg_0,Arg_1,Arg_2)
Overall timebound:inf {Infinity}
0: n_eval___1->n_eval___1: inf {Infinity}
1: n_eval___1->n_eval___2: inf {Infinity}
2: n_eval___2->n_eval___1: inf {Infinity}
3: n_eval___2->n_eval___2: inf {Infinity}
4: n_eval___3->n_eval___1: 1 {O(1)}
5: n_eval___3->n_eval___2: 1 {O(1)}
6: n_start->n_eval___3: 1 {O(1)}
Overall costbound: inf {Infinity}
0: n_eval___1->n_eval___1: inf {Infinity}
1: n_eval___1->n_eval___2: inf {Infinity}
2: n_eval___2->n_eval___1: inf {Infinity}
3: n_eval___2->n_eval___2: inf {Infinity}
4: n_eval___3->n_eval___1: 1 {O(1)}
5: n_eval___3->n_eval___2: 1 {O(1)}
6: n_start->n_eval___3: 1 {O(1)}
4: n_eval___3->n_eval___1, Arg_0: Arg_0+Arg_2 {O(n)}
4: n_eval___3->n_eval___1, Arg_1: Arg_1 {O(n)}
4: n_eval___3->n_eval___1, Arg_2: Arg_2+2 {O(n)}
5: n_eval___3->n_eval___2, Arg_0: Arg_0+Arg_1 {O(n)}
5: n_eval___3->n_eval___2, Arg_1: Arg_1+2 {O(n)}
5: n_eval___3->n_eval___2, Arg_2: Arg_2+1 {O(n)}
6: n_start->n_eval___3, Arg_0: Arg_0 {O(n)}
6: n_start->n_eval___3, Arg_1: Arg_1 {O(n)}
6: n_start->n_eval___3, Arg_2: Arg_2 {O(n)}