Initial Problem
Start: n_evalinsertsortstart
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: NoDet0
Locations: n_evalinsertsortbb1in___13, n_evalinsertsortbb1in___18, n_evalinsertsortbb2in___16, n_evalinsertsortbb2in___20, n_evalinsertsortbb2in___8, n_evalinsertsortbb3in___15, n_evalinsertsortbb3in___19, n_evalinsertsortbb4in___12, n_evalinsertsortbb4in___14, n_evalinsertsortbb4in___17, n_evalinsertsortbb4in___7, n_evalinsertsortbb5in___11, n_evalinsertsortbb5in___23, n_evalinsertsortbb5in___5, n_evalinsertsortbbin___10, n_evalinsertsortbbin___22, n_evalinsertsortbbin___4, n_evalinsertsortentryin___24, n_evalinsertsortreturnin___21, n_evalinsertsortreturnin___3, n_evalinsertsortreturnin___9, n_evalinsertsortstart, n_evalinsertsortstop___1, n_evalinsertsortstop___2, n_evalinsertsortstop___6
Transitions:
0:n_evalinsertsortbb1in___13(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_2,Arg_3-1):|:0<=Arg_3
1:n_evalinsertsortbb1in___18(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_2,Arg_3-1):|:0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0
2:n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb3in___15(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_3
3:n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb4in___14(Arg_0,Arg_1,Arg_2,Arg_3):|:1+Arg_3<=0
4:n_evalinsertsortbb2in___20(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_3 && Arg_0<=1+Arg_3 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 0<=Arg_3
5:n_evalinsertsortbb2in___8(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=1+Arg_3 && 1+Arg_3<=Arg_0 && 0<=Arg_3
6:n_evalinsertsortbb2in___8(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb4in___7(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=1+Arg_3 && 1+Arg_3<=Arg_0 && 1+Arg_3<=0
7:n_evalinsertsortbb3in___15(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb1in___13(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_3
8:n_evalinsertsortbb3in___15(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb4in___12(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_3
9:n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb1in___18(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0
10:n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb4in___17(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0
11:n_evalinsertsortbb4in___12(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb5in___11(Arg_0+1,Arg_1,Arg_2,Arg_3):|:0<=Arg_3
12:n_evalinsertsortbb4in___14(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb5in___11(Arg_0+1,Arg_1,Arg_2,Arg_3):|:1+Arg_3<=0
13:n_evalinsertsortbb4in___17(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb5in___5(Arg_0+1,Arg_1,Arg_2,Arg_3):|:0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0
14:n_evalinsertsortbb4in___7(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb5in___11(Arg_0+1,Arg_1,Arg_2,Arg_3):|:Arg_0<=0 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0
15:n_evalinsertsortbb5in___11(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbbin___10(Arg_0,Arg_1,Arg_2,Arg_3):|:1+Arg_0<=Arg_1
16:n_evalinsertsortbb5in___11(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortreturnin___9(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0
17:n_evalinsertsortbb5in___23(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbbin___22(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_0 && Arg_0<=1 && 1<=Arg_0 && 1+Arg_0<=Arg_1
18:n_evalinsertsortbb5in___23(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortreturnin___21(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_0 && Arg_0<=1 && 1<=Arg_0 && Arg_1<=Arg_0
19:n_evalinsertsortbb5in___5(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbbin___4(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_0 && 1+Arg_0<=Arg_1
20:n_evalinsertsortbb5in___5(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortreturnin___3(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_0 && Arg_1<=Arg_0
21:n_evalinsertsortbbin___10(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb2in___8(Arg_0,Arg_1,NoDet0,Arg_0-1):|:1+Arg_0<=Arg_1
22:n_evalinsertsortbbin___22(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb2in___20(Arg_0,Arg_1,NoDet0,Arg_0-1):|:2<=Arg_1 && Arg_0<=1 && 1<=Arg_0
23:n_evalinsertsortbbin___4(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb2in___20(Arg_0,Arg_1,NoDet0,Arg_0-1):|:1+Arg_0<=Arg_1 && 1<=Arg_0
24:n_evalinsertsortentryin___24(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortbb5in___23(1,Arg_1,Arg_2,Arg_3)
25:n_evalinsertsortreturnin___21(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortstop___1(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=1 && Arg_0<=1 && 1<=Arg_0
26:n_evalinsertsortreturnin___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortstop___2(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 1<=Arg_0
27:n_evalinsertsortreturnin___9(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortstop___6(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0
28:n_evalinsertsortstart(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalinsertsortentryin___24(Arg_0,Arg_1,Arg_2,Arg_3)
Preprocessing
Eliminate variables {NoDet0,Arg_2} that do not contribute to the problem
Found invariant Arg_0<=1 && 1<=Arg_0 for location n_evalinsertsortbb5in___23
Found invariant 2+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortbb5in___5
Found invariant 3+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortbb5in___11
Found invariant 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && Arg_0<=1 && 1<=Arg_0 for location n_evalinsertsortbbin___22
Found invariant 3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortbbin___4
Found invariant 3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortbb3in___15
Found invariant 2+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && Arg_1<=2+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && Arg_1<=Arg_0 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortstop___2
Found invariant 3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 0<=Arg_0+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 for location n_evalinsertsortbb2in___16
Found invariant 2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 for location n_evalinsertsortbb4in___17
Found invariant 1<=0 for location n_evalinsertsortbb4in___7
Found invariant 3+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_1<=Arg_0 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortreturnin___9
Found invariant 2+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && Arg_1<=2+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && Arg_1<=Arg_0 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortreturnin___3
Found invariant 1+Arg_3<=0 && 3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 0<=Arg_0+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 for location n_evalinsertsortbb4in___14
Found invariant 3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortbb1in___13
Found invariant 2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 for location n_evalinsertsortbb3in___19
Found invariant 4+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortbbin___10
Found invariant 2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 for location n_evalinsertsortbb1in___18
Found invariant 2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 1<=Arg_3 && 4<=Arg_1+Arg_3 && 3<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortbb2in___8
Found invariant 3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortbb4in___12
Found invariant Arg_1<=1 && Arg_1<=Arg_0 && Arg_0+Arg_1<=2 && Arg_0<=1 && 1<=Arg_0 for location n_evalinsertsortreturnin___21
Found invariant 2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 for location n_evalinsertsortbb2in___20
Found invariant Arg_1<=1 && Arg_1<=Arg_0 && Arg_0+Arg_1<=2 && Arg_0<=1 && 1<=Arg_0 for location n_evalinsertsortstop___1
Found invariant 3+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_1<=Arg_0 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 for location n_evalinsertsortstop___6
Cut unsatisfiable transition 64: n_evalinsertsortbb2in___8->n_evalinsertsortbb4in___7
Cut unsatisfiable transition 72: n_evalinsertsortbb4in___7->n_evalinsertsortbb5in___11
Cut unreachable locations [n_evalinsertsortbb4in___7] from the program graph
Problem after Preprocessing
Start: n_evalinsertsortstart
Program_Vars: Arg_0, Arg_1, Arg_3
Temp_Vars:
Locations: n_evalinsertsortbb1in___13, n_evalinsertsortbb1in___18, n_evalinsertsortbb2in___16, n_evalinsertsortbb2in___20, n_evalinsertsortbb2in___8, n_evalinsertsortbb3in___15, n_evalinsertsortbb3in___19, n_evalinsertsortbb4in___12, n_evalinsertsortbb4in___14, n_evalinsertsortbb4in___17, n_evalinsertsortbb5in___11, n_evalinsertsortbb5in___23, n_evalinsertsortbb5in___5, n_evalinsertsortbbin___10, n_evalinsertsortbbin___22, n_evalinsertsortbbin___4, n_evalinsertsortentryin___24, n_evalinsertsortreturnin___21, n_evalinsertsortreturnin___3, n_evalinsertsortreturnin___9, n_evalinsertsortstart, n_evalinsertsortstop___1, n_evalinsertsortstop___2, n_evalinsertsortstop___6
Transitions:
58:n_evalinsertsortbb1in___13(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_3-1):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 0<=Arg_3
59:n_evalinsertsortbb1in___18(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_3-1):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0
60:n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb3in___15(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 0<=Arg_0+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3
61:n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb4in___14(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 0<=Arg_0+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 1+Arg_3<=0
62:n_evalinsertsortbb2in___20(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=1+Arg_3 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 0<=Arg_3
63:n_evalinsertsortbb2in___8(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 1<=Arg_3 && 4<=Arg_1+Arg_3 && 3<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && Arg_0<=1+Arg_3 && 1+Arg_3<=Arg_0 && 0<=Arg_3
65:n_evalinsertsortbb3in___15(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb1in___13(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 0<=Arg_3
66:n_evalinsertsortbb3in___15(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb4in___12(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 0<=Arg_3
67:n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb1in___18(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0
68:n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb4in___17(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0
69:n_evalinsertsortbb4in___12(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb5in___11(Arg_0+1,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 0<=Arg_3
70:n_evalinsertsortbb4in___14(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb5in___11(Arg_0+1,Arg_1,Arg_3):|:1+Arg_3<=0 && 3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 0<=Arg_0+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 1+Arg_3<=0
71:n_evalinsertsortbb4in___17(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb5in___5(Arg_0+1,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0
73:n_evalinsertsortbb5in___11(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbbin___10(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 && 1+Arg_0<=Arg_1
74:n_evalinsertsortbb5in___11(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortreturnin___9(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 && Arg_1<=Arg_0
75:n_evalinsertsortbb5in___23(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbbin___22(Arg_0,Arg_1,Arg_3):|:Arg_0<=1 && 1<=Arg_0 && 1<=Arg_0 && Arg_0<=1 && 1<=Arg_0 && 1+Arg_0<=Arg_1
76:n_evalinsertsortbb5in___23(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortreturnin___21(Arg_0,Arg_1,Arg_3):|:Arg_0<=1 && 1<=Arg_0 && 1<=Arg_0 && Arg_0<=1 && 1<=Arg_0 && Arg_1<=Arg_0
77:n_evalinsertsortbb5in___5(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbbin___4(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 && 1<=Arg_0 && 1+Arg_0<=Arg_1
78:n_evalinsertsortbb5in___5(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortreturnin___3(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 && 1<=Arg_0 && Arg_1<=Arg_0
79:n_evalinsertsortbbin___10(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb2in___8(Arg_0,Arg_1,Arg_0-1):|:4+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 1+Arg_0<=Arg_1
80:n_evalinsertsortbbin___22(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb2in___20(Arg_0,Arg_1,Arg_0-1):|:2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && Arg_0<=1 && 1<=Arg_0 && 2<=Arg_1 && Arg_0<=1 && 1<=Arg_0
81:n_evalinsertsortbbin___4(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb2in___20(Arg_0,Arg_1,Arg_0-1):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 1+Arg_0<=Arg_1 && 1<=Arg_0
82:n_evalinsertsortentryin___24(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb5in___23(1,Arg_1,Arg_3)
83:n_evalinsertsortreturnin___21(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortstop___1(Arg_0,Arg_1,Arg_3):|:Arg_1<=1 && Arg_1<=Arg_0 && Arg_0+Arg_1<=2 && Arg_0<=1 && 1<=Arg_0 && Arg_1<=1 && Arg_0<=1 && 1<=Arg_0
84:n_evalinsertsortreturnin___3(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortstop___2(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && Arg_1<=2+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && Arg_1<=Arg_0 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 && Arg_1<=Arg_0 && 1<=Arg_0
85:n_evalinsertsortreturnin___9(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortstop___6(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_1<=Arg_0 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 && Arg_1<=Arg_0
86:n_evalinsertsortstart(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortentryin___24(Arg_0,Arg_1,Arg_3)
MPRF for transition 59:n_evalinsertsortbb1in___18(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_3-1):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0 of depth 1:
new bound:
Arg_1+1 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb1in___13 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb3in___15 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb1in___18 [Arg_1-Arg_3-1 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_0 ]
n_evalinsertsortbb4in___12 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___14 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_3-1 ]
n_evalinsertsortbb5in___11 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_3-1 ]
n_evalinsertsortbbin___10 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_0 ]
n_evalinsertsortbbin___4 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1-Arg_0 ]
MPRF for transition 61:n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb4in___14(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 0<=Arg_0+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 1+Arg_3<=0 of depth 1:
new bound:
Arg_1+1 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1-Arg_0 ]
n_evalinsertsortbb1in___13 [Arg_1-Arg_0 ]
n_evalinsertsortbb3in___15 [Arg_1-Arg_0 ]
n_evalinsertsortbb1in___18 [Arg_1-Arg_0 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_0 ]
n_evalinsertsortbb4in___12 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___14 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___11 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_3-1 ]
n_evalinsertsortbbin___10 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_0 ]
n_evalinsertsortbbin___4 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1-Arg_0 ]
MPRF for transition 62:n_evalinsertsortbb2in___20(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=1+Arg_3 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 0<=Arg_3 of depth 1:
new bound:
Arg_1+2 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1-Arg_0 ]
n_evalinsertsortbb1in___13 [Arg_1-Arg_0 ]
n_evalinsertsortbb3in___15 [Arg_1-Arg_0 ]
n_evalinsertsortbb1in___18 [Arg_1-Arg_0 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_0 ]
n_evalinsertsortbb4in___12 [Arg_1-Arg_0 ]
n_evalinsertsortbb4in___14 [Arg_1-Arg_0 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___11 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_3-1 ]
n_evalinsertsortbbin___10 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_0 ]
n_evalinsertsortbbin___4 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1+1-Arg_0 ]
MPRF for transition 63:n_evalinsertsortbb2in___8(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 1<=Arg_3 && 4<=Arg_1+Arg_3 && 3<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && Arg_0<=1+Arg_3 && 1+Arg_3<=Arg_0 && 0<=Arg_3 of depth 1:
new bound:
Arg_1+1 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb1in___13 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb3in___15 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb1in___18 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___12 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___14 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb5in___11 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_0 ]
n_evalinsertsortbbin___10 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_0 ]
n_evalinsertsortbbin___4 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1-Arg_0 ]
MPRF for transition 66:n_evalinsertsortbb3in___15(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb4in___12(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 0<=Arg_3 of depth 1:
new bound:
2*Arg_1+2 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb1in___13 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb3in___15 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb1in___18 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb3in___19 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb4in___12 [2*Arg_1-2*Arg_0-2 ]
n_evalinsertsortbb4in___14 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb4in___17 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb5in___11 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb5in___5 [2*Arg_1+2-2*Arg_0 ]
n_evalinsertsortbbin___10 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb2in___8 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbbin___4 [2*Arg_1+2-2*Arg_0 ]
n_evalinsertsortbb2in___20 [2*Arg_1-2*Arg_0 ]
MPRF for transition 67:n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb1in___18(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0 of depth 1:
new bound:
Arg_1+1 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb1in___13 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb3in___15 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb1in___18 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_3-1 ]
n_evalinsertsortbb4in___12 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___14 [Arg_1+Arg_3-Arg_0 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_3-1 ]
n_evalinsertsortbb5in___11 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_3-1 ]
n_evalinsertsortbbin___10 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_3-1 ]
n_evalinsertsortbbin___4 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1-Arg_3-1 ]
MPRF for transition 68:n_evalinsertsortbb3in___19(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb4in___17(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0 of depth 1:
new bound:
Arg_1+1 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1-Arg_0 ]
n_evalinsertsortbb1in___13 [Arg_1-Arg_0 ]
n_evalinsertsortbb3in___15 [Arg_1-Arg_0 ]
n_evalinsertsortbb1in___18 [Arg_1-Arg_0 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_3-1 ]
n_evalinsertsortbb4in___12 [Arg_1-Arg_0 ]
n_evalinsertsortbb4in___14 [Arg_1-Arg_0 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_3-2 ]
n_evalinsertsortbb5in___11 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_0 ]
n_evalinsertsortbbin___10 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_3-1 ]
n_evalinsertsortbbin___4 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1-Arg_3-1 ]
MPRF for transition 69:n_evalinsertsortbb4in___12(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb5in___11(Arg_0+1,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 0<=Arg_3 of depth 1:
new bound:
Arg_1+1 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb1in___13 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb3in___15 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb1in___18 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb3in___19 [Arg_0+Arg_1-2*Arg_3 ]
n_evalinsertsortbb4in___12 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb4in___14 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb4in___17 [Arg_0+Arg_1-2*Arg_3 ]
n_evalinsertsortbb5in___11 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_3 ]
n_evalinsertsortbbin___10 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1+2-Arg_0 ]
n_evalinsertsortbbin___4 [Arg_1-Arg_3 ]
n_evalinsertsortbb2in___20 [Arg_0+Arg_1-2*Arg_3 ]
MPRF for transition 70:n_evalinsertsortbb4in___14(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb5in___11(Arg_0+1,Arg_1,Arg_3):|:1+Arg_3<=0 && 3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 0<=Arg_0+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 1+Arg_3<=0 of depth 1:
new bound:
Arg_1+1 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1-Arg_0 ]
n_evalinsertsortbb1in___13 [Arg_1-Arg_0 ]
n_evalinsertsortbb3in___15 [Arg_1-Arg_0 ]
n_evalinsertsortbb1in___18 [Arg_1-Arg_3-1 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_3-1 ]
n_evalinsertsortbb4in___12 [Arg_1-Arg_0 ]
n_evalinsertsortbb4in___14 [Arg_1-Arg_0 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___11 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_0 ]
n_evalinsertsortbbin___10 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_3-1 ]
n_evalinsertsortbbin___4 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1-Arg_3-1 ]
MPRF for transition 71:n_evalinsertsortbb4in___17(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb5in___5(Arg_0+1,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 1+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && Arg_0<=1+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 && Arg_0<=Arg_3+1 && 1+Arg_3<=Arg_0 of depth 1:
new bound:
Arg_1+2 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb1in___13 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb3in___15 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb1in___18 [Arg_1-Arg_3 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_3 ]
n_evalinsertsortbb4in___12 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb4in___14 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_3 ]
n_evalinsertsortbb5in___11 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_3-1 ]
n_evalinsertsortbbin___10 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_3 ]
n_evalinsertsortbbin___4 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1+1-Arg_0 ]
MPRF for transition 73:n_evalinsertsortbb5in___11(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbbin___10(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 && 1+Arg_0<=Arg_1 of depth 1:
new bound:
Arg_1 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb1in___13 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb3in___15 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb1in___18 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_3 ]
n_evalinsertsortbb4in___12 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb4in___14 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_3 ]
n_evalinsertsortbb5in___11 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_3 ]
n_evalinsertsortbbin___10 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_3 ]
n_evalinsertsortbbin___4 [Arg_1-Arg_3 ]
n_evalinsertsortbb2in___20 [Arg_1-Arg_3 ]
MPRF for transition 77:n_evalinsertsortbb5in___5(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbbin___4(Arg_0,Arg_1,Arg_3):|:2+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 2<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && 2<=Arg_1 && 4<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 2<=Arg_0 && 1<=Arg_0 && 1+Arg_0<=Arg_1 of depth 1:
new bound:
Arg_1+1 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb1in___13 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb3in___15 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb1in___18 [Arg_1-Arg_3 ]
n_evalinsertsortbb3in___19 [Arg_1+1-Arg_3 ]
n_evalinsertsortbb4in___12 [Arg_1+1-Arg_0 ]
n_evalinsertsortbb4in___14 [Arg_1-Arg_0-Arg_3 ]
n_evalinsertsortbb4in___17 [Arg_0+Arg_1-2*Arg_3 ]
n_evalinsertsortbb5in___11 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1+1-Arg_3 ]
n_evalinsertsortbbin___10 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1+1-Arg_3 ]
n_evalinsertsortbbin___4 [Arg_1+2-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1+1-Arg_3 ]
MPRF for transition 79:n_evalinsertsortbbin___10(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb2in___8(Arg_0,Arg_1,Arg_0-1):|:4+Arg_3<=Arg_1 && 3+Arg_3<=Arg_0 && 0<=1+Arg_3 && 2<=Arg_1+Arg_3 && 1<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 1+Arg_0<=Arg_1 of depth 1:
new bound:
Arg_1+2 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb1in___13 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb3in___15 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb1in___18 [Arg_1+Arg_3-2*Arg_0 ]
n_evalinsertsortbb3in___19 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___12 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___14 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb4in___17 [Arg_1-Arg_0-1 ]
n_evalinsertsortbb5in___11 [Arg_1-Arg_0 ]
n_evalinsertsortbb5in___5 [Arg_1-Arg_0 ]
n_evalinsertsortbbin___10 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1-Arg_0-1 ]
n_evalinsertsortbbin___4 [Arg_1-Arg_0 ]
n_evalinsertsortbb2in___20 [Arg_1-Arg_3-2 ]
MPRF for transition 81:n_evalinsertsortbbin___4(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb2in___20(Arg_0,Arg_1,Arg_0-1):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && Arg_0<=2+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 1+Arg_0<=Arg_1 && 1<=Arg_0 of depth 1:
new bound:
2*Arg_1+2 {O(n)}
MPRF:
n_evalinsertsortbb2in___16 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb1in___13 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb3in___15 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb1in___18 [2*Arg_1-2*Arg_3-2 ]
n_evalinsertsortbb3in___19 [2*Arg_1-2*Arg_3-2 ]
n_evalinsertsortbb4in___12 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb4in___14 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb4in___17 [2*Arg_1-Arg_0-Arg_3-1 ]
n_evalinsertsortbb5in___11 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb5in___5 [2*Arg_1-Arg_0-Arg_3 ]
n_evalinsertsortbbin___10 [2*Arg_1-2*Arg_0 ]
n_evalinsertsortbb2in___8 [2*Arg_1-2*Arg_3-2 ]
n_evalinsertsortbbin___4 [2*Arg_1+1-2*Arg_0 ]
n_evalinsertsortbb2in___20 [2*Arg_1-2*Arg_3-2 ]
MPRF for transition 58:n_evalinsertsortbb1in___13(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_3-1):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 0<=Arg_3 of depth 1:
new bound:
7*Arg_1*Arg_1+25*Arg_1+21 {O(n^2)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_3+1 ]
n_evalinsertsortbb2in___8 [Arg_0+Arg_1-Arg_3 ]
n_evalinsertsortbb1in___13 [Arg_3+1 ]
n_evalinsertsortbb3in___15 [Arg_3+1 ]
n_evalinsertsortbb1in___18 [Arg_3 ]
n_evalinsertsortbb3in___19 [Arg_0+Arg_1-Arg_3 ]
n_evalinsertsortbb4in___12 [0 ]
n_evalinsertsortbb4in___14 [Arg_3+1 ]
n_evalinsertsortbb4in___17 [Arg_0+Arg_1-Arg_3 ]
n_evalinsertsortbb5in___11 [0 ]
n_evalinsertsortbbin___10 [0 ]
n_evalinsertsortbb5in___5 [Arg_1+1 ]
n_evalinsertsortbbin___4 [Arg_1+1 ]
n_evalinsertsortbb2in___20 [Arg_0+Arg_1-Arg_3 ]
MPRF for transition 60:n_evalinsertsortbb2in___16(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb3in___15(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=1+Arg_3 && 1<=Arg_1+Arg_3 && 0<=Arg_0+Arg_3 && 2<=Arg_1 && 3<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 1<=Arg_0 && 0<=Arg_3 of depth 1:
new bound:
Arg_1*Arg_1+3*Arg_1+4 {O(n^2)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_1+Arg_3-Arg_0 ]
n_evalinsertsortbb2in___8 [Arg_1 ]
n_evalinsertsortbb1in___13 [Arg_1+Arg_3-Arg_0-1 ]
n_evalinsertsortbb3in___15 [Arg_1+Arg_3-Arg_0-1 ]
n_evalinsertsortbb1in___18 [Arg_1+Arg_3-Arg_0-1 ]
n_evalinsertsortbb3in___19 [Arg_1+2*Arg_3+2-2*Arg_0 ]
n_evalinsertsortbb4in___12 [2*Arg_0+Arg_3+2-2*Arg_1 ]
n_evalinsertsortbb4in___14 [Arg_0+Arg_3+2-Arg_1 ]
n_evalinsertsortbb4in___17 [Arg_1 ]
n_evalinsertsortbb5in___11 [2*Arg_0+Arg_3-2*Arg_1 ]
n_evalinsertsortbbin___10 [2*Arg_0+Arg_3-2*Arg_1 ]
n_evalinsertsortbb5in___5 [Arg_1 ]
n_evalinsertsortbbin___4 [Arg_1 ]
n_evalinsertsortbb2in___20 [Arg_1+2*Arg_3+2-2*Arg_0 ]
MPRF for transition 65:n_evalinsertsortbb3in___15(Arg_0,Arg_1,Arg_3) -> n_evalinsertsortbb1in___13(Arg_0,Arg_1,Arg_3):|:3+Arg_3<=Arg_1 && 2+Arg_3<=Arg_0 && 0<=Arg_3 && 3<=Arg_1+Arg_3 && 2<=Arg_0+Arg_3 && 3<=Arg_1 && 5<=Arg_0+Arg_1 && 1+Arg_0<=Arg_1 && 2<=Arg_0 && 0<=Arg_3 of depth 1:
new bound:
5*Arg_1*Arg_1+17*Arg_1+11 {O(n^2)}
MPRF:
n_evalinsertsortbb2in___16 [Arg_3+1 ]
n_evalinsertsortbb2in___8 [2*Arg_1-Arg_0 ]
n_evalinsertsortbb1in___13 [Arg_3 ]
n_evalinsertsortbb3in___15 [Arg_3+1 ]
n_evalinsertsortbb1in___18 [Arg_3 ]
n_evalinsertsortbb3in___19 [2*Arg_1-Arg_0 ]
n_evalinsertsortbb4in___12 [0 ]
n_evalinsertsortbb4in___14 [Arg_3+1 ]
n_evalinsertsortbb4in___17 [2*Arg_1-Arg_3-2 ]
n_evalinsertsortbb5in___11 [0 ]
n_evalinsertsortbbin___10 [0 ]
n_evalinsertsortbb5in___5 [2*Arg_1-Arg_3-2 ]
n_evalinsertsortbbin___4 [2*Arg_1-Arg_0 ]
n_evalinsertsortbb2in___20 [2*Arg_1-Arg_0 ]
All Bounds
Timebounds
Overall timebound:13*Arg_1*Arg_1+61*Arg_1+64 {O(n^2)}
58: n_evalinsertsortbb1in___13->n_evalinsertsortbb2in___16: 7*Arg_1*Arg_1+25*Arg_1+21 {O(n^2)}
59: n_evalinsertsortbb1in___18->n_evalinsertsortbb2in___16: Arg_1+1 {O(n)}
60: n_evalinsertsortbb2in___16->n_evalinsertsortbb3in___15: Arg_1*Arg_1+3*Arg_1+4 {O(n^2)}
61: n_evalinsertsortbb2in___16->n_evalinsertsortbb4in___14: Arg_1+1 {O(n)}
62: n_evalinsertsortbb2in___20->n_evalinsertsortbb3in___19: Arg_1+2 {O(n)}
63: n_evalinsertsortbb2in___8->n_evalinsertsortbb3in___19: Arg_1+1 {O(n)}
65: n_evalinsertsortbb3in___15->n_evalinsertsortbb1in___13: 5*Arg_1*Arg_1+17*Arg_1+11 {O(n^2)}
66: n_evalinsertsortbb3in___15->n_evalinsertsortbb4in___12: 2*Arg_1+2 {O(n)}
67: n_evalinsertsortbb3in___19->n_evalinsertsortbb1in___18: Arg_1+1 {O(n)}
68: n_evalinsertsortbb3in___19->n_evalinsertsortbb4in___17: Arg_1+1 {O(n)}
69: n_evalinsertsortbb4in___12->n_evalinsertsortbb5in___11: Arg_1+1 {O(n)}
70: n_evalinsertsortbb4in___14->n_evalinsertsortbb5in___11: Arg_1+1 {O(n)}
71: n_evalinsertsortbb4in___17->n_evalinsertsortbb5in___5: Arg_1+2 {O(n)}
73: n_evalinsertsortbb5in___11->n_evalinsertsortbbin___10: Arg_1 {O(n)}
74: n_evalinsertsortbb5in___11->n_evalinsertsortreturnin___9: 1 {O(1)}
75: n_evalinsertsortbb5in___23->n_evalinsertsortbbin___22: 1 {O(1)}
76: n_evalinsertsortbb5in___23->n_evalinsertsortreturnin___21: 1 {O(1)}
77: n_evalinsertsortbb5in___5->n_evalinsertsortbbin___4: Arg_1+1 {O(n)}
78: n_evalinsertsortbb5in___5->n_evalinsertsortreturnin___3: 1 {O(1)}
79: n_evalinsertsortbbin___10->n_evalinsertsortbb2in___8: Arg_1+2 {O(n)}
80: n_evalinsertsortbbin___22->n_evalinsertsortbb2in___20: 1 {O(1)}
81: n_evalinsertsortbbin___4->n_evalinsertsortbb2in___20: 2*Arg_1+2 {O(n)}
82: n_evalinsertsortentryin___24->n_evalinsertsortbb5in___23: 1 {O(1)}
83: n_evalinsertsortreturnin___21->n_evalinsertsortstop___1: 1 {O(1)}
84: n_evalinsertsortreturnin___3->n_evalinsertsortstop___2: 1 {O(1)}
85: n_evalinsertsortreturnin___9->n_evalinsertsortstop___6: 1 {O(1)}
86: n_evalinsertsortstart->n_evalinsertsortentryin___24: 1 {O(1)}
Costbounds
Overall costbound: 13*Arg_1*Arg_1+61*Arg_1+64 {O(n^2)}
58: n_evalinsertsortbb1in___13->n_evalinsertsortbb2in___16: 7*Arg_1*Arg_1+25*Arg_1+21 {O(n^2)}
59: n_evalinsertsortbb1in___18->n_evalinsertsortbb2in___16: Arg_1+1 {O(n)}
60: n_evalinsertsortbb2in___16->n_evalinsertsortbb3in___15: Arg_1*Arg_1+3*Arg_1+4 {O(n^2)}
61: n_evalinsertsortbb2in___16->n_evalinsertsortbb4in___14: Arg_1+1 {O(n)}
62: n_evalinsertsortbb2in___20->n_evalinsertsortbb3in___19: Arg_1+2 {O(n)}
63: n_evalinsertsortbb2in___8->n_evalinsertsortbb3in___19: Arg_1+1 {O(n)}
65: n_evalinsertsortbb3in___15->n_evalinsertsortbb1in___13: 5*Arg_1*Arg_1+17*Arg_1+11 {O(n^2)}
66: n_evalinsertsortbb3in___15->n_evalinsertsortbb4in___12: 2*Arg_1+2 {O(n)}
67: n_evalinsertsortbb3in___19->n_evalinsertsortbb1in___18: Arg_1+1 {O(n)}
68: n_evalinsertsortbb3in___19->n_evalinsertsortbb4in___17: Arg_1+1 {O(n)}
69: n_evalinsertsortbb4in___12->n_evalinsertsortbb5in___11: Arg_1+1 {O(n)}
70: n_evalinsertsortbb4in___14->n_evalinsertsortbb5in___11: Arg_1+1 {O(n)}
71: n_evalinsertsortbb4in___17->n_evalinsertsortbb5in___5: Arg_1+2 {O(n)}
73: n_evalinsertsortbb5in___11->n_evalinsertsortbbin___10: Arg_1 {O(n)}
74: n_evalinsertsortbb5in___11->n_evalinsertsortreturnin___9: 1 {O(1)}
75: n_evalinsertsortbb5in___23->n_evalinsertsortbbin___22: 1 {O(1)}
76: n_evalinsertsortbb5in___23->n_evalinsertsortreturnin___21: 1 {O(1)}
77: n_evalinsertsortbb5in___5->n_evalinsertsortbbin___4: Arg_1+1 {O(n)}
78: n_evalinsertsortbb5in___5->n_evalinsertsortreturnin___3: 1 {O(1)}
79: n_evalinsertsortbbin___10->n_evalinsertsortbb2in___8: Arg_1+2 {O(n)}
80: n_evalinsertsortbbin___22->n_evalinsertsortbb2in___20: 1 {O(1)}
81: n_evalinsertsortbbin___4->n_evalinsertsortbb2in___20: 2*Arg_1+2 {O(n)}
82: n_evalinsertsortentryin___24->n_evalinsertsortbb5in___23: 1 {O(1)}
83: n_evalinsertsortreturnin___21->n_evalinsertsortstop___1: 1 {O(1)}
84: n_evalinsertsortreturnin___3->n_evalinsertsortstop___2: 1 {O(1)}
85: n_evalinsertsortreturnin___9->n_evalinsertsortstop___6: 1 {O(1)}
86: n_evalinsertsortstart->n_evalinsertsortentryin___24: 1 {O(1)}
Sizebounds
58: n_evalinsertsortbb1in___13->n_evalinsertsortbb2in___16, Arg_0: 3*Arg_1+5 {O(n)}
58: n_evalinsertsortbb1in___13->n_evalinsertsortbb2in___16, Arg_1: Arg_1 {O(n)}
58: n_evalinsertsortbb1in___13->n_evalinsertsortbb2in___16, Arg_3: 6*Arg_1+12 {O(n)}
59: n_evalinsertsortbb1in___18->n_evalinsertsortbb2in___16, Arg_0: 3*Arg_1+5 {O(n)}
59: n_evalinsertsortbb1in___18->n_evalinsertsortbb2in___16, Arg_1: Arg_1 {O(n)}
59: n_evalinsertsortbb1in___18->n_evalinsertsortbb2in___16, Arg_3: 6*Arg_1+11 {O(n)}
60: n_evalinsertsortbb2in___16->n_evalinsertsortbb3in___15, Arg_0: 3*Arg_1+5 {O(n)}
60: n_evalinsertsortbb2in___16->n_evalinsertsortbb3in___15, Arg_1: Arg_1 {O(n)}
60: n_evalinsertsortbb2in___16->n_evalinsertsortbb3in___15, Arg_3: 6*Arg_1+12 {O(n)}
61: n_evalinsertsortbb2in___16->n_evalinsertsortbb4in___14, Arg_0: 3*Arg_1+5 {O(n)}
61: n_evalinsertsortbb2in___16->n_evalinsertsortbb4in___14, Arg_1: Arg_1 {O(n)}
61: n_evalinsertsortbb2in___16->n_evalinsertsortbb4in___14, Arg_3: 1 {O(1)}
62: n_evalinsertsortbb2in___20->n_evalinsertsortbb3in___19, Arg_0: 3*Arg_1+5 {O(n)}
62: n_evalinsertsortbb2in___20->n_evalinsertsortbb3in___19, Arg_1: Arg_1 {O(n)}
62: n_evalinsertsortbb2in___20->n_evalinsertsortbb3in___19, Arg_3: 3*Arg_1+5 {O(n)}
63: n_evalinsertsortbb2in___8->n_evalinsertsortbb3in___19, Arg_0: 3*Arg_1+5 {O(n)}
63: n_evalinsertsortbb2in___8->n_evalinsertsortbb3in___19, Arg_1: Arg_1 {O(n)}
63: n_evalinsertsortbb2in___8->n_evalinsertsortbb3in___19, Arg_3: 3*Arg_1+5 {O(n)}
65: n_evalinsertsortbb3in___15->n_evalinsertsortbb1in___13, Arg_0: 3*Arg_1+5 {O(n)}
65: n_evalinsertsortbb3in___15->n_evalinsertsortbb1in___13, Arg_1: Arg_1 {O(n)}
65: n_evalinsertsortbb3in___15->n_evalinsertsortbb1in___13, Arg_3: 6*Arg_1+12 {O(n)}
66: n_evalinsertsortbb3in___15->n_evalinsertsortbb4in___12, Arg_0: 3*Arg_1+5 {O(n)}
66: n_evalinsertsortbb3in___15->n_evalinsertsortbb4in___12, Arg_1: Arg_1 {O(n)}
66: n_evalinsertsortbb3in___15->n_evalinsertsortbb4in___12, Arg_3: 6*Arg_1+12 {O(n)}
67: n_evalinsertsortbb3in___19->n_evalinsertsortbb1in___18, Arg_0: 3*Arg_1+5 {O(n)}
67: n_evalinsertsortbb3in___19->n_evalinsertsortbb1in___18, Arg_1: Arg_1 {O(n)}
67: n_evalinsertsortbb3in___19->n_evalinsertsortbb1in___18, Arg_3: 6*Arg_1+10 {O(n)}
68: n_evalinsertsortbb3in___19->n_evalinsertsortbb4in___17, Arg_0: 3*Arg_1+5 {O(n)}
68: n_evalinsertsortbb3in___19->n_evalinsertsortbb4in___17, Arg_1: Arg_1 {O(n)}
68: n_evalinsertsortbb3in___19->n_evalinsertsortbb4in___17, Arg_3: 6*Arg_1+10 {O(n)}
69: n_evalinsertsortbb4in___12->n_evalinsertsortbb5in___11, Arg_0: 3*Arg_1+5 {O(n)}
69: n_evalinsertsortbb4in___12->n_evalinsertsortbb5in___11, Arg_1: Arg_1 {O(n)}
69: n_evalinsertsortbb4in___12->n_evalinsertsortbb5in___11, Arg_3: 6*Arg_1+12 {O(n)}
70: n_evalinsertsortbb4in___14->n_evalinsertsortbb5in___11, Arg_0: 3*Arg_1+5 {O(n)}
70: n_evalinsertsortbb4in___14->n_evalinsertsortbb5in___11, Arg_1: Arg_1 {O(n)}
70: n_evalinsertsortbb4in___14->n_evalinsertsortbb5in___11, Arg_3: 1 {O(1)}
71: n_evalinsertsortbb4in___17->n_evalinsertsortbb5in___5, Arg_0: 3*Arg_1+5 {O(n)}
71: n_evalinsertsortbb4in___17->n_evalinsertsortbb5in___5, Arg_1: Arg_1 {O(n)}
71: n_evalinsertsortbb4in___17->n_evalinsertsortbb5in___5, Arg_3: 6*Arg_1+10 {O(n)}
73: n_evalinsertsortbb5in___11->n_evalinsertsortbbin___10, Arg_0: 3*Arg_1+5 {O(n)}
73: n_evalinsertsortbb5in___11->n_evalinsertsortbbin___10, Arg_1: Arg_1 {O(n)}
73: n_evalinsertsortbb5in___11->n_evalinsertsortbbin___10, Arg_3: 6*Arg_1+13 {O(n)}
74: n_evalinsertsortbb5in___11->n_evalinsertsortreturnin___9, Arg_0: 6*Arg_1+10 {O(n)}
74: n_evalinsertsortbb5in___11->n_evalinsertsortreturnin___9, Arg_1: 2*Arg_1 {O(n)}
74: n_evalinsertsortbb5in___11->n_evalinsertsortreturnin___9, Arg_3: 6*Arg_1+13 {O(n)}
75: n_evalinsertsortbb5in___23->n_evalinsertsortbbin___22, Arg_0: 1 {O(1)}
75: n_evalinsertsortbb5in___23->n_evalinsertsortbbin___22, Arg_1: Arg_1 {O(n)}
75: n_evalinsertsortbb5in___23->n_evalinsertsortbbin___22, Arg_3: Arg_3 {O(n)}
76: n_evalinsertsortbb5in___23->n_evalinsertsortreturnin___21, Arg_0: 1 {O(1)}
76: n_evalinsertsortbb5in___23->n_evalinsertsortreturnin___21, Arg_1: Arg_1 {O(n)}
76: n_evalinsertsortbb5in___23->n_evalinsertsortreturnin___21, Arg_3: Arg_3 {O(n)}
77: n_evalinsertsortbb5in___5->n_evalinsertsortbbin___4, Arg_0: 3*Arg_1+5 {O(n)}
77: n_evalinsertsortbb5in___5->n_evalinsertsortbbin___4, Arg_1: Arg_1 {O(n)}
77: n_evalinsertsortbb5in___5->n_evalinsertsortbbin___4, Arg_3: 6*Arg_1+10 {O(n)}
78: n_evalinsertsortbb5in___5->n_evalinsertsortreturnin___3, Arg_0: 3*Arg_1+5 {O(n)}
78: n_evalinsertsortbb5in___5->n_evalinsertsortreturnin___3, Arg_1: Arg_1 {O(n)}
78: n_evalinsertsortbb5in___5->n_evalinsertsortreturnin___3, Arg_3: 6*Arg_1+10 {O(n)}
79: n_evalinsertsortbbin___10->n_evalinsertsortbb2in___8, Arg_0: 3*Arg_1+5 {O(n)}
79: n_evalinsertsortbbin___10->n_evalinsertsortbb2in___8, Arg_1: Arg_1 {O(n)}
79: n_evalinsertsortbbin___10->n_evalinsertsortbb2in___8, Arg_3: 3*Arg_1+5 {O(n)}
80: n_evalinsertsortbbin___22->n_evalinsertsortbb2in___20, Arg_0: 1 {O(1)}
80: n_evalinsertsortbbin___22->n_evalinsertsortbb2in___20, Arg_1: Arg_1 {O(n)}
80: n_evalinsertsortbbin___22->n_evalinsertsortbb2in___20, Arg_3: 0 {O(1)}
81: n_evalinsertsortbbin___4->n_evalinsertsortbb2in___20, Arg_0: 3*Arg_1+5 {O(n)}
81: n_evalinsertsortbbin___4->n_evalinsertsortbb2in___20, Arg_1: Arg_1 {O(n)}
81: n_evalinsertsortbbin___4->n_evalinsertsortbb2in___20, Arg_3: 3*Arg_1+5 {O(n)}
82: n_evalinsertsortentryin___24->n_evalinsertsortbb5in___23, Arg_0: 1 {O(1)}
82: n_evalinsertsortentryin___24->n_evalinsertsortbb5in___23, Arg_1: Arg_1 {O(n)}
82: n_evalinsertsortentryin___24->n_evalinsertsortbb5in___23, Arg_3: Arg_3 {O(n)}
83: n_evalinsertsortreturnin___21->n_evalinsertsortstop___1, Arg_0: 1 {O(1)}
83: n_evalinsertsortreturnin___21->n_evalinsertsortstop___1, Arg_1: Arg_1 {O(n)}
83: n_evalinsertsortreturnin___21->n_evalinsertsortstop___1, Arg_3: Arg_3 {O(n)}
84: n_evalinsertsortreturnin___3->n_evalinsertsortstop___2, Arg_0: 3*Arg_1+5 {O(n)}
84: n_evalinsertsortreturnin___3->n_evalinsertsortstop___2, Arg_1: Arg_1 {O(n)}
84: n_evalinsertsortreturnin___3->n_evalinsertsortstop___2, Arg_3: 6*Arg_1+10 {O(n)}
85: n_evalinsertsortreturnin___9->n_evalinsertsortstop___6, Arg_0: 6*Arg_1+10 {O(n)}
85: n_evalinsertsortreturnin___9->n_evalinsertsortstop___6, Arg_1: 2*Arg_1 {O(n)}
85: n_evalinsertsortreturnin___9->n_evalinsertsortstop___6, Arg_3: 6*Arg_1+13 {O(n)}
86: n_evalinsertsortstart->n_evalinsertsortentryin___24, Arg_0: Arg_0 {O(n)}
86: n_evalinsertsortstart->n_evalinsertsortentryin___24, Arg_1: Arg_1 {O(n)}
86: n_evalinsertsortstart->n_evalinsertsortentryin___24, Arg_3: Arg_3 {O(n)}