Initial Problem

Start: n_f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5
Temp_Vars: A_P, B_P, D_P, NoDet0
Locations: n_f1, n_f2___2, n_f2___3, n_f300___1
Transitions:
0:n_f1(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> n_f2___3(A_P,B_P,Arg_2,Arg_3,Arg_4,Arg_5):|:A_P<=B_P && B_P<=A_P
1:n_f2___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> n_f2___2(Arg_0,Arg_1,Arg_2,D_P,NoDet0,Arg_5):|:1+Arg_2<=Arg_3 && Arg_0<=Arg_1 && Arg_1<=Arg_0 && 1+Arg_2<=Arg_3 && 1+Arg_2<=Arg_3 && 1+Arg_2<=D_P && Arg_3<=D_P && D_P<=Arg_3
2:n_f2___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> n_f2___2(Arg_0,Arg_1,Arg_2,D_P,NoDet0,Arg_5):|:Arg_0<=Arg_1 && Arg_1<=Arg_0 && 1+Arg_2<=D_P && Arg_3<=D_P && D_P<=Arg_3
3:n_f2___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5) -> n_f300___1(Arg_0,Arg_1,Arg_2,D_P,Arg_4,NoDet0):|:Arg_0<=Arg_1 && Arg_1<=Arg_0 && D_P<=Arg_2 && Arg_3<=D_P && D_P<=Arg_3

Preprocessing

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

Found invariant Arg_3<=Arg_2 && Arg_1<=Arg_0 && Arg_0<=Arg_1 for location n_f300___1

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

Found invariant Arg_1<=Arg_0 && Arg_0<=Arg_1 for location n_f2___3

Problem after Preprocessing

Start: n_f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: A_P, B_P, D_P
Locations: n_f1, n_f2___2, n_f2___3, n_f300___1
Transitions:
8:n_f1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___3(A_P,B_P,Arg_2,Arg_3):|:A_P<=B_P && B_P<=A_P
9:n_f2___2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___2(Arg_0,Arg_1,Arg_2,D_P):|:1+Arg_2<=Arg_3 && Arg_1<=Arg_0 && Arg_0<=Arg_1 && 1+Arg_2<=Arg_3 && Arg_0<=Arg_1 && Arg_1<=Arg_0 && 1+Arg_2<=Arg_3 && 1+Arg_2<=Arg_3 && 1+Arg_2<=D_P && Arg_3<=D_P && D_P<=Arg_3
10:n_f2___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___2(Arg_0,Arg_1,Arg_2,D_P):|:Arg_1<=Arg_0 && Arg_0<=Arg_1 && Arg_0<=Arg_1 && Arg_1<=Arg_0 && 1+Arg_2<=D_P && Arg_3<=D_P && D_P<=Arg_3
11:n_f2___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f300___1(Arg_0,Arg_1,Arg_2,D_P):|:Arg_1<=Arg_0 && Arg_0<=Arg_1 && Arg_0<=Arg_1 && Arg_1<=Arg_0 && D_P<=Arg_2 && Arg_3<=D_P && D_P<=Arg_3

All Bounds

Timebounds

Overall timebound:inf {Infinity}
8: n_f1->n_f2___3: 1 {O(1)}
9: n_f2___2->n_f2___2: inf {Infinity}
10: n_f2___3->n_f2___2: 1 {O(1)}
11: n_f2___3->n_f300___1: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
8: n_f1->n_f2___3: 1 {O(1)}
9: n_f2___2->n_f2___2: inf {Infinity}
10: n_f2___3->n_f2___2: 1 {O(1)}
11: n_f2___3->n_f300___1: 1 {O(1)}

Sizebounds

8: n_f1->n_f2___3, Arg_2: Arg_2 {O(n)}
8: n_f1->n_f2___3, Arg_3: Arg_3 {O(n)}
9: n_f2___2->n_f2___2, Arg_2: Arg_2 {O(n)}
9: n_f2___2->n_f2___2, Arg_3: Arg_3 {O(n)}
10: n_f2___3->n_f2___2, Arg_2: Arg_2 {O(n)}
10: n_f2___3->n_f2___2, Arg_3: Arg_3 {O(n)}
11: n_f2___3->n_f300___1, Arg_2: Arg_2 {O(n)}
11: n_f2___3->n_f300___1, Arg_3: Arg_3 {O(n)}