Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0,Arg_1) -> n_f1___2(3000,Arg_1)
1:n_f1___1(Arg_0,Arg_1) -> n_f1___1(Arg_0,Arg_1+1000):|:Arg_0<=3999 && 0<=889+Arg_1 && Arg_0<=3000 && 3000<=Arg_0 && 0<=889+Arg_1 && Arg_0<=3999 && 111<=Arg_1 && Arg_0<=3999 && 0<=889+Arg_1 && Arg_0<=3999
2:n_f1___2(Arg_0,Arg_1) -> n_f1___1(Arg_0,Arg_1+1000):|:Arg_0<=3999 && Arg_0<=3000 && 3000<=Arg_0 && 0<=889+Arg_1 && Arg_0<=3999
Found invariant Arg_0<=3000 && 3000<=Arg_0 for location n_f1___2
Found invariant 111<=Arg_1 && 3111<=Arg_0+Arg_1 && Arg_0<=2889+Arg_1 && Arg_0<=3000 && 3000<=Arg_0 for location n_f1___1
Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars:
Locations: n_f0, n_f1___1, n_f1___2
Transitions:
0:n_f0(Arg_0,Arg_1) -> n_f1___2(3000,Arg_1)
1:n_f1___1(Arg_0,Arg_1) -> n_f1___1(Arg_0,Arg_1+1000):|:111<=Arg_1 && 3111<=Arg_0+Arg_1 && Arg_0<=2889+Arg_1 && Arg_0<=3000 && 3000<=Arg_0 && Arg_0<=3999 && 0<=889+Arg_1 && Arg_0<=3000 && 3000<=Arg_0 && 0<=889+Arg_1 && Arg_0<=3999 && 111<=Arg_1 && Arg_0<=3999 && 0<=889+Arg_1 && Arg_0<=3999
2:n_f1___2(Arg_0,Arg_1) -> n_f1___1(Arg_0,Arg_1+1000):|:Arg_0<=3000 && 3000<=Arg_0 && Arg_0<=3999 && Arg_0<=3000 && 3000<=Arg_0 && 0<=889+Arg_1 && Arg_0<=3999
Overall timebound:inf {Infinity}
0: n_f0->n_f1___2: 1 {O(1)}
1: n_f1___1->n_f1___1: inf {Infinity}
2: n_f1___2->n_f1___1: 1 {O(1)}
Overall costbound: inf {Infinity}
0: n_f0->n_f1___2: 1 {O(1)}
1: n_f1___1->n_f1___1: inf {Infinity}
2: n_f1___2->n_f1___1: 1 {O(1)}
0: n_f0->n_f1___2, Arg_0: 3000 {O(1)}
0: n_f0->n_f1___2, Arg_1: Arg_1 {O(n)}
1: n_f1___1->n_f1___1, Arg_0: 3000 {O(1)}
2: n_f1___2->n_f1___1, Arg_0: 3000 {O(1)}
2: n_f1___2->n_f1___1, Arg_1: Arg_1+1000 {O(n)}