Start: n_f0
Program_Vars: Arg_0
Temp_Vars:
Locations: n_f0, n_f13___1, n_f5___2, n_f5___3, n_f5___4
Transitions:
0:n_f0(Arg_0) -> n_f5___4(0)
1:n_f5___2(Arg_0) -> n_f13___1(Arg_0):|:Arg_0<=2 && 2<=Arg_0
2:n_f5___2(Arg_0) -> n_f13___1(Arg_0):|:Arg_0<=2 && 2<=Arg_0
3:n_f5___2(Arg_0) -> n_f5___2(Arg_0+1):|:Arg_0<=2 && Arg_0<=1
4:n_f5___3(Arg_0) -> n_f5___2(Arg_0+1):|:Arg_0<=1 && Arg_0<=1 && Arg_0<=2 && Arg_0<=1
5:n_f5___4(Arg_0) -> n_f5___3(Arg_0+1):|:Arg_0<=1 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=1 && Arg_0<=2 && Arg_0<=1
Found invariant Arg_0<=2 && 2<=Arg_0 for location n_f13___1
Found invariant Arg_0<=2 && 2<=Arg_0 for location n_f5___2
Found invariant Arg_0<=1 && 1<=Arg_0 for location n_f5___3
Found invariant Arg_0<=0 && 0<=Arg_0 for location n_f5___4
Cut unsatisfiable transition 3: n_f5___2->n_f5___2
Start: n_f0
Program_Vars: Arg_0
Temp_Vars:
Locations: n_f0, n_f13___1, n_f5___2, n_f5___3, n_f5___4
Transitions:
0:n_f0(Arg_0) -> n_f5___4(0)
1:n_f5___2(Arg_0) -> n_f13___1(Arg_0):|:Arg_0<=2 && 2<=Arg_0 && Arg_0<=2 && 2<=Arg_0
2:n_f5___2(Arg_0) -> n_f13___1(Arg_0):|:Arg_0<=2 && 2<=Arg_0 && Arg_0<=2 && 2<=Arg_0
4:n_f5___3(Arg_0) -> n_f5___2(Arg_0+1):|:Arg_0<=1 && 1<=Arg_0 && Arg_0<=1 && Arg_0<=1 && Arg_0<=2 && Arg_0<=1
5:n_f5___4(Arg_0) -> n_f5___3(Arg_0+1):|:Arg_0<=0 && 0<=Arg_0 && Arg_0<=1 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=1 && Arg_0<=2 && Arg_0<=1
Overall timebound:5 {O(1)}
0: n_f0->n_f5___4: 1 {O(1)}
1: n_f5___2->n_f13___1: 1 {O(1)}
2: n_f5___2->n_f13___1: 1 {O(1)}
4: n_f5___3->n_f5___2: 1 {O(1)}
5: n_f5___4->n_f5___3: 1 {O(1)}
Overall costbound: 5 {O(1)}
0: n_f0->n_f5___4: 1 {O(1)}
1: n_f5___2->n_f13___1: 1 {O(1)}
2: n_f5___2->n_f13___1: 1 {O(1)}
4: n_f5___3->n_f5___2: 1 {O(1)}
5: n_f5___4->n_f5___3: 1 {O(1)}