Initial Problem

Start: n_f1
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: B_P, C_P, NoDet0
Locations: n_f1, n_f2___1, n_f2___5, n_f300___2, n_f300___3, n_f300___4
Transitions:
0:n_f1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___5(Arg_0,Arg_0,Arg_0,Arg_3):|:Arg_0<=Arg_1 && Arg_1<=Arg_0 && Arg_0<=Arg_2 && Arg_2<=Arg_0
1:n_f1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f300___2(Arg_0,B_P,Arg_2,NoDet0):|:1+B_P<=Arg_0 && Arg_1<=B_P && B_P<=Arg_1
2:n_f1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f300___3(Arg_0,B_P,C_P,NoDet0):|:Arg_0<=B_P && 1+C_P<=B_P && Arg_1<=B_P && B_P<=Arg_1 && Arg_2<=C_P && C_P<=Arg_2
3:n_f1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f300___4(Arg_0,B_P,C_P,NoDet0):|:B_P<=C_P && Arg_0<=B_P && 1+Arg_0<=C_P && Arg_1<=B_P && B_P<=Arg_1 && Arg_2<=C_P && C_P<=Arg_2
4:n_f2___1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___1(Arg_0+1,Arg_1+1,Arg_2-1,Arg_3)
5:n_f2___5(Arg_0,Arg_1,Arg_2,Arg_3) -> n_f2___1(Arg_0+1,Arg_1+1,Arg_2-1,Arg_3):|:Arg_0<=Arg_1 && Arg_1<=Arg_0 && Arg_0<=Arg_2 && Arg_2<=Arg_0

Preprocessing

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

Found invariant 2+Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && Arg_1<=Arg_0 && Arg_0<=Arg_1 for location n_f2___1

Found invariant 1+Arg_1<=Arg_0 for location n_f300___2

Found invariant Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_0<=Arg_1 for location n_f2___5

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

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

Problem after Preprocessing

Start: n_f1
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: B_P, C_P
Locations: n_f1, n_f2___1, n_f2___5, n_f300___2, n_f300___3, n_f300___4
Transitions:
9:n_f1(Arg_0,Arg_1,Arg_2) -> n_f2___5(Arg_0,Arg_0,Arg_0):|:Arg_0<=Arg_1 && Arg_1<=Arg_0 && Arg_0<=Arg_2 && Arg_2<=Arg_0
10:n_f1(Arg_0,Arg_1,Arg_2) -> n_f300___2(Arg_0,B_P,Arg_2):|:1+B_P<=Arg_0 && Arg_1<=B_P && B_P<=Arg_1
11:n_f1(Arg_0,Arg_1,Arg_2) -> n_f300___3(Arg_0,B_P,C_P):|:Arg_0<=B_P && 1+C_P<=B_P && Arg_1<=B_P && B_P<=Arg_1 && Arg_2<=C_P && C_P<=Arg_2
12:n_f1(Arg_0,Arg_1,Arg_2) -> n_f300___4(Arg_0,B_P,C_P):|:B_P<=C_P && Arg_0<=B_P && 1+Arg_0<=C_P && Arg_1<=B_P && B_P<=Arg_1 && Arg_2<=C_P && C_P<=Arg_2
13:n_f2___1(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+1,Arg_1+1,Arg_2-1):|:2+Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && Arg_1<=Arg_0 && Arg_0<=Arg_1
14:n_f2___5(Arg_0,Arg_1,Arg_2) -> n_f2___1(Arg_0+1,Arg_1+1,Arg_2-1):|:Arg_2<=Arg_1 && Arg_2<=Arg_0 && Arg_1<=Arg_2 && Arg_0<=Arg_2 && Arg_1<=Arg_0 && Arg_0<=Arg_1 && Arg_0<=Arg_1 && Arg_1<=Arg_0 && Arg_0<=Arg_2 && Arg_2<=Arg_0

All Bounds

Timebounds

Overall timebound:inf {Infinity}
9: n_f1->n_f2___5: 1 {O(1)}
10: n_f1->n_f300___2: 1 {O(1)}
11: n_f1->n_f300___3: 1 {O(1)}
12: n_f1->n_f300___4: 1 {O(1)}
13: n_f2___1->n_f2___1: inf {Infinity}
14: n_f2___5->n_f2___1: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
9: n_f1->n_f2___5: 1 {O(1)}
10: n_f1->n_f300___2: 1 {O(1)}
11: n_f1->n_f300___3: 1 {O(1)}
12: n_f1->n_f300___4: 1 {O(1)}
13: n_f2___1->n_f2___1: inf {Infinity}
14: n_f2___5->n_f2___1: 1 {O(1)}

Sizebounds

9: n_f1->n_f2___5, Arg_0: Arg_0 {O(n)}
9: n_f1->n_f2___5, Arg_1: Arg_0 {O(n)}
9: n_f1->n_f2___5, Arg_2: Arg_0 {O(n)}
10: n_f1->n_f300___2, Arg_0: Arg_0 {O(n)}
10: n_f1->n_f300___2, Arg_1: Arg_1 {O(n)}
10: n_f1->n_f300___2, Arg_2: Arg_2 {O(n)}
11: n_f1->n_f300___3, Arg_0: Arg_0 {O(n)}
11: n_f1->n_f300___3, Arg_1: Arg_1 {O(n)}
11: n_f1->n_f300___3, Arg_2: Arg_2 {O(n)}
12: n_f1->n_f300___4, Arg_0: Arg_0 {O(n)}
12: n_f1->n_f300___4, Arg_1: Arg_1 {O(n)}
12: n_f1->n_f300___4, Arg_2: Arg_2 {O(n)}
14: n_f2___5->n_f2___1, Arg_0: Arg_0+1 {O(n)}
14: n_f2___5->n_f2___1, Arg_1: Arg_0+1 {O(n)}
14: n_f2___5->n_f2___1, Arg_2: Arg_0+1 {O(n)}