Initial Problem

Start: n_f3
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6
Temp_Vars: A_P, C_P, NoDet0, NoDet1
Locations: n_f0___3, n_f0___5, n_f2___2, n_f2___6, n_f3, n_f4___1, n_f4___4
Transitions:
0:n_f0___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f0___3(Arg_0-1,Arg_2,Arg_2-1,Arg_0,Arg_4,Arg_5,Arg_6):|:Arg_1<=1+Arg_2 && 1+Arg_2<=Arg_1 && 1+Arg_0<=Arg_3 && Arg_3<=1+Arg_0 && 0<=Arg_0 && 1<=Arg_0
1:n_f0___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6):|:Arg_1<=1+Arg_2 && 1+Arg_2<=Arg_1 && 1+Arg_0<=Arg_3 && Arg_3<=1+Arg_0 && 0<=Arg_0 && Arg_0<=0
2:n_f0___5(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f0___3(Arg_0-1,Arg_2,Arg_2-1,Arg_0,Arg_4,Arg_5,Arg_6):|:1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_2 && 1<=Arg_0
3:n_f2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f0___5(A_P,Arg_1,C_P,Arg_3,Arg_4,Arg_5,Arg_6):|:Arg_0<=0 && 1<=A_P && 1<=C_P && Arg_2<=C_P && C_P<=Arg_2
4:n_f2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f4___1(Arg_0,Arg_1,C_P,Arg_3,Arg_4,Arg_5,NoDet0):|:Arg_0<=0 && C_P<=0 && Arg_2<=C_P && C_P<=Arg_2
5:n_f2___6(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f0___5(A_P,Arg_1,C_P,Arg_3,Arg_4,Arg_5,Arg_6):|:1<=A_P && 1<=C_P && Arg_2<=C_P && C_P<=Arg_2
6:n_f2___6(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f4___4(Arg_0,Arg_1,C_P,Arg_3,Arg_4,Arg_5,NoDet0):|:C_P<=0 && Arg_2<=C_P && C_P<=Arg_2
7:n_f3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f2___6(NoDet0,Arg_1,NoDet1,Arg_3,Arg_4,Arg_5,Arg_6)

Preprocessing

Eliminate variables {Arg_4,Arg_5,Arg_6} that do not contribute to the problem

Found invariant Arg_3<=1 && Arg_2+Arg_3<=1 && Arg_1+Arg_3<=2 && Arg_3<=1+Arg_0 && Arg_0+Arg_3<=1 && 1<=Arg_3 && 1+Arg_2<=Arg_3 && Arg_1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && Arg_2<=0 && 1+Arg_2<=Arg_1 && Arg_1+Arg_2<=1 && Arg_2<=Arg_0 && Arg_0+Arg_2<=0 && Arg_1<=1+Arg_2 && Arg_1<=1 && Arg_1<=1+Arg_0 && Arg_0+Arg_1<=1 && Arg_0<=0 && 0<=Arg_0 for location n_f4___1

Found invariant Arg_3<=1+Arg_0 && 1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && 1+Arg_2<=Arg_1 && Arg_1<=1+Arg_2 && 0<=Arg_0 for location n_f0___3

Found invariant 1<=Arg_2 && 2<=Arg_0+Arg_2 && 1<=Arg_0 for location n_f0___5

Found invariant Arg_2<=0 for location n_f4___4

Found invariant Arg_3<=1 && Arg_3<=1+Arg_0 && Arg_0+Arg_3<=1 && 1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && 1+Arg_2<=Arg_1 && Arg_1<=1+Arg_2 && Arg_0<=0 && 0<=Arg_0 for location n_f2___2

Problem after Preprocessing

Start: n_f3
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: A_P, C_P, NoDet0, NoDet1
Locations: n_f0___3, n_f0___5, n_f2___2, n_f2___6, n_f3, n_f4___1, n_f4___4
Transitions:
16:n_f0___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f0___3(Arg_0-1,Arg_2,Arg_2-1,Arg_0):|:Arg_3<=1+Arg_0 && 1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && 1+Arg_2<=Arg_1 && Arg_1<=1+Arg_2 && 0<=Arg_0 && Arg_1<=1+Arg_2 && 1+Arg_2<=Arg_1 && 1+Arg_0<=Arg_3 && Arg_3<=1+Arg_0 && 0<=Arg_0 && 1<=Arg_0
17:n_f0___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___2(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=1+Arg_0 && 1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && 1+Arg_2<=Arg_1 && Arg_1<=1+Arg_2 && 0<=Arg_0 && Arg_1<=1+Arg_2 && 1+Arg_2<=Arg_1 && 1+Arg_0<=Arg_3 && Arg_3<=1+Arg_0 && 0<=Arg_0 && Arg_0<=0
18:n_f0___5(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f0___3(Arg_0-1,Arg_2,Arg_2-1,Arg_0):|:1<=Arg_2 && 2<=Arg_0+Arg_2 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_0 && 1<=Arg_2 && 1<=Arg_0
19:n_f2___2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f0___5(A_P,Arg_1,C_P,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_0 && Arg_0+Arg_3<=1 && 1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && 1+Arg_2<=Arg_1 && Arg_1<=1+Arg_2 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && 1<=A_P && 1<=C_P && Arg_2<=C_P && C_P<=Arg_2
20:n_f2___2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f4___1(Arg_0,Arg_1,C_P,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_0 && Arg_0+Arg_3<=1 && 1<=Arg_3 && 1<=Arg_0+Arg_3 && 1+Arg_0<=Arg_3 && 1+Arg_2<=Arg_1 && Arg_1<=1+Arg_2 && Arg_0<=0 && 0<=Arg_0 && Arg_0<=0 && C_P<=0 && Arg_2<=C_P && C_P<=Arg_2
21:n_f2___6(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f0___5(A_P,Arg_1,C_P,Arg_3):|:1<=A_P && 1<=C_P && Arg_2<=C_P && C_P<=Arg_2
22:n_f2___6(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f4___4(Arg_0,Arg_1,C_P,Arg_3):|:C_P<=0 && Arg_2<=C_P && C_P<=Arg_2
23:n_f3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___6(NoDet0,Arg_1,NoDet1,Arg_3)

All Bounds

Timebounds

Overall timebound:inf {Infinity}
16: n_f0___3->n_f0___3: inf {Infinity}
17: n_f0___3->n_f2___2: inf {Infinity}
18: n_f0___5->n_f0___3: inf {Infinity}
19: n_f2___2->n_f0___5: inf {Infinity}
20: n_f2___2->n_f4___1: 1 {O(1)}
21: n_f2___6->n_f0___5: 1 {O(1)}
22: n_f2___6->n_f4___4: 1 {O(1)}
23: n_f3->n_f2___6: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
16: n_f0___3->n_f0___3: inf {Infinity}
17: n_f0___3->n_f2___2: inf {Infinity}
18: n_f0___5->n_f0___3: inf {Infinity}
19: n_f2___2->n_f0___5: inf {Infinity}
20: n_f2___2->n_f4___1: 1 {O(1)}
21: n_f2___6->n_f0___5: 1 {O(1)}
22: n_f2___6->n_f4___4: 1 {O(1)}
23: n_f3->n_f2___6: 1 {O(1)}

Sizebounds

17: n_f0___3->n_f2___2, Arg_0: 0 {O(1)}
17: n_f0___3->n_f2___2, Arg_3: 1 {O(1)}
19: n_f2___2->n_f0___5, Arg_3: 1 {O(1)}
20: n_f2___2->n_f4___1, Arg_0: 0 {O(1)}
20: n_f2___2->n_f4___1, Arg_3: 1 {O(1)}
21: n_f2___6->n_f0___5, Arg_1: Arg_1 {O(n)}
21: n_f2___6->n_f0___5, Arg_3: Arg_3 {O(n)}
22: n_f2___6->n_f4___4, Arg_1: Arg_1 {O(n)}
22: n_f2___6->n_f4___4, Arg_3: Arg_3 {O(n)}
23: n_f3->n_f2___6, Arg_1: Arg_1 {O(n)}
23: n_f3->n_f2___6, Arg_3: Arg_3 {O(n)}