Start: n_l0
Program_Vars: Arg_0
Temp_Vars:
Locations: n_l0, n_l1___1, n_l1___2
Transitions:
0:n_l0(Arg_0) -> n_l1___2(Arg_0)
1:n_l1___1(Arg_0) -> n_l1___1(2*Arg_0+10):|:1<=Arg_0 && 12<=Arg_0 && Arg_0<=208 && 1<=Arg_0 && Arg_0<=99
2:n_l1___2(Arg_0) -> n_l1___1(2*Arg_0+10):|:1<=Arg_0 && Arg_0<=99
Found invariant Arg_0<=208 && 12<=Arg_0 for location n_l1___1
Start: n_l0
Program_Vars: Arg_0
Temp_Vars:
Locations: n_l0, n_l1___1, n_l1___2
Transitions:
0:n_l0(Arg_0) -> n_l1___2(Arg_0)
1:n_l1___1(Arg_0) -> n_l1___1(2*Arg_0+10):|:Arg_0<=208 && 12<=Arg_0 && 1<=Arg_0 && 12<=Arg_0 && Arg_0<=208 && 1<=Arg_0 && Arg_0<=99
2:n_l1___2(Arg_0) -> n_l1___1(2*Arg_0+10):|:1<=Arg_0 && Arg_0<=99
new bound:
417 {O(1)}
MPRF:
n_l1___1 [209-Arg_0 ]
Overall timebound:419 {O(1)}
0: n_l0->n_l1___2: 1 {O(1)}
1: n_l1___1->n_l1___1: 417 {O(1)}
2: n_l1___2->n_l1___1: 1 {O(1)}
Overall costbound: 419 {O(1)}
0: n_l0->n_l1___2: 1 {O(1)}
1: n_l1___1->n_l1___1: 417 {O(1)}
2: n_l1___2->n_l1___1: 1 {O(1)}
0: n_l0->n_l1___2, Arg_0: Arg_0 {O(n)}
1: n_l1___1->n_l1___1, Arg_0: 208 {O(1)}
2: n_l1___2->n_l1___1, Arg_0: 208 {O(1)}