Initial Problem

Start: n_f2
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3, Arg_4, Arg_5, Arg_6
Temp_Vars: F_P, G_P, NoDet0, NoDet1
Locations: n_f1___2, n_f1___3, n_f2, n_f300___1
Transitions:
0:n_f1___2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f1___2(Arg_0,Arg_1,NoDet0,NoDet1,Arg_4,Arg_5,Arg_6):|:1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && Arg_5<=Arg_6 && Arg_6<=Arg_5 && 1+Arg_1<=Arg_0
1:n_f1___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f1___2(Arg_0,Arg_1,NoDet0,NoDet1,Arg_4,Arg_5,Arg_6):|:Arg_5<=Arg_6 && Arg_6<=Arg_5 && 1+Arg_1<=Arg_0
2:n_f1___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f300___1(Arg_0,Arg_1,NoDet0,Arg_3,NoDet1,Arg_5,Arg_6):|:Arg_5<=Arg_6 && Arg_6<=Arg_5 && Arg_0<=Arg_1
3:n_f2(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,Arg_5,Arg_6) -> n_f1___3(Arg_0,Arg_1,Arg_2,Arg_3,Arg_4,F_P,G_P):|:F_P<=G_P && G_P<=F_P

Preprocessing

Eliminate variables {NoDet0,NoDet1,Arg_2,Arg_3,Arg_4} that do not contribute to the problem

Found invariant Arg_6<=Arg_5 && Arg_5<=Arg_6 && Arg_0<=Arg_1 for location n_f300___1

Found invariant Arg_6<=Arg_5 && Arg_5<=Arg_6 && 1+Arg_1<=Arg_0 for location n_f1___2

Found invariant Arg_6<=Arg_5 && Arg_5<=Arg_6 for location n_f1___3

Problem after Preprocessing

Start: n_f2
Program_Vars: Arg_0, Arg_1, Arg_5, Arg_6
Temp_Vars: F_P, G_P
Locations: n_f1___2, n_f1___3, n_f2, n_f300___1
Transitions:
8:n_f1___2(Arg_0,Arg_1,Arg_5,Arg_6) -> n_f1___2(Arg_0,Arg_1,Arg_5,Arg_6):|:Arg_6<=Arg_5 && Arg_5<=Arg_6 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && Arg_5<=Arg_6 && Arg_6<=Arg_5 && 1+Arg_1<=Arg_0
9:n_f1___3(Arg_0,Arg_1,Arg_5,Arg_6) -> n_f1___2(Arg_0,Arg_1,Arg_5,Arg_6):|:Arg_6<=Arg_5 && Arg_5<=Arg_6 && Arg_5<=Arg_6 && Arg_6<=Arg_5 && 1+Arg_1<=Arg_0
10:n_f1___3(Arg_0,Arg_1,Arg_5,Arg_6) -> n_f300___1(Arg_0,Arg_1,Arg_5,Arg_6):|:Arg_6<=Arg_5 && Arg_5<=Arg_6 && Arg_5<=Arg_6 && Arg_6<=Arg_5 && Arg_0<=Arg_1
11:n_f2(Arg_0,Arg_1,Arg_5,Arg_6) -> n_f1___3(Arg_0,Arg_1,F_P,G_P):|:F_P<=G_P && G_P<=F_P

All Bounds

Timebounds

Overall timebound:inf {Infinity}
8: n_f1___2->n_f1___2: inf {Infinity}
9: n_f1___3->n_f1___2: 1 {O(1)}
10: n_f1___3->n_f300___1: 1 {O(1)}
11: n_f2->n_f1___3: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
8: n_f1___2->n_f1___2: inf {Infinity}
9: n_f1___3->n_f1___2: 1 {O(1)}
10: n_f1___3->n_f300___1: 1 {O(1)}
11: n_f2->n_f1___3: 1 {O(1)}

Sizebounds

8: n_f1___2->n_f1___2, Arg_0: Arg_0 {O(n)}
8: n_f1___2->n_f1___2, Arg_1: Arg_1 {O(n)}
9: n_f1___3->n_f1___2, Arg_0: Arg_0 {O(n)}
9: n_f1___3->n_f1___2, Arg_1: Arg_1 {O(n)}
10: n_f1___3->n_f300___1, Arg_0: Arg_0 {O(n)}
10: n_f1___3->n_f300___1, Arg_1: Arg_1 {O(n)}
11: n_f2->n_f1___3, Arg_0: Arg_0 {O(n)}
11: n_f2->n_f1___3, Arg_1: Arg_1 {O(n)}