Initial Problem

Start: n_f3
Program_Vars: Arg_0, Arg_1
Temp_Vars: B_P
Locations: n_f0___1, n_f0___2, n_f0___3, n_f3
Transitions:
0:n_f0___1(Arg_0,Arg_1) -> n_f0___1(Arg_0-1,B_P):|:Arg_1<=0 && B_P<=0
1:n_f0___1(Arg_0,Arg_1) -> n_f0___2(Arg_0+1,B_P):|:Arg_1<=0 && 1<=B_P
2:n_f0___2(Arg_0,Arg_1) -> n_f0___1(Arg_0-1,B_P):|:1<=Arg_1 && B_P<=0
3:n_f0___2(Arg_0,Arg_1) -> n_f0___2(Arg_0+1,B_P):|:1<=Arg_1 && 1<=B_P
4:n_f0___3(Arg_0,Arg_1) -> n_f0___1(Arg_0-1,B_P):|:Arg_0<=2 && 2<=Arg_0 && B_P<=0
5:n_f0___3(Arg_0,Arg_1) -> n_f0___2(Arg_0+1,B_P):|:Arg_0<=2 && 2<=Arg_0 && 1<=B_P
6:n_f3(Arg_0,Arg_1) -> n_f0___3(2,Arg_1)

Preprocessing

Found invariant Arg_0<=2 && 2<=Arg_0 for location n_f0___3

Found invariant 1<=Arg_1 for location n_f0___2

Found invariant Arg_1<=0 for location n_f0___1

Problem after Preprocessing

Start: n_f3
Program_Vars: Arg_0, Arg_1
Temp_Vars: B_P
Locations: n_f0___1, n_f0___2, n_f0___3, n_f3
Transitions:
0:n_f0___1(Arg_0,Arg_1) -> n_f0___1(Arg_0-1,B_P):|:Arg_1<=0 && Arg_1<=0 && B_P<=0
1:n_f0___1(Arg_0,Arg_1) -> n_f0___2(Arg_0+1,B_P):|:Arg_1<=0 && Arg_1<=0 && 1<=B_P
2:n_f0___2(Arg_0,Arg_1) -> n_f0___1(Arg_0-1,B_P):|:1<=Arg_1 && 1<=Arg_1 && B_P<=0
3:n_f0___2(Arg_0,Arg_1) -> n_f0___2(Arg_0+1,B_P):|:1<=Arg_1 && 1<=Arg_1 && 1<=B_P
4:n_f0___3(Arg_0,Arg_1) -> n_f0___1(Arg_0-1,B_P):|:Arg_0<=2 && 2<=Arg_0 && Arg_0<=2 && 2<=Arg_0 && B_P<=0
5:n_f0___3(Arg_0,Arg_1) -> n_f0___2(Arg_0+1,B_P):|:Arg_0<=2 && 2<=Arg_0 && Arg_0<=2 && 2<=Arg_0 && 1<=B_P
6:n_f3(Arg_0,Arg_1) -> n_f0___3(2,Arg_1)

All Bounds

Timebounds

Overall timebound:inf {Infinity}
0: n_f0___1->n_f0___1: inf {Infinity}
1: n_f0___1->n_f0___2: inf {Infinity}
2: n_f0___2->n_f0___1: inf {Infinity}
3: n_f0___2->n_f0___2: inf {Infinity}
4: n_f0___3->n_f0___1: 1 {O(1)}
5: n_f0___3->n_f0___2: 1 {O(1)}
6: n_f3->n_f0___3: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
0: n_f0___1->n_f0___1: inf {Infinity}
1: n_f0___1->n_f0___2: inf {Infinity}
2: n_f0___2->n_f0___1: inf {Infinity}
3: n_f0___2->n_f0___2: inf {Infinity}
4: n_f0___3->n_f0___1: 1 {O(1)}
5: n_f0___3->n_f0___2: 1 {O(1)}
6: n_f3->n_f0___3: 1 {O(1)}

Sizebounds

4: n_f0___3->n_f0___1, Arg_0: 1 {O(1)}
5: n_f0___3->n_f0___2, Arg_0: 3 {O(1)}
6: n_f3->n_f0___3, Arg_0: 2 {O(1)}
6: n_f3->n_f0___3, Arg_1: Arg_1 {O(n)}