Initial Problem

Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, NoDet0
Locations: n_f0, n_f2___1, n_f2___2, n_f2___3
Transitions:
0:n_f0(Arg_0,Arg_1) -> n_f2___2(3,NoDet0)
1:n_f0(Arg_0,Arg_1) -> n_f2___3(A_P,NoDet0):|:5<=A_P
2:n_f2___1(Arg_0,Arg_1) -> n_f2___1(3*Arg_0+1,NoDet0):|:4<=3*Arg_0 && 10<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 4<=3*Arg_0 && Arg_0<=2*Arg_1+1 && 1+2*Arg_1<=Arg_0
3:n_f2___1(Arg_0,Arg_1) -> n_f2___3(A_P,NoDet0):|:4<=3*Arg_0 && 10<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 10<=Arg_0 && Arg_0<=2*Arg_1 && 2*Arg_1<=Arg_0 && Arg_0<=2*A_P && 2*A_P<=Arg_0
4:n_f2___2(Arg_0,Arg_1) -> n_f2___1(3*Arg_0+1,NoDet0):|:4<=3*Arg_0 && Arg_0<=3 && 3<=Arg_0 && Arg_0<=3 && 3<=Arg_0 && Arg_0<=3 && 3<=Arg_0 && 4<=3*Arg_0 && Arg_0<=2*Arg_1+1 && 1+2*Arg_1<=Arg_0
5:n_f2___3(Arg_0,Arg_1) -> n_f2___1(3*Arg_0+1,NoDet0):|:4<=3*Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 4<=3*Arg_0 && Arg_0<=2*Arg_1+1 && 1+2*Arg_1<=Arg_0
6:n_f2___3(Arg_0,Arg_1) -> n_f2___2(3,NoDet0):|:4<=3*Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && Arg_1<=3 && 3<=Arg_1 && Arg_0<=6 && 6<=Arg_0
7:n_f2___3(Arg_0,Arg_1) -> n_f2___3(A_P,NoDet0):|:4<=3*Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 10<=Arg_0 && Arg_0<=2*Arg_1 && 2*Arg_1<=Arg_0 && Arg_0<=2*A_P && 2*A_P<=Arg_0

Preprocessing

Cut unsatisfiable transition 2: n_f2___1->n_f2___1

Found invariant 10<=Arg_0 for location n_f2___1

Found invariant Arg_0<=3 && 3<=Arg_0 for location n_f2___2

Found invariant 5<=Arg_0 for location n_f2___3

Problem after Preprocessing

Start: n_f0
Program_Vars: Arg_0, Arg_1
Temp_Vars: A_P, NoDet0
Locations: n_f0, n_f2___1, n_f2___2, n_f2___3
Transitions:
0:n_f0(Arg_0,Arg_1) -> n_f2___2(3,NoDet0)
1:n_f0(Arg_0,Arg_1) -> n_f2___3(A_P,NoDet0):|:5<=A_P
3:n_f2___1(Arg_0,Arg_1) -> n_f2___3(A_P,NoDet0):|:10<=Arg_0 && 4<=3*Arg_0 && 10<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 10<=Arg_0 && Arg_0<=2*Arg_1 && 2*Arg_1<=Arg_0 && Arg_0<=2*A_P && 2*A_P<=Arg_0
4:n_f2___2(Arg_0,Arg_1) -> n_f2___1(3*Arg_0+1,NoDet0):|:Arg_0<=3 && 3<=Arg_0 && 4<=3*Arg_0 && Arg_0<=3 && 3<=Arg_0 && Arg_0<=3 && 3<=Arg_0 && Arg_0<=3 && 3<=Arg_0 && 4<=3*Arg_0 && Arg_0<=2*Arg_1+1 && 1+2*Arg_1<=Arg_0
5:n_f2___3(Arg_0,Arg_1) -> n_f2___1(3*Arg_0+1,NoDet0):|:5<=Arg_0 && 4<=3*Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 4<=3*Arg_0 && Arg_0<=2*Arg_1+1 && 1+2*Arg_1<=Arg_0
6:n_f2___3(Arg_0,Arg_1) -> n_f2___2(3,NoDet0):|:5<=Arg_0 && 4<=3*Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && Arg_1<=3 && 3<=Arg_1 && Arg_0<=6 && 6<=Arg_0
7:n_f2___3(Arg_0,Arg_1) -> n_f2___3(A_P,NoDet0):|:5<=Arg_0 && 4<=3*Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 5<=Arg_0 && 10<=Arg_0 && Arg_0<=2*Arg_1 && 2*Arg_1<=Arg_0 && Arg_0<=2*A_P && 2*A_P<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: n_f0->n_f2___2: 1 {O(1)}
1: n_f0->n_f2___3: 1 {O(1)}
3: n_f2___1->n_f2___3: inf {Infinity}
4: n_f2___2->n_f2___1: inf {Infinity}
5: n_f2___3->n_f2___1: inf {Infinity}
6: n_f2___3->n_f2___2: inf {Infinity}
7: n_f2___3->n_f2___3: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
0: n_f0->n_f2___2: 1 {O(1)}
1: n_f0->n_f2___3: 1 {O(1)}
3: n_f2___1->n_f2___3: inf {Infinity}
4: n_f2___2->n_f2___1: inf {Infinity}
5: n_f2___3->n_f2___1: inf {Infinity}
6: n_f2___3->n_f2___2: inf {Infinity}
7: n_f2___3->n_f2___3: inf {Infinity}

Sizebounds

0: n_f0->n_f2___2, Arg_0: 3 {O(1)}
4: n_f2___2->n_f2___1, Arg_0: 10 {O(1)}
6: n_f2___3->n_f2___2, Arg_0: 3 {O(1)}