Start: n_start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_start, n_zip3___1, n_zip3___2
Transitions:
0:n_start(Arg_0,Arg_1,Arg_2) -> n_zip3___2(Arg_0,Arg_1,Arg_2)
1:n_zip3___1(Arg_0,Arg_1,Arg_2) -> n_zip3___1(Arg_0-1,Arg_1-1,Arg_2-1):|:0<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 1<=Arg_0 && 1<=Arg_1 && 1<=Arg_2
2:n_zip3___2(Arg_0,Arg_1,Arg_2) -> n_zip3___1(Arg_0-1,Arg_1-1,Arg_2-1):|:1<=Arg_0 && 1<=Arg_1 && 1<=Arg_2
Found invariant 0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_0+Arg_2 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 for location n_zip3___1
Start: n_start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars:
Locations: n_start, n_zip3___1, n_zip3___2
Transitions:
0:n_start(Arg_0,Arg_1,Arg_2) -> n_zip3___2(Arg_0,Arg_1,Arg_2)
1:n_zip3___1(Arg_0,Arg_1,Arg_2) -> n_zip3___1(Arg_0-1,Arg_1-1,Arg_2-1):|:0<=Arg_2 && 0<=Arg_1+Arg_2 && 0<=Arg_0+Arg_2 && 0<=Arg_1 && 0<=Arg_0+Arg_1 && 0<=Arg_0 && 0<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 1<=Arg_0 && 1<=Arg_1 && 1<=Arg_2
2:n_zip3___2(Arg_0,Arg_1,Arg_2) -> n_zip3___1(Arg_0-1,Arg_1-1,Arg_2-1):|:1<=Arg_0 && 1<=Arg_1 && 1<=Arg_2
new bound:
Arg_0+1 {O(n)}
MPRF:
n_zip3___1 [Arg_0+1 ]
Overall timebound:Arg_0+3 {O(n)}
0: n_start->n_zip3___2: 1 {O(1)}
1: n_zip3___1->n_zip3___1: Arg_0+1 {O(n)}
2: n_zip3___2->n_zip3___1: 1 {O(1)}
Overall costbound: Arg_0+3 {O(n)}
0: n_start->n_zip3___2: 1 {O(1)}
1: n_zip3___1->n_zip3___1: Arg_0+1 {O(n)}
2: n_zip3___2->n_zip3___1: 1 {O(1)}
0: n_start->n_zip3___2, Arg_0: Arg_0 {O(n)}
0: n_start->n_zip3___2, Arg_1: Arg_1 {O(n)}
0: n_start->n_zip3___2, Arg_2: Arg_2 {O(n)}
1: n_zip3___1->n_zip3___1, Arg_0: Arg_0 {O(n)}
1: n_zip3___1->n_zip3___1, Arg_1: Arg_1 {O(n)}
1: n_zip3___1->n_zip3___1, Arg_2: Arg_2 {O(n)}
2: n_zip3___2->n_zip3___1, Arg_0: Arg_0 {O(n)}
2: n_zip3___2->n_zip3___1, Arg_1: Arg_1 {O(n)}
2: n_zip3___2->n_zip3___1, Arg_2: Arg_2 {O(n)}