Initial Problem

Start: evalrealheapsortstart
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E, F, G
Locations: evalrealheapsortbb10in, evalrealheapsortbb11in, evalrealheapsortbb12in, evalrealheapsortbb13in, evalrealheapsortbb14in, evalrealheapsortbb16in, evalrealheapsortbb17in, evalrealheapsortbb18in, evalrealheapsortbb2in, evalrealheapsortbb3in, evalrealheapsortbb4in, evalrealheapsortbb5in, evalrealheapsortbb6in, evalrealheapsortbb7in, evalrealheapsortbb8in, evalrealheapsortbb9in, evalrealheapsortentryin, evalrealheapsortreturnin, evalrealheapsortstart, evalrealheapsortstop
Transitions:
50:evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb11in(Arg_0,Arg_1,Arg_2,Arg_3)
51:evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb12in(Arg_0,Arg_1,Arg_2,Arg_3)
52:evalrealheapsortbb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,2*Arg_2+1)
53:evalrealheapsortbb12in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,2*Arg_2+2)
54:evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb14in(Arg_0,Arg_1,Arg_2,Arg_3)
55:evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb16in(Arg_0,Arg_1,Arg_0,Arg_3)
56:evalrealheapsortbb14in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb16in(Arg_0,Arg_1,Arg_3,Arg_3)
46:evalrealheapsortbb16in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb17in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2*Arg_2+2+Arg_1
45:evalrealheapsortbb16in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1+3+2*Arg_2<=Arg_0
57:evalrealheapsortbb17in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb18in(Arg_0,Arg_1+1,Arg_2,Arg_3)
42:evalrealheapsortbb18in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb8in(Arg_0,Arg_1,Arg_2,Arg_3):|:2+Arg_1<=Arg_0
43:evalrealheapsortbb18in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortreturnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=Arg_1+1
13:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,-1,Arg_3):|:Arg_2+1<=0 && 0<=1+Arg_2
14:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && Arg_2+1<=0 && 0<=1+Arg_2
15:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && E<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
16:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,-1,Arg_3):|:1<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && Arg_2+1<=0 && 0<=1+Arg_2
17:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && 0<=F && 2*F<=0 && 0<=1+2*F && 0<=E && 2*E<=0 && 0<=1+2*E && Arg_2+1<=0 && 0<=1+Arg_2
18:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && 0<=F && 2*F<=0 && 0<=1+2*F && E<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
19:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,-1,Arg_3):|:1<=0 && E<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
20:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && F<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*F && 2*F<=2+Arg_2
21:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && F<=0 && E<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*F && 2*F<=2+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
22:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,-1,Arg_3):|:1<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && Arg_2+1<=0 && 0<=1+Arg_2
23:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && 0<=F && 2*F<=0 && 0<=1+2*F && 0<=E && 2*E<=0 && 0<=1+2*E && Arg_2+1<=0 && 0<=1+Arg_2
24:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && 0<=F && 2*F<=0 && 0<=1+2*F && E<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
25:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,-1,Arg_3):|:1<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && 0<=F && 2*F<=0 && 0<=1+2*F && Arg_2+1<=0 && 0<=1+Arg_2
26:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:0<=Arg_2 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && 0<=G && 2*G<=Arg_2+1 && Arg_2<=2*G && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E
27:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:0<=Arg_2 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && 0<=G && 2*G<=Arg_2+1 && Arg_2<=2*G && Arg_2+2<=0 && E<=0 && Arg_2+1<=2*E && 2*E<=2+Arg_2
28:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,-1,Arg_3):|:1<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && F<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*F && 2*F<=2+Arg_2
29:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:0<=Arg_2 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && Arg_2+2<=0 && G<=0 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E && Arg_2+1<=2*G && 2*G<=2+Arg_2
30:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:0<=Arg_2 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && Arg_2+2<=0 && G<=0 && E<=0 && Arg_2+1<=2*G && 2*G<=2+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
31:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,-1,Arg_3):|:1<=0 && E<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
32:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && F<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*F && 2*F<=2+Arg_2
33:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:1<=0 && F<=0 && E<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*F && 2*F<=2+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
34:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,-1,Arg_3):|:1<=0 && E<=0 && 0<=F && 2*F<=0 && 0<=1+2*F && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
35:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:Arg_2+2<=0 && F<=0 && 0<=Arg_2 && 0<=G && 2*G<=Arg_2+1 && Arg_2<=2*G && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E && Arg_2+1<=2*F && 2*F<=2+Arg_2
36:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:Arg_2+2<=0 && F<=0 && 0<=Arg_2 && 0<=G && 2*G<=Arg_2+1 && Arg_2<=2*G && E<=0 && Arg_2+1<=2*F && 2*F<=2+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
37:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,-1,Arg_3):|:1<=0 && E<=0 && F<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2 && Arg_2+1<=2*F && 2*F<=2+Arg_2
38:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:Arg_2+2<=0 && F<=0 && G<=0 && 0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E && Arg_2+1<=2*F && 2*F<=2+Arg_2 && Arg_2+1<=2*G && 2*G<=2+Arg_2
39:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:Arg_2+2<=0 && F<=0 && G<=0 && E<=0 && Arg_2+1<=2*F && 2*F<=2+Arg_2 && Arg_2+1<=2*G && 2*G<=2+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
6:evalrealheapsortbb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_2
5:evalrealheapsortbb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=0
7:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2+1<=0 && 0<=1+Arg_2
8:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E
9:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2+2<=0 && E<=0 && Arg_2+1<=2*E && 2*E<=2+Arg_2
10:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2+1<=0 && 0<=1+Arg_2
11:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E
12:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2+2<=0 && E<=0 && Arg_2+1<=2*E && 2*E<=2+Arg_2
40:evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb6in(Arg_0,Arg_1+1,Arg_2,Arg_3)
3:evalrealheapsortbb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,Arg_1,Arg_3):|:1+Arg_1<=Arg_0
4:evalrealheapsortbb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb7in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=Arg_1
41:evalrealheapsortbb7in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb18in(Arg_0,0,Arg_2,Arg_3)
44:evalrealheapsortbb8in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb16in(Arg_0,Arg_1,0,Arg_3)
48:evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1+4+2*Arg_2<=Arg_0
49:evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2*Arg_2+2+Arg_1
47:evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb11in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2*Arg_2+3+Arg_1 && 2*Arg_2+3+Arg_1<=Arg_0
1:evalrealheapsortentryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb6in(Arg_0,1,Arg_2,Arg_3):|:3<=Arg_0
2:evalrealheapsortentryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortreturnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2
58:evalrealheapsortreturnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstop(Arg_0,Arg_1,Arg_2,Arg_3)
0:evalrealheapsortstart(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortentryin(Arg_0,Arg_1,Arg_2,Arg_3)

Preprocessing

Cut unsatisfiable transition 14: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 15: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 16: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 17: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 18: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 19: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 20: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 21: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 22: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 23: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 24: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 25: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 27: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 28: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 29: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 30: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 31: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 32: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 33: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 34: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 35: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 36: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 37: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 38: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 7: evalrealheapsortbb4in->evalrealheapsortbb2in

Cut unsatisfiable transition 9: evalrealheapsortbb4in->evalrealheapsortbb2in

Cut unsatisfiable transition 10: evalrealheapsortbb4in->evalrealheapsortbb5in

Cut unsatisfiable transition 12: evalrealheapsortbb4in->evalrealheapsortbb5in

Cut unsatisfiable transition 49: evalrealheapsortbb9in->evalrealheapsortbb10in

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb3in

Found invariant 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb9in

Found invariant 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location evalrealheapsortbb10in

Found invariant 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb8in

Found invariant 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb11in

Found invariant Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb6in

Found invariant 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb14in

Found invariant 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location evalrealheapsortbb12in

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb4in

Found invariant 1+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb18in

Found invariant 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb16in

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb5in

Found invariant 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb13in

Found invariant 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb17in

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb2in

Found invariant Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0 for location evalrealheapsortbb7in

Cut unsatisfiable transition 13: evalrealheapsortbb2in->evalrealheapsortbb3in

Cut unsatisfiable transition 39: evalrealheapsortbb2in->evalrealheapsortbb3in

Problem after Preprocessing

Start: evalrealheapsortstart
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars: E, F, G
Locations: evalrealheapsortbb10in, evalrealheapsortbb11in, evalrealheapsortbb12in, evalrealheapsortbb13in, evalrealheapsortbb14in, evalrealheapsortbb16in, evalrealheapsortbb17in, evalrealheapsortbb18in, evalrealheapsortbb2in, evalrealheapsortbb3in, evalrealheapsortbb4in, evalrealheapsortbb5in, evalrealheapsortbb6in, evalrealheapsortbb7in, evalrealheapsortbb8in, evalrealheapsortbb9in, evalrealheapsortentryin, evalrealheapsortreturnin, evalrealheapsortstart, evalrealheapsortstop
Transitions:
50:evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb11in(Arg_0,Arg_1,Arg_2,Arg_3):|:4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0
51:evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb12in(Arg_0,Arg_1,Arg_2,Arg_3):|:4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0
52:evalrealheapsortbb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0
53:evalrealheapsortbb12in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,2*Arg_2+2):|:4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0
54:evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb14in(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0
55:evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb16in(Arg_0,Arg_1,Arg_0,Arg_3):|:1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0
56:evalrealheapsortbb14in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb16in(Arg_0,Arg_1,Arg_3,Arg_3):|:1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0
46:evalrealheapsortbb16in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb17in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=2*Arg_2+2+Arg_1
45:evalrealheapsortbb16in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_1+3+2*Arg_2<=Arg_0
57:evalrealheapsortbb17in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb18in(Arg_0,Arg_1+1,Arg_2,Arg_3):|:0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0
42:evalrealheapsortbb18in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb8in(Arg_0,Arg_1,Arg_2,Arg_3):|:1+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 2+Arg_1<=Arg_0
43:evalrealheapsortbb18in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortreturnin(Arg_0,Arg_1,Arg_2,Arg_3):|:1+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=Arg_1+1
26:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_2 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && 0<=G && 2*G<=Arg_2+1 && Arg_2<=2*G && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E
6:evalrealheapsortbb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2
5:evalrealheapsortbb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_2<=0
8:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E
11:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E
40:evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb6in(Arg_0,Arg_1+1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0
3:evalrealheapsortbb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,Arg_1,Arg_3):|:Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0
4:evalrealheapsortbb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb7in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=Arg_1
41:evalrealheapsortbb7in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb18in(Arg_0,0,Arg_2,Arg_3):|:Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0
44:evalrealheapsortbb8in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb16in(Arg_0,Arg_1,0,Arg_3):|:2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0
48:evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_1+4+2*Arg_2<=Arg_0
47:evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb11in(Arg_0,Arg_1,Arg_2,Arg_3):|:3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=2*Arg_2+3+Arg_1 && 2*Arg_2+3+Arg_1<=Arg_0
1:evalrealheapsortentryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb6in(Arg_0,1,Arg_2,Arg_3):|:3<=Arg_0
2:evalrealheapsortentryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortreturnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2
58:evalrealheapsortreturnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstop(Arg_0,Arg_1,Arg_2,Arg_3)
0:evalrealheapsortstart(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortentryin(Arg_0,Arg_1,Arg_2,Arg_3)

MPRF for transition 5:evalrealheapsortbb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_2<=0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalrealheapsortbb2in [Arg_0-Arg_1 ]
evalrealheapsortbb4in [Arg_0-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1-1 ]
evalrealheapsortbb6in [Arg_0-Arg_1 ]
evalrealheapsortbb3in [Arg_0-Arg_1 ]

MPRF for transition 11:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

evalrealheapsortbb2in [Arg_0+1-Arg_1 ]
evalrealheapsortbb4in [Arg_0+1-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1 ]
evalrealheapsortbb6in [Arg_0+1-Arg_1 ]
evalrealheapsortbb3in [Arg_0+1-Arg_1 ]

MPRF for transition 40:evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb6in(Arg_0,Arg_1+1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalrealheapsortbb2in [Arg_0-Arg_1 ]
evalrealheapsortbb4in [Arg_0-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1 ]
evalrealheapsortbb6in [Arg_0-Arg_1 ]
evalrealheapsortbb3in [Arg_0-Arg_1 ]

MPRF for transition 3:evalrealheapsortbb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,Arg_1,Arg_3):|:Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

evalrealheapsortbb2in [Arg_0-Arg_1 ]
evalrealheapsortbb4in [Arg_0-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1 ]
evalrealheapsortbb6in [Arg_0+1-Arg_1 ]
evalrealheapsortbb3in [Arg_0-Arg_1 ]

MPRF for transition 26:evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb3in(Arg_0,Arg_1,E-1,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_2 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && 0<=G && 2*G<=Arg_2+1 && Arg_2<=2*G && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E of depth 1:

new bound:

2*Arg_0*Arg_0+10*Arg_0+12 {O(n^2)}

MPRF:

evalrealheapsortbb3in [2*Arg_2 ]
evalrealheapsortbb2in [Arg_2+1 ]
evalrealheapsortbb4in [2*Arg_2 ]
evalrealheapsortbb5in [0 ]
evalrealheapsortbb6in [0 ]

MPRF for transition 6:evalrealheapsortbb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 of depth 1:

new bound:

2*Arg_0*Arg_0+11*Arg_0+14 {O(n^2)}

MPRF:

evalrealheapsortbb3in [2*Arg_2+1 ]
evalrealheapsortbb2in [Arg_2 ]
evalrealheapsortbb4in [Arg_2 ]
evalrealheapsortbb5in [0 ]
evalrealheapsortbb6in [0 ]

MPRF for transition 8:evalrealheapsortbb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E of depth 1:

new bound:

3*Arg_0*Arg_0+12*Arg_0+12 {O(n^2)}

MPRF:

evalrealheapsortbb3in [Arg_0+2*Arg_2 ]
evalrealheapsortbb2in [Arg_0+Arg_2-1 ]
evalrealheapsortbb4in [Arg_0+Arg_2 ]
evalrealheapsortbb5in [Arg_0 ]
evalrealheapsortbb6in [Arg_0 ]

Analysing control-flow refined program

Cut unsatisfiable transition 4: evalrealheapsortbb6in->evalrealheapsortbb7in

Cut unsatisfiable transition 357: n_evalrealheapsortbb3in___8->evalrealheapsortbb5in

Found invariant 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb9in

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb3in___8

Found invariant 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location evalrealheapsortbb10in

Found invariant 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb8in

Found invariant 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb11in

Found invariant Arg_1<=1 && 2+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb6in

Found invariant 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb14in

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb2in___6

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb5in___5

Found invariant 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location evalrealheapsortbb12in

Found invariant 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb3in___4

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb4in___7

Found invariant 2+Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 1<=Arg_2 && 4<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 3<=Arg_1 && 7<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortbb2in___2

Found invariant Arg_2<=0 && 2+Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 2<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb6in___9

Found invariant 1+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb18in

Found invariant 1+Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && 1<=Arg_2 && 4<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 3<=Arg_1 && 7<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortbb4in___3

Found invariant 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb16in

Found invariant Arg_2<=0 && 1+Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb5in

Found invariant 1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 3<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb6in___1

Found invariant 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb13in

Found invariant 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb17in

Found invariant 1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 3<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0 for location evalrealheapsortbb7in

MPRF for transition 337:evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb6in___9(Arg_0,Arg_1+1,Arg_2,Arg_3):|:Arg_2<=0 && 1+Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_2<=Arg_1 && 0<=Arg_2 && 1<=Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && Arg_2<=Arg_1 && 1+Arg_1<=Arg_0 && 3<=Arg_0 && 0<=Arg_2 && 1<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 1<=Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_2<=Arg_1 && 0<=Arg_2 of depth 1:

new bound:

Arg_0+3 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0+2-Arg_1 ]
evalrealheapsortbb5in [Arg_0+2-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_0+2-Arg_1 ]
n_evalrealheapsortbb4in___3 [Arg_0+2-Arg_1 ]
n_evalrealheapsortbb2in___6 [Arg_0+2-Arg_1 ]
n_evalrealheapsortbb4in___7 [Arg_0+2-Arg_1 ]
n_evalrealheapsortbb5in___5 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb6in___1 [Arg_0+2-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0+2-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0+2-Arg_1 ]

MPRF for transition 330:n_evalrealheapsortbb2in___6(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb3in___4(Arg_0,Arg_1,Arg2_P,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 3<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1<=Arg_2 && Arg_2<=2+2*Arg2_P && 1+2*Arg2_P<=Arg_2 && Arg_2<=Arg_1 && 1+Arg_1<=Arg_0 && 3<=Arg_0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0-Arg_1-1 ]
evalrealheapsortbb5in [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb2in___2 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb4in___3 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb2in___6 [Arg_0-Arg_2 ]
n_evalrealheapsortbb4in___7 [Arg_0-Arg_2 ]
n_evalrealheapsortbb5in___5 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb6in___1 [Arg_0-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0-Arg_2 ]

MPRF for transition 356:n_evalrealheapsortbb3in___4(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_2<=0 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0+1-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb4in___3 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb2in___6 [Arg_0+1-Arg_2 ]
n_evalrealheapsortbb4in___7 [Arg_0+1-Arg_2 ]
n_evalrealheapsortbb5in___5 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb6in___1 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0+1-Arg_2 ]

MPRF for transition 332:n_evalrealheapsortbb3in___8(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb4in___7(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 3<=Arg_0 && Arg_2<=Arg_1 && 1+Arg_1<=Arg_0 && Arg_2<=Arg_1 && 1+Arg_1<=Arg_0 && 1<=Arg_2 && 3<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1<=Arg_2 && 3<=Arg_0 && 1+Arg_2<=Arg_0 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && Arg_2<=Arg_1 && 1<=Arg_2 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_0-Arg_1 ]
n_evalrealheapsortbb4in___3 [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___6 [Arg_0-Arg_1 ]
n_evalrealheapsortbb4in___7 [Arg_0-Arg_2 ]
n_evalrealheapsortbb5in___5 [Arg_0-Arg_1 ]
n_evalrealheapsortbb6in___1 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0+1-Arg_1 ]

MPRF for transition 334:n_evalrealheapsortbb4in___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb5in___5(Arg_0,Arg_1,Arg2_P,Arg_3):|:1+Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && 1<=Arg_2 && 4<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 3<=Arg_1 && 7<=Arg_0+Arg_1 && 4<=Arg_0 && 1+Arg_1<=Arg_0 && 1+2*Arg_2<=Arg_1 && 1<=Arg_2 && 1<=Arg2_P && 3<=Arg_0 && Arg2_P<=Arg_1 && 1+Arg_1<=Arg_0 && Arg_2<=Arg2_P && Arg2_P<=Arg_2 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_0-Arg_1 ]
n_evalrealheapsortbb4in___3 [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___6 [Arg_0-Arg_1 ]
n_evalrealheapsortbb4in___7 [Arg_0-Arg_1 ]
n_evalrealheapsortbb5in___5 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb6in___1 [Arg_0-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0-Arg_1 ]

MPRF for transition 335:n_evalrealheapsortbb4in___7(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb2in___6(Arg_0,Arg_1,Arg2_P,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 3<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1<=Arg2_P && 3<=Arg_0 && Arg2_P<=Arg_1 && 1+Arg_1<=Arg_0 && Arg_2<=Arg2_P && Arg2_P<=Arg_2 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0-Arg_1-1 ]
evalrealheapsortbb5in [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb2in___2 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb4in___3 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb2in___6 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb4in___7 [Arg_0-Arg_2 ]
n_evalrealheapsortbb5in___5 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb6in___1 [Arg_0-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0-Arg_2 ]

MPRF for transition 336:n_evalrealheapsortbb4in___7(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb5in___5(Arg_0,Arg_1,Arg2_P,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && Arg_1<=Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 3<=Arg_0 && Arg_1<=Arg_2 && Arg_2<=Arg_1 && 1<=Arg2_P && 3<=Arg_0 && Arg2_P<=Arg_1 && 1+Arg_1<=Arg_0 && Arg_2<=Arg2_P && Arg2_P<=Arg_2 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_0-Arg_1 ]
n_evalrealheapsortbb4in___3 [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___6 [Arg_0-Arg_1 ]
n_evalrealheapsortbb4in___7 [Arg_0-Arg_2 ]
n_evalrealheapsortbb5in___5 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb6in___1 [Arg_0-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0-Arg_2 ]

MPRF for transition 338:n_evalrealheapsortbb5in___5(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb6in___1(Arg_0,Arg_1+1,Arg_2,Arg_3):|:Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_2<=Arg_1 && 0<=Arg_2 && 1<=Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && Arg_2<=Arg_1 && 1+Arg_1<=Arg_0 && 1<=Arg_2 && 3<=Arg_0 && Arg_2<=Arg_1 && 1+Arg_1<=Arg_0 && 3<=Arg_0 && 0<=Arg_2 && 1<=Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && Arg_2<=Arg_1 && 0<=Arg_2 of depth 1:

new bound:

Arg_0+4 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0+1-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb4in___3 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb2in___6 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb4in___7 [Arg_0+Arg_2+1-2*Arg_1 ]
n_evalrealheapsortbb5in___5 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb6in___1 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0+Arg_2+1-2*Arg_1 ]

MPRF for transition 339:n_evalrealheapsortbb6in___1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb3in___8(Arg_0,Arg_1,Arg_1,Arg_3):|:1+Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 3<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && 1<=Arg_2 && 3<=Arg_0 && 1+Arg_2<=Arg_1 && Arg_1<=Arg_0 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0-Arg_1 ]
evalrealheapsortbb5in [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_0-Arg_1 ]
n_evalrealheapsortbb4in___3 [Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___6 [Arg_0-Arg_1 ]
n_evalrealheapsortbb4in___7 [Arg_0-Arg_2 ]
n_evalrealheapsortbb5in___5 [Arg_0-Arg_1 ]
n_evalrealheapsortbb6in___1 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0-Arg_2 ]

MPRF for transition 341:n_evalrealheapsortbb6in___9(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb3in___8(Arg_0,Arg_1,Arg_1,Arg_3):|:Arg_2<=0 && 2+Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 2<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && Arg_1<=Arg_0 && 2<=Arg_1 && 5<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_1<=Arg_0 && 2<=Arg_1 && 3<=Arg_0 && Arg_2<=0 && 0<=Arg_2 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && 1<=Arg_1 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

n_evalrealheapsortbb3in___4 [Arg_0+1-Arg_1 ]
evalrealheapsortbb5in [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb4in___3 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb2in___6 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb4in___7 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb5in___5 [Arg_0-Arg_1 ]
n_evalrealheapsortbb6in___1 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb6in___9 [Arg_0+2-Arg_1 ]
n_evalrealheapsortbb3in___8 [Arg_0+1-Arg_1 ]

MPRF for transition 329:n_evalrealheapsortbb2in___2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb3in___4(Arg_0,Arg_1,Arg2_P,Arg_3):|:2+Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 1<=Arg_2 && 4<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 3<=Arg_1 && 7<=Arg_0+Arg_1 && 4<=Arg_0 && 1+Arg_1<=Arg_0 && 1+2*Arg_2<=Arg_1 && 1<=Arg_2 && 1<=Arg_2 && Arg_2<=2+2*Arg2_P && 1+2*Arg2_P<=Arg_2 && Arg_2<=Arg_1 && 1+Arg_1<=Arg_0 && 3<=Arg_0 of depth 1:

new bound:

8*Arg_0*Arg_0+30*Arg_0+25 {O(n^2)}

MPRF:

n_evalrealheapsortbb6in___9 [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb3in___4 [Arg_0+2*Arg_2-Arg_1-2 ]
evalrealheapsortbb5in [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb3in___8 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_0+Arg_2-Arg_1-1 ]
n_evalrealheapsortbb4in___3 [Arg_0+2*Arg_2-Arg_1-2 ]
n_evalrealheapsortbb2in___6 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb4in___7 [2*Arg_0+Arg_1-2*Arg_2 ]
n_evalrealheapsortbb5in___5 [Arg_0+Arg_2-Arg_1-1 ]
n_evalrealheapsortbb6in___1 [Arg_0-Arg_1 ]

MPRF for transition 331:n_evalrealheapsortbb3in___4(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb4in___3(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 3<=Arg_0 && Arg_2<=Arg_1 && 1+Arg_1<=Arg_0 && 1+Arg_1<=Arg_0 && 3<=Arg_0 && 1+2*Arg_2<=Arg_1 && 0<=1+2*Arg_2 && 1<=Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0 && Arg_2<=Arg_1 && 1<=Arg_2 of depth 1:

new bound:

10*Arg_0*Arg_0+48*Arg_0+50 {O(n^2)}

MPRF:

n_evalrealheapsortbb6in___9 [-1 ]
n_evalrealheapsortbb3in___4 [2*Arg_2-1 ]
evalrealheapsortbb5in [-1 ]
n_evalrealheapsortbb3in___8 [Arg_0+Arg_2-Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_2-2 ]
n_evalrealheapsortbb4in___3 [2*Arg_2-3 ]
n_evalrealheapsortbb2in___6 [Arg_0 ]
n_evalrealheapsortbb4in___7 [Arg_0+Arg_2-Arg_1 ]
n_evalrealheapsortbb5in___5 [-1 ]
n_evalrealheapsortbb6in___1 [-1 ]

MPRF for transition 333:n_evalrealheapsortbb4in___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb2in___2(Arg_0,Arg_1,Arg2_P,Arg_3):|:1+Arg_2<=Arg_1 && 2+Arg_2<=Arg_0 && 1<=Arg_2 && 4<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 3<=Arg_1 && 7<=Arg_0+Arg_1 && 4<=Arg_0 && 1+Arg_1<=Arg_0 && 1+2*Arg_2<=Arg_1 && 1<=Arg_2 && 1<=Arg2_P && 3<=Arg_0 && Arg2_P<=Arg_1 && 1+Arg_1<=Arg_0 && Arg_2<=Arg2_P && Arg2_P<=Arg_2 of depth 1:

new bound:

4*Arg_0*Arg_0+22*Arg_0+25 {O(n^2)}

MPRF:

n_evalrealheapsortbb6in___9 [0 ]
n_evalrealheapsortbb3in___4 [2*Arg_2 ]
evalrealheapsortbb5in [0 ]
n_evalrealheapsortbb3in___8 [Arg_1 ]
n_evalrealheapsortbb2in___2 [Arg_2-1 ]
n_evalrealheapsortbb4in___3 [Arg_2 ]
n_evalrealheapsortbb2in___6 [Arg_2 ]
n_evalrealheapsortbb4in___7 [Arg_1 ]
n_evalrealheapsortbb5in___5 [0 ]
n_evalrealheapsortbb6in___1 [0 ]

CFR did not improve the program. Rolling back

MPRF for transition 46:evalrealheapsortbb16in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb17in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=2*Arg_2+2+Arg_1 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_1 ]
evalrealheapsortbb13in [Arg_0-Arg_1 ]
evalrealheapsortbb14in [Arg_0-Arg_1 ]
evalrealheapsortbb17in [Arg_0-Arg_1-1 ]
evalrealheapsortbb18in [Arg_0-Arg_1 ]
evalrealheapsortbb8in [Arg_0-Arg_1 ]
evalrealheapsortbb16in [Arg_0-Arg_1 ]
evalrealheapsortbb11in [Arg_0-Arg_1 ]
evalrealheapsortbb9in [Arg_0-Arg_1 ]
evalrealheapsortbb10in [Arg_0-Arg_1 ]

MPRF for transition 57:evalrealheapsortbb17in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb18in(Arg_0,Arg_1+1,Arg_2,Arg_3):|:0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_1 ]
evalrealheapsortbb13in [Arg_0-Arg_1 ]
evalrealheapsortbb14in [Arg_0-Arg_1 ]
evalrealheapsortbb17in [Arg_0-Arg_1 ]
evalrealheapsortbb18in [Arg_0-Arg_1 ]
evalrealheapsortbb8in [Arg_0-Arg_1 ]
evalrealheapsortbb16in [Arg_0-Arg_1 ]
evalrealheapsortbb11in [Arg_0-Arg_1 ]
evalrealheapsortbb9in [Arg_0-Arg_1 ]
evalrealheapsortbb10in [Arg_0-Arg_1 ]

MPRF for transition 42:evalrealheapsortbb18in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb8in(Arg_0,Arg_1,Arg_2,Arg_3):|:1+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 2+Arg_1<=Arg_0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_1 ]
evalrealheapsortbb13in [Arg_0-Arg_1 ]
evalrealheapsortbb14in [Arg_0-Arg_1 ]
evalrealheapsortbb17in [Arg_0-Arg_1 ]
evalrealheapsortbb18in [Arg_0+1-Arg_1 ]
evalrealheapsortbb8in [Arg_0-Arg_1 ]
evalrealheapsortbb16in [Arg_0-Arg_1 ]
evalrealheapsortbb11in [Arg_0-Arg_1 ]
evalrealheapsortbb9in [Arg_0-Arg_1 ]
evalrealheapsortbb10in [Arg_0-Arg_1 ]

MPRF for transition 44:evalrealheapsortbb8in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb16in(Arg_0,Arg_1,0,Arg_3):|:2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_1 ]
evalrealheapsortbb13in [Arg_0-Arg_1 ]
evalrealheapsortbb14in [Arg_0-Arg_1 ]
evalrealheapsortbb17in [Arg_0-Arg_1 ]
evalrealheapsortbb18in [Arg_0+1-Arg_1 ]
evalrealheapsortbb8in [Arg_0+1-Arg_1 ]
evalrealheapsortbb16in [Arg_0-Arg_1 ]
evalrealheapsortbb11in [Arg_0-Arg_1 ]
evalrealheapsortbb9in [Arg_0-Arg_1 ]
evalrealheapsortbb10in [Arg_0-Arg_1 ]

MPRF for transition 50:evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb11in(Arg_0,Arg_1,Arg_2,Arg_3):|:4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 of depth 1:

new bound:

Arg_0*Arg_0+6*Arg_0+9 {O(n^2)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_2-3 ]
evalrealheapsortbb13in [Arg_0-Arg_2-4 ]
evalrealheapsortbb14in [Arg_0-Arg_2-4 ]
evalrealheapsortbb16in [Arg_0-Arg_2-3 ]
evalrealheapsortbb17in [Arg_0-Arg_2-3 ]
evalrealheapsortbb18in [Arg_0-Arg_2-3 ]
evalrealheapsortbb8in [-Arg_2 ]
evalrealheapsortbb11in [Arg_0-Arg_2-4 ]
evalrealheapsortbb9in [Arg_0-Arg_2-3 ]
evalrealheapsortbb10in [Arg_0-Arg_2-3 ]

MPRF for transition 51:evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb12in(Arg_0,Arg_1,Arg_2,Arg_3):|:4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 of depth 1:

new bound:

Arg_0*Arg_0+6*Arg_0+9 {O(n^2)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_2-4 ]
evalrealheapsortbb13in [Arg_0-Arg_2-4 ]
evalrealheapsortbb14in [Arg_0-Arg_3-3 ]
evalrealheapsortbb16in [Arg_0-Arg_2-3 ]
evalrealheapsortbb17in [Arg_0-Arg_2-3 ]
evalrealheapsortbb18in [Arg_0-Arg_2-3 ]
evalrealheapsortbb8in [Arg_0-Arg_2-3 ]
evalrealheapsortbb11in [Arg_0-Arg_2-4 ]
evalrealheapsortbb9in [Arg_0-Arg_2-3 ]
evalrealheapsortbb10in [Arg_0-Arg_2-3 ]

MPRF for transition 52:evalrealheapsortbb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 of depth 1:

new bound:

Arg_0*Arg_0+5*Arg_0+7 {O(n^2)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_2-3 ]
evalrealheapsortbb13in [Arg_0-Arg_2-3 ]
evalrealheapsortbb14in [Arg_0-Arg_3-2 ]
evalrealheapsortbb16in [Arg_0-Arg_2-2 ]
evalrealheapsortbb17in [Arg_0-Arg_2-2 ]
evalrealheapsortbb18in [Arg_0-Arg_2-2 ]
evalrealheapsortbb8in [Arg_0-Arg_2-2 ]
evalrealheapsortbb11in [Arg_0-Arg_2-2 ]
evalrealheapsortbb9in [Arg_0-Arg_2-2 ]
evalrealheapsortbb10in [Arg_0-Arg_2-2 ]

MPRF for transition 53:evalrealheapsortbb12in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,2*Arg_2+2):|:4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 of depth 1:

new bound:

Arg_0*Arg_0+6*Arg_0+9 {O(n^2)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_2-3 ]
evalrealheapsortbb13in [Arg_0-Arg_2-4 ]
evalrealheapsortbb14in [Arg_0-Arg_2-4 ]
evalrealheapsortbb16in [Arg_0-Arg_2-3 ]
evalrealheapsortbb17in [Arg_0-Arg_2-3 ]
evalrealheapsortbb18in [Arg_0-Arg_2-3 ]
evalrealheapsortbb8in [Arg_0-Arg_2-3 ]
evalrealheapsortbb11in [Arg_0-Arg_2-4 ]
evalrealheapsortbb9in [Arg_0-Arg_2-3 ]
evalrealheapsortbb10in [Arg_0-Arg_2-3 ]

MPRF for transition 54:evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb14in(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 of depth 1:

new bound:

Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_2 ]
evalrealheapsortbb13in [Arg_0-Arg_2 ]
evalrealheapsortbb14in [Arg_0-Arg_2-1 ]
evalrealheapsortbb16in [Arg_0-Arg_2 ]
evalrealheapsortbb17in [Arg_0-Arg_2 ]
evalrealheapsortbb18in [Arg_0-Arg_2 ]
evalrealheapsortbb8in [Arg_0-Arg_2 ]
evalrealheapsortbb11in [Arg_0-Arg_2 ]
evalrealheapsortbb9in [Arg_0-Arg_2 ]
evalrealheapsortbb10in [Arg_0-Arg_2 ]

MPRF for transition 55:evalrealheapsortbb13in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb16in(Arg_0,Arg_1,Arg_0,Arg_3):|:1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 of depth 1:

new bound:

Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_2 ]
evalrealheapsortbb13in [Arg_0-Arg_2 ]
evalrealheapsortbb14in [Arg_0-Arg_2-1 ]
evalrealheapsortbb16in [Arg_0-Arg_2 ]
evalrealheapsortbb17in [Arg_0-Arg_2 ]
evalrealheapsortbb18in [Arg_0-Arg_2 ]
evalrealheapsortbb8in [Arg_0-Arg_2 ]
evalrealheapsortbb11in [Arg_0-Arg_2 ]
evalrealheapsortbb9in [Arg_0-Arg_2 ]
evalrealheapsortbb10in [Arg_0-Arg_2 ]

MPRF for transition 56:evalrealheapsortbb14in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb16in(Arg_0,Arg_1,Arg_3,Arg_3):|:1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 of depth 1:

new bound:

Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_2 ]
evalrealheapsortbb13in [Arg_0-Arg_2 ]
evalrealheapsortbb14in [Arg_0-Arg_2 ]
evalrealheapsortbb16in [Arg_0-Arg_2 ]
evalrealheapsortbb17in [Arg_0-Arg_2 ]
evalrealheapsortbb18in [Arg_0-Arg_2 ]
evalrealheapsortbb8in [Arg_0-Arg_2 ]
evalrealheapsortbb11in [Arg_0-Arg_2 ]
evalrealheapsortbb9in [Arg_0-Arg_2 ]
evalrealheapsortbb10in [Arg_0-Arg_2 ]

MPRF for transition 45:evalrealheapsortbb16in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_1+3+2*Arg_2<=Arg_0 of depth 1:

new bound:

Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_2-1 ]
evalrealheapsortbb13in [Arg_0-Arg_2-1 ]
evalrealheapsortbb14in [Arg_0-Arg_3 ]
evalrealheapsortbb16in [Arg_0-Arg_2 ]
evalrealheapsortbb17in [Arg_0-Arg_2 ]
evalrealheapsortbb18in [Arg_0-Arg_2 ]
evalrealheapsortbb8in [Arg_0-Arg_2 ]
evalrealheapsortbb11in [Arg_0-Arg_2-1 ]
evalrealheapsortbb9in [Arg_0-Arg_2-1 ]
evalrealheapsortbb10in [Arg_0-Arg_2-1 ]

MPRF for transition 47:evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb11in(Arg_0,Arg_1,Arg_2,Arg_3):|:3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=2*Arg_2+3+Arg_1 && 2*Arg_2+3+Arg_1<=Arg_0 of depth 1:

new bound:

2*Arg_0*Arg_0+6*Arg_0+6 {O(n^2)}

MPRF:

evalrealheapsortbb12in [2*Arg_0-2*Arg_2 ]
evalrealheapsortbb13in [2*Arg_0-2*Arg_2-2 ]
evalrealheapsortbb14in [2*Arg_0-2*Arg_3 ]
evalrealheapsortbb16in [2*Arg_0-2*Arg_2 ]
evalrealheapsortbb17in [2*Arg_0-2*Arg_2 ]
evalrealheapsortbb18in [2*Arg_0-2*Arg_2 ]
evalrealheapsortbb8in [2*Arg_0-2*Arg_2 ]
evalrealheapsortbb11in [2*Arg_0-2*Arg_2-2 ]
evalrealheapsortbb9in [2*Arg_0-2*Arg_2 ]
evalrealheapsortbb10in [2*Arg_0-2*Arg_2 ]

MPRF for transition 48:evalrealheapsortbb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_1+4+2*Arg_2<=Arg_0 of depth 1:

new bound:

Arg_0*Arg_0+5*Arg_0+7 {O(n^2)}

MPRF:

evalrealheapsortbb12in [Arg_0-Arg_2-3 ]
evalrealheapsortbb13in [Arg_0-Arg_2-3 ]
evalrealheapsortbb14in [Arg_0-Arg_2-3 ]
evalrealheapsortbb16in [Arg_0-Arg_2-2 ]
evalrealheapsortbb17in [Arg_0-Arg_2-2 ]
evalrealheapsortbb18in [Arg_0-Arg_2-2 ]
evalrealheapsortbb8in [Arg_0-Arg_2-2 ]
evalrealheapsortbb11in [Arg_0-Arg_2-3 ]
evalrealheapsortbb9in [Arg_0-Arg_2-2 ]
evalrealheapsortbb10in [Arg_0-Arg_2-3 ]

Analysing control-flow refined program

Found invariant Arg_3<=Arg_2 && 5+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 7<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 for location n_evalrealheapsortbb10in___14

Found invariant Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortbb13in___19

Found invariant Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortbb14in___3

Found invariant 2+Arg_3<=Arg_0 && 4<=Arg_3 && 5<=Arg_2+Arg_3 && 3+Arg_2<=Arg_3 && 4<=Arg_1+Arg_3 && 10<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 for location n_evalrealheapsortbb14in___7

Found invariant 3+Arg_3<=Arg_0 && 3<=Arg_3 && 4<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 3<=Arg_1+Arg_3 && 9<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 for location n_evalrealheapsortbb14in___9

Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortbb10in___23

Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortbb11in___21

Found invariant Arg_3<=Arg_2 && 5+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 7<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 for location n_evalrealheapsortbb12in___11

Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb9in___24

Found invariant 2+Arg_3<=Arg_2 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 4<=Arg_2+Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=Arg_0 && 3<=Arg_2 && 3<=Arg_1+Arg_2 && 3+Arg_1<=Arg_2 && 6<=Arg_0+Arg_2 && Arg_0<=Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb16in___17

Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb16in

Found invariant Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb13in___2

Found invariant 3<=Arg_3 && 4<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 3<=Arg_1+Arg_3 && 9<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 for location n_evalrealheapsortbb13in___10

Found invariant Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortbb12in___20

Found invariant Arg_1<=Arg_0 && 3<=Arg_1 && 6<=Arg_0+Arg_1 && Arg_0<=Arg_1 && 3<=Arg_0 for location evalrealheapsortbb7in

Found invariant Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb14in___1

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb3in

Found invariant 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 3<=Arg_1+Arg_3 && 8<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 for location n_evalrealheapsortbb14in___5

Found invariant 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb8in

Found invariant Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb6in

Found invariant 4+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 for location n_evalrealheapsortbb11in___13

Found invariant Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortbb14in___18

Found invariant Arg_3<=Arg_2 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 2+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb16in___16

Found invariant 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 for location n_evalrealheapsortbb13in___6

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb4in

Found invariant 4<=Arg_3 && 5<=Arg_2+Arg_3 && 3+Arg_2<=Arg_3 && 4<=Arg_1+Arg_3 && 10<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 for location n_evalrealheapsortbb13in___8

Found invariant Arg_3<=Arg_2 && 4+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && 4+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 6<=Arg_0+Arg_2 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 for location n_evalrealheapsortbb9in___15

Found invariant 1+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb18in

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb5in

Found invariant Arg_3<=Arg_2 && 5+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 7<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 for location n_evalrealheapsortbb11in___12

Found invariant Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 for location n_evalrealheapsortbb13in___4

Found invariant Arg_2<=Arg_0 && 0<=Arg_2 && 1<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb17in

Found invariant 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 for location n_evalrealheapsortbb11in___22

Found invariant Arg_2<=Arg_1 && 1+Arg_2<=Arg_0 && 1<=Arg_2 && 2<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 1+Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortbb2in

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 629:evalrealheapsortbb16in(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb9in___24(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1 && 3<=Arg_0 && 2+Arg_1<=Arg_0 && 3+Arg_1+2*Arg_2<=Arg_0 && 0<=Arg_1 && 0<=Arg_2

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 632:n_evalrealheapsortbb9in___24(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb10in___23(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 4+Arg_1+2*Arg_2<=Arg_0 && 0<=Arg_1 && 0<=Arg_2

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 633:n_evalrealheapsortbb9in___24(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb11in___22(Arg_0,Arg_1,Arg2_P,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 0<=Arg_1 && 3+Arg_1<=Arg_0 && Arg_0<=Arg_1+2*Arg_2+3 && 3+Arg_1+2*Arg_2<=Arg_0 && Arg_0<=Arg_1+2*Arg2_P+3 && 3+Arg_1+2*Arg2_P<=Arg_0

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 602:n_evalrealheapsortbb10in___23(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb11in___21(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 4+Arg_2<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 603:n_evalrealheapsortbb10in___23(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb12in___20(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 4+Arg_2<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 606:n_evalrealheapsortbb11in___21(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb13in___19(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 607:n_evalrealheapsortbb11in___22(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb13in___2(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 && 3<=Arg_0 && Arg_0<=Arg_1+3 && 3+Arg_1<=Arg_0 && Arg_2<=0 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 609:n_evalrealheapsortbb12in___20(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb13in___4(Arg_0,Arg_1,Arg_2,2*Arg_2+2):|:Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_2<=0 && 0<=Arg_2 && 4+Arg_2<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 612:n_evalrealheapsortbb13in___19(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb14in___18(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=1 && 1<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 613:n_evalrealheapsortbb13in___19(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___17(Arg_0,Arg_1,Arg_0,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=1 && 1<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 614:n_evalrealheapsortbb13in___2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb14in___1(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 && 3<=Arg_0 && Arg_0<=Arg_1+3 && 3+Arg_1<=Arg_0 && Arg_2<=0 && 0<=Arg_2 && Arg_3<=1 && 1<=Arg_3 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 615:n_evalrealheapsortbb13in___2(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___17(Arg_0,Arg_1,Arg_0,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 && 3<=Arg_0 && Arg_0<=Arg_1+3 && 3+Arg_1<=Arg_0 && Arg_2<=0 && 0<=Arg_2 && Arg_3<=1 && 1<=Arg_3 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 616:n_evalrealheapsortbb13in___4(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb14in___3(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=2 && 2<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 617:n_evalrealheapsortbb13in___4(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___17(Arg_0,Arg_1,Arg_0,Arg_3):|:Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=2 && 2<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 622:n_evalrealheapsortbb14in___1(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___16(Arg_0,Arg_1,Arg_3,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && Arg_0<=3+Arg_1 && 3<=Arg_0 && 3<=Arg_0 && Arg_0<=Arg_1+3 && 3+Arg_1<=Arg_0 && Arg_2<=0 && 0<=Arg_2 && Arg_3<=1 && 1<=Arg_3 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 623:n_evalrealheapsortbb14in___18(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___16(Arg_0,Arg_1,Arg_3,Arg_3):|:Arg_3<=1 && Arg_3<=1+Arg_2 && Arg_2+Arg_3<=1 && Arg_3<=1+Arg_1 && 3+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 5<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=1 && 1<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3

knowledge_propagation leads to new time bound Arg_0+1 {O(n)} for transition 624:n_evalrealheapsortbb14in___3(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___16(Arg_0,Arg_1,Arg_3,Arg_3):|:Arg_3<=2 && Arg_3<=2+Arg_2 && Arg_2+Arg_3<=2 && Arg_3<=2+Arg_1 && 2+Arg_3<=Arg_0 && 2<=Arg_3 && 2<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 2<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && Arg_2<=0 && Arg_2<=Arg_1 && 4+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 4<=Arg_0+Arg_1 && 4<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && Arg_3<=2 && 2<=Arg_3 && Arg_2<=0 && 0<=Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3

MPRF for transition 600:n_evalrealheapsortbb10in___14(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb11in___12(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_2 && 5+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 7<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 4+Arg_1+2*Arg_3<=Arg_0 && 0<=Arg_1 && 1<=Arg_3 && Arg_2<=Arg_3 && Arg_3<=Arg_2 && 4+Arg_2<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 of depth 1:

new bound:

Arg_0*Arg_0+2*Arg_0+2*Arg_3+4 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [-2*Arg_3-3 ]
evalrealheapsortbb18in [-2*Arg_3-3 ]
evalrealheapsortbb8in [-2*Arg_3-3 ]
evalrealheapsortbb16in [-2*Arg_3-3 ]
n_evalrealheapsortbb10in___23 [Arg_0 ]
n_evalrealheapsortbb11in___12 [Arg_0-Arg_1-2*Arg_3-4 ]
n_evalrealheapsortbb11in___21 [Arg_0 ]
n_evalrealheapsortbb11in___22 [1 ]
n_evalrealheapsortbb12in___11 [Arg_0-Arg_1-2*Arg_3-6 ]
n_evalrealheapsortbb12in___20 [Arg_0 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_1-2*Arg_2-4 ]
n_evalrealheapsortbb13in___19 [Arg_0 ]
n_evalrealheapsortbb13in___2 [1 ]
n_evalrealheapsortbb13in___4 [Arg_0 ]
n_evalrealheapsortbb13in___6 [1-2*Arg_2 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_1-2*Arg_2-6 ]
n_evalrealheapsortbb14in___1 [2*Arg_0-2*Arg_1-5 ]
n_evalrealheapsortbb14in___18 [Arg_0-2*Arg_3 ]
n_evalrealheapsortbb14in___3 [Arg_0-2*Arg_3 ]
n_evalrealheapsortbb14in___5 [1-2*Arg_2 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_1-Arg_3-4 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_1-2*Arg_2-4 ]
n_evalrealheapsortbb16in___16 [Arg_0-Arg_1-2*Arg_2 ]
n_evalrealheapsortbb16in___17 [-2*Arg_3-3 ]
evalrealheapsortbb17in [-2*Arg_3-3 ]
n_evalrealheapsortbb10in___14 [Arg_0-Arg_1-2*Arg_3-3 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_1-2*Arg_2 ]
n_evalrealheapsortbb11in___13 [1-2*Arg_2 ]

MPRF for transition 601:n_evalrealheapsortbb10in___14(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb12in___11(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_2 && 5+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 7<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 4+Arg_1+2*Arg_3<=Arg_0 && 0<=Arg_1 && 1<=Arg_3 && Arg_2<=Arg_3 && Arg_3<=Arg_2 && 4+Arg_2<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 of depth 1:

new bound:

3*Arg_0*Arg_0+4*Arg_0+4 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [-Arg_0-4 ]
evalrealheapsortbb18in [-Arg_0-4 ]
evalrealheapsortbb8in [-Arg_0-4 ]
evalrealheapsortbb16in [-Arg_0-4 ]
n_evalrealheapsortbb10in___23 [Arg_0 ]
n_evalrealheapsortbb11in___12 [Arg_0-Arg_1-Arg_3-4 ]
n_evalrealheapsortbb11in___21 [Arg_0 ]
n_evalrealheapsortbb11in___22 [Arg_0-Arg_1 ]
n_evalrealheapsortbb12in___11 [Arg_0-Arg_1-Arg_2-5 ]
n_evalrealheapsortbb12in___20 [Arg_0 ]
n_evalrealheapsortbb13in___10 [Arg_0+Arg_2-Arg_1-Arg_3-3 ]
n_evalrealheapsortbb13in___19 [Arg_0 ]
n_evalrealheapsortbb13in___2 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___4 [Arg_0 ]
n_evalrealheapsortbb13in___6 [0 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_1-Arg_2-7 ]
n_evalrealheapsortbb14in___1 [Arg_0-Arg_1-Arg_3 ]
n_evalrealheapsortbb14in___18 [Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___3 [Arg_0 ]
n_evalrealheapsortbb14in___5 [0 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_1-Arg_3-4 ]
n_evalrealheapsortbb14in___9 [Arg_0+Arg_2-Arg_1-Arg_3-3 ]
n_evalrealheapsortbb16in___16 [Arg_0-Arg_1-Arg_2-4 ]
n_evalrealheapsortbb16in___17 [Arg_2-Arg_1-Arg_3-4 ]
evalrealheapsortbb17in [-Arg_0-4 ]
n_evalrealheapsortbb10in___14 [Arg_0+Arg_3-Arg_1-2*Arg_2-4 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_1-Arg_2-4 ]
n_evalrealheapsortbb11in___13 [Arg_3-1 ]

MPRF for transition 604:n_evalrealheapsortbb11in___12(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb13in___10(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:Arg_3<=Arg_2 && 5+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 7<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 4+Arg_1+2*Arg_3<=Arg_0 && 0<=Arg_1 && 1<=Arg_3 && Arg_2<=Arg_3 && Arg_3<=Arg_2 && 3+Arg_2<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 of depth 1:

new bound:

2*Arg_0*Arg_0+4*Arg_0+4 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [-2 ]
evalrealheapsortbb18in [-2 ]
evalrealheapsortbb8in [-2 ]
evalrealheapsortbb16in [-2 ]
n_evalrealheapsortbb10in___23 [Arg_0 ]
n_evalrealheapsortbb11in___12 [Arg_0-Arg_2-4 ]
n_evalrealheapsortbb11in___21 [Arg_0 ]
n_evalrealheapsortbb11in___22 [Arg_1-2 ]
n_evalrealheapsortbb12in___11 [Arg_0-2*Arg_2-6 ]
n_evalrealheapsortbb12in___20 [Arg_0 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_3-4 ]
n_evalrealheapsortbb13in___19 [Arg_0 ]
n_evalrealheapsortbb13in___2 [Arg_1-2 ]
n_evalrealheapsortbb13in___4 [Arg_0 ]
n_evalrealheapsortbb13in___6 [Arg_0-Arg_3-2 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_3-4 ]
n_evalrealheapsortbb14in___1 [2*Arg_0-Arg_1-8 ]
n_evalrealheapsortbb14in___18 [Arg_0-2*Arg_3 ]
n_evalrealheapsortbb14in___3 [Arg_0 ]
n_evalrealheapsortbb14in___5 [Arg_0-Arg_3-2 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_3-4 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_3-4 ]
n_evalrealheapsortbb16in___16 [Arg_0-Arg_3-4 ]
n_evalrealheapsortbb16in___17 [4*Arg_2-3*Arg_0-Arg_3-4 ]
evalrealheapsortbb17in [-2 ]
n_evalrealheapsortbb10in___14 [Arg_0+Arg_2-2*Arg_3-4 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_3-4 ]
n_evalrealheapsortbb11in___13 [Arg_0-Arg_3-4 ]

MPRF for transition 605:n_evalrealheapsortbb11in___13(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb13in___6(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:4+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 && 0<=Arg_1 && 5+Arg_1<=Arg_0 && Arg_0<=Arg_1+2*Arg_3+3 && 3+Arg_1+2*Arg_3<=Arg_0 && Arg_0<=Arg_1+2*Arg_2+3 && 3+Arg_1+2*Arg_2<=Arg_0 && 3+Arg_2<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 of depth 1:

new bound:

6*Arg_0*Arg_0+17*Arg_0+11 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [-Arg_1 ]
evalrealheapsortbb18in [-Arg_1 ]
evalrealheapsortbb8in [-Arg_1 ]
evalrealheapsortbb16in [-Arg_1 ]
n_evalrealheapsortbb10in___23 [Arg_0-Arg_1-4 ]
n_evalrealheapsortbb11in___12 [Arg_0-Arg_1-2*Arg_3-4 ]
n_evalrealheapsortbb11in___21 [Arg_0-Arg_1-4 ]
n_evalrealheapsortbb11in___22 [2*Arg_0-2*Arg_1-7 ]
n_evalrealheapsortbb12in___11 [Arg_0-Arg_1-2*Arg_3-5 ]
n_evalrealheapsortbb12in___20 [Arg_0-Arg_1-5 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_1-2*Arg_2-4 ]
n_evalrealheapsortbb13in___19 [Arg_0-Arg_1-4 ]
n_evalrealheapsortbb13in___2 [2*Arg_0-2*Arg_1-7 ]
n_evalrealheapsortbb13in___4 [Arg_0-Arg_1-5 ]
n_evalrealheapsortbb13in___6 [-1 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_1-Arg_3-3 ]
n_evalrealheapsortbb14in___1 [Arg_0+3*Arg_3-Arg_1-7 ]
n_evalrealheapsortbb14in___18 [Arg_0-Arg_1-4 ]
n_evalrealheapsortbb14in___3 [Arg_0+Arg_3-Arg_1-7 ]
n_evalrealheapsortbb14in___5 [Arg_0+12*Arg_2+3-Arg_1-7*Arg_3 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_1-Arg_3-3 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_1-Arg_3-3 ]
n_evalrealheapsortbb16in___16 [Arg_0+Arg_3-Arg_1-2*Arg_2-3 ]
n_evalrealheapsortbb16in___17 [Arg_2-Arg_1-Arg_3-3 ]
evalrealheapsortbb17in [-Arg_1-1 ]
n_evalrealheapsortbb10in___14 [Arg_0-Arg_1-2*Arg_2-4 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_1-Arg_2-3 ]
n_evalrealheapsortbb11in___13 [1 ]

MPRF for transition 608:n_evalrealheapsortbb12in___11(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb13in___8(Arg_0,Arg_1,Arg_2,2*Arg_2+2):|:Arg_3<=Arg_2 && 5+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 7<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 4+Arg_1+2*Arg_3<=Arg_0 && 0<=Arg_1 && 1<=Arg_3 && Arg_2<=Arg_3 && Arg_3<=Arg_2 && 4+Arg_2<=Arg_0 && 4+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 of depth 1:

new bound:

4*Arg_0*Arg_0+7*Arg_0+9 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [6 ]
evalrealheapsortbb18in [6 ]
evalrealheapsortbb8in [6 ]
evalrealheapsortbb16in [6 ]
n_evalrealheapsortbb10in___23 [Arg_0+3 ]
n_evalrealheapsortbb11in___12 [Arg_0+2-Arg_2 ]
n_evalrealheapsortbb11in___21 [Arg_0+3 ]
n_evalrealheapsortbb11in___22 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb12in___11 [Arg_0+2-Arg_2 ]
n_evalrealheapsortbb12in___20 [Arg_0+2 ]
n_evalrealheapsortbb13in___10 [Arg_0+Arg_3+1-3*Arg_2 ]
n_evalrealheapsortbb13in___19 [Arg_0+3 ]
n_evalrealheapsortbb13in___2 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___4 [Arg_0+2 ]
n_evalrealheapsortbb13in___6 [Arg_0+3-2*Arg_2 ]
n_evalrealheapsortbb13in___8 [Arg_0+4-Arg_3 ]
n_evalrealheapsortbb14in___1 [Arg_0+3 ]
n_evalrealheapsortbb14in___18 [Arg_0+4-Arg_3 ]
n_evalrealheapsortbb14in___3 [Arg_0+6-2*Arg_3 ]
n_evalrealheapsortbb14in___5 [2*Arg_0+2-Arg_1-2*Arg_3 ]
n_evalrealheapsortbb14in___7 [Arg_0+4-Arg_3 ]
n_evalrealheapsortbb14in___9 [Arg_0+Arg_3+1-3*Arg_2 ]
n_evalrealheapsortbb16in___16 [Arg_0+4-Arg_2 ]
n_evalrealheapsortbb16in___17 [Arg_2+4-Arg_3 ]
evalrealheapsortbb17in [6 ]
n_evalrealheapsortbb10in___14 [Arg_0+2-Arg_2 ]
n_evalrealheapsortbb9in___15 [Arg_0+Arg_2+2-2*Arg_3 ]
n_evalrealheapsortbb11in___13 [Arg_0+Arg_3+2-2*Arg_2 ]

MPRF for transition 610:n_evalrealheapsortbb13in___10(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb14in___9(Arg_0,Arg_1,Arg_2,Arg_3):|:3<=Arg_3 && 4<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 3<=Arg_1+Arg_3 && 9<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 3+Arg_1+Arg_3<=Arg_0 && 0<=Arg_1 && 3<=Arg_3 && 2*Arg_2+1<=Arg_3 && Arg_3<=1+2*Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3 of depth 1:

new bound:

2*Arg_0*Arg_0+6*Arg_0+4 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [1-Arg_0 ]
evalrealheapsortbb18in [1-Arg_0 ]
evalrealheapsortbb8in [1-Arg_0 ]
evalrealheapsortbb16in [1-Arg_0 ]
n_evalrealheapsortbb10in___23 [Arg_0-2 ]
n_evalrealheapsortbb11in___12 [Arg_0-2*Arg_2-2 ]
n_evalrealheapsortbb11in___21 [Arg_0-2 ]
n_evalrealheapsortbb11in___22 [Arg_1+1 ]
n_evalrealheapsortbb12in___11 [Arg_0-2*Arg_3-3 ]
n_evalrealheapsortbb12in___20 [Arg_0-3 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb13in___19 [Arg_0-2 ]
n_evalrealheapsortbb13in___2 [Arg_1+1 ]
n_evalrealheapsortbb13in___4 [Arg_0-3 ]
n_evalrealheapsortbb13in___6 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb13in___8 [Arg_0-2*Arg_2-3 ]
n_evalrealheapsortbb14in___1 [2*Arg_0-Arg_1-5 ]
n_evalrealheapsortbb14in___18 [Arg_0-2*Arg_3-2 ]
n_evalrealheapsortbb14in___3 [Arg_0-2*Arg_3-2 ]
n_evalrealheapsortbb14in___5 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb14in___7 [Arg_0-2*Arg_2-8 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_3-5 ]
n_evalrealheapsortbb16in___16 [Arg_0-2*Arg_3-2 ]
n_evalrealheapsortbb16in___17 [Arg_0-Arg_3-1 ]
evalrealheapsortbb17in [1-Arg_0 ]
n_evalrealheapsortbb10in___14 [Arg_0-2*Arg_2-2 ]
n_evalrealheapsortbb9in___15 [Arg_0-2*Arg_2-2 ]
n_evalrealheapsortbb11in___13 [Arg_0-2*Arg_2-2 ]

MPRF for transition 611:n_evalrealheapsortbb13in___10(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___17(Arg_0,Arg_1,Arg_0,Arg_3):|:3<=Arg_3 && 4<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 3<=Arg_1+Arg_3 && 9<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 3+Arg_1+Arg_3<=Arg_0 && 0<=Arg_1 && 3<=Arg_3 && 2*Arg_2+1<=Arg_3 && Arg_3<=1+2*Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalrealheapsortbb18in [Arg_0-Arg_1 ]
evalrealheapsortbb8in [Arg_0-Arg_1 ]
evalrealheapsortbb16in [Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___12 [Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___21 [Arg_0-Arg_1 ]
n_evalrealheapsortbb12in___11 [Arg_0-Arg_1 ]
n_evalrealheapsortbb12in___20 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___19 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___2 [3 ]
n_evalrealheapsortbb13in___4 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___6 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___1 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___18 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___3 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___5 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortbb16in___16 [Arg_0-Arg_1 ]
n_evalrealheapsortbb16in___17 [Arg_0-Arg_1-1 ]
evalrealheapsortbb17in [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb10in___14 [Arg_0-Arg_1 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___13 [Arg_0-Arg_1 ]
n_evalrealheapsortbb10in___23 [Arg_0-Arg_1 ]
n_evalrealheapsortbb9in___24 [Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___22 [3 ]

MPRF for transition 618:n_evalrealheapsortbb13in___6(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb14in___5(Arg_0,Arg_1,Arg_2,Arg_3):|:1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 && 0<=Arg_1 && 5+Arg_1<=Arg_0 && Arg_0<=Arg_1+Arg_3+2 && 2+Arg_1+Arg_3<=Arg_0 && Arg_0<=Arg_1+2*Arg_2+3 && 3+Arg_1+2*Arg_2<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3 of depth 1:

new bound:

2*Arg_0*Arg_0+5*Arg_0+5 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [2 ]
evalrealheapsortbb18in [2 ]
evalrealheapsortbb8in [2 ]
evalrealheapsortbb16in [2 ]
n_evalrealheapsortbb10in___23 [Arg_0 ]
n_evalrealheapsortbb11in___12 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb11in___21 [Arg_0 ]
n_evalrealheapsortbb11in___22 [Arg_1+3 ]
n_evalrealheapsortbb12in___11 [Arg_0-Arg_2-1 ]
n_evalrealheapsortbb12in___20 [Arg_0 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_2-1 ]
n_evalrealheapsortbb13in___19 [Arg_0 ]
n_evalrealheapsortbb13in___2 [Arg_1+3 ]
n_evalrealheapsortbb13in___4 [Arg_0 ]
n_evalrealheapsortbb13in___6 [Arg_1+3 ]
n_evalrealheapsortbb13in___8 [Arg_0-2*Arg_2-1 ]
n_evalrealheapsortbb14in___1 [Arg_0 ]
n_evalrealheapsortbb14in___18 [Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___3 [Arg_0 ]
n_evalrealheapsortbb14in___5 [2*Arg_0-Arg_1-2*Arg_3-2 ]
n_evalrealheapsortbb14in___7 [Arg_0-2*Arg_2-1 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_2-1 ]
n_evalrealheapsortbb16in___16 [Arg_0-Arg_2 ]
n_evalrealheapsortbb16in___17 [Arg_2-Arg_3 ]
evalrealheapsortbb17in [2 ]
n_evalrealheapsortbb10in___14 [Arg_0-Arg_2-1 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb11in___13 [Arg_0-Arg_3-1 ]

MPRF for transition 619:n_evalrealheapsortbb13in___6(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___17(Arg_0,Arg_1,Arg_0,Arg_3):|:1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 && 0<=Arg_1 && 5+Arg_1<=Arg_0 && Arg_0<=Arg_1+Arg_3+2 && 2+Arg_1+Arg_3<=Arg_0 && Arg_0<=Arg_1+2*Arg_2+3 && 3+Arg_1+2*Arg_2<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3 of depth 1:

new bound:

Arg_0+1 {O(n)}

MPRF:

evalrealheapsortbb18in [Arg_0+1-Arg_1 ]
evalrealheapsortbb8in [Arg_0+1-Arg_1 ]
evalrealheapsortbb16in [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb11in___12 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb11in___21 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb12in___11 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb12in___20 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb13in___10 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb13in___19 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb13in___2 [3*Arg_3+1 ]
n_evalrealheapsortbb13in___4 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb13in___6 [2*Arg_2+4 ]
n_evalrealheapsortbb13in___8 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb14in___1 [Arg_0+3*Arg_3-Arg_1-2 ]
n_evalrealheapsortbb14in___18 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb14in___3 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb14in___5 [Arg_0+2*Arg_2+2-Arg_1-Arg_3 ]
n_evalrealheapsortbb14in___7 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb14in___9 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb16in___16 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb16in___17 [Arg_2-Arg_1 ]
evalrealheapsortbb17in [Arg_0-Arg_1 ]
n_evalrealheapsortbb10in___14 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb9in___15 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb11in___13 [2*Arg_3+4 ]
n_evalrealheapsortbb10in___23 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb9in___24 [Arg_0+1-Arg_1 ]
n_evalrealheapsortbb11in___22 [4 ]

MPRF for transition 620:n_evalrealheapsortbb13in___8(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb14in___7(Arg_0,Arg_1,Arg_2,Arg_3):|:4<=Arg_3 && 5<=Arg_2+Arg_3 && 3+Arg_2<=Arg_3 && 4<=Arg_1+Arg_3 && 10<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 2+Arg_1+Arg_3<=Arg_0 && 0<=Arg_1 && 4<=Arg_3 && 2*Arg_2+2<=Arg_3 && Arg_3<=2+2*Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3 of depth 1:

new bound:

4*Arg_0*Arg_0+6*Arg_0+1 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [Arg_0 ]
evalrealheapsortbb18in [Arg_0 ]
evalrealheapsortbb8in [Arg_0 ]
evalrealheapsortbb16in [Arg_0 ]
n_evalrealheapsortbb10in___23 [2*Arg_0 ]
n_evalrealheapsortbb11in___12 [2*Arg_0+1-2*Arg_3 ]
n_evalrealheapsortbb11in___21 [2*Arg_0 ]
n_evalrealheapsortbb11in___22 [2*Arg_0-1 ]
n_evalrealheapsortbb12in___11 [2*Arg_0+1-2*Arg_3 ]
n_evalrealheapsortbb12in___20 [2*Arg_0 ]
n_evalrealheapsortbb13in___10 [2*Arg_0-2*Arg_2 ]
n_evalrealheapsortbb13in___19 [2*Arg_0 ]
n_evalrealheapsortbb13in___2 [2*Arg_0-1 ]
n_evalrealheapsortbb13in___4 [2*Arg_0 ]
n_evalrealheapsortbb13in___6 [2*Arg_0-2*Arg_2-1 ]
n_evalrealheapsortbb13in___8 [2*Arg_0+1-2*Arg_2 ]
n_evalrealheapsortbb14in___1 [2*Arg_0-1 ]
n_evalrealheapsortbb14in___18 [2*Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___3 [2*Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___5 [2*Arg_0-2*Arg_2-1 ]
n_evalrealheapsortbb14in___7 [2*Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___9 [2*Arg_0+1-Arg_3 ]
n_evalrealheapsortbb16in___16 [2*Arg_0-Arg_2 ]
n_evalrealheapsortbb16in___17 [Arg_2 ]
evalrealheapsortbb17in [Arg_0 ]
n_evalrealheapsortbb10in___14 [2*Arg_0+1-2*Arg_2 ]
n_evalrealheapsortbb9in___15 [2*Arg_0+1-2*Arg_2 ]
n_evalrealheapsortbb11in___13 [Arg_0+Arg_1+2 ]

MPRF for transition 621:n_evalrealheapsortbb13in___8(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___17(Arg_0,Arg_1,Arg_0,Arg_3):|:4<=Arg_3 && 5<=Arg_2+Arg_3 && 3+Arg_2<=Arg_3 && 4<=Arg_1+Arg_3 && 10<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 2+Arg_1+Arg_3<=Arg_0 && 0<=Arg_1 && 4<=Arg_3 && 2*Arg_2+2<=Arg_3 && Arg_3<=2+2*Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3 of depth 1:

new bound:

2*Arg_0 {O(n)}

MPRF:

evalrealheapsortbb18in [2*Arg_0-Arg_1 ]
evalrealheapsortbb8in [2*Arg_0-Arg_1 ]
evalrealheapsortbb16in [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___12 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___21 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb12in___11 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb12in___20 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___10 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___19 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___2 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___4 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___6 [Arg_0+Arg_3+2 ]
n_evalrealheapsortbb13in___8 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___1 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___18 [2*Arg_0+1-Arg_1-Arg_3 ]
n_evalrealheapsortbb14in___3 [2*Arg_0+2-Arg_1-Arg_3 ]
n_evalrealheapsortbb14in___5 [Arg_0+Arg_3+2 ]
n_evalrealheapsortbb14in___7 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___9 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb16in___16 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb16in___17 [2*Arg_0-Arg_1-1 ]
evalrealheapsortbb17in [2*Arg_0-Arg_1-1 ]
n_evalrealheapsortbb10in___14 [2*Arg_0+2*Arg_3-Arg_1-2*Arg_2 ]
n_evalrealheapsortbb9in___15 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___13 [Arg_0+2*Arg_2+3 ]
n_evalrealheapsortbb10in___23 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb9in___24 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___22 [2*Arg_0-Arg_1 ]

MPRF for transition 625:n_evalrealheapsortbb14in___5(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___16(Arg_0,Arg_1,Arg_3,Arg_3):|:2+Arg_3<=Arg_0 && 1<=Arg_3 && 1<=Arg_2+Arg_3 && 1+Arg_2<=Arg_3 && 3<=Arg_1+Arg_3 && 8<=Arg_0+Arg_3 && 3+Arg_2<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 5<=Arg_0+Arg_2 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 && 0<=Arg_1 && 5+Arg_1<=Arg_0 && Arg_0<=Arg_1+Arg_3+2 && 2+Arg_1+Arg_3<=Arg_0 && Arg_0<=Arg_1+2*Arg_2+3 && 3+Arg_1+2*Arg_2<=Arg_0 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3 of depth 1:

new bound:

2*Arg_0*Arg_0+7*Arg_0+13 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [11-3*Arg_0 ]
evalrealheapsortbb18in [11-3*Arg_0 ]
evalrealheapsortbb8in [11-3*Arg_0 ]
evalrealheapsortbb16in [11-3*Arg_0 ]
n_evalrealheapsortbb10in___23 [Arg_0 ]
n_evalrealheapsortbb11in___12 [Arg_0-2*Arg_2 ]
n_evalrealheapsortbb11in___21 [Arg_0 ]
n_evalrealheapsortbb11in___22 [Arg_1+2 ]
n_evalrealheapsortbb12in___11 [Arg_0-2*Arg_2 ]
n_evalrealheapsortbb12in___20 [Arg_0 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_3 ]
n_evalrealheapsortbb13in___19 [Arg_0 ]
n_evalrealheapsortbb13in___2 [Arg_1+2 ]
n_evalrealheapsortbb13in___4 [Arg_0 ]
n_evalrealheapsortbb13in___6 [Arg_1+3 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___1 [Arg_0-1 ]
n_evalrealheapsortbb14in___18 [Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___3 [Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___5 [Arg_1+3 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_3 ]
n_evalrealheapsortbb16in___16 [Arg_0-Arg_3 ]
n_evalrealheapsortbb16in___17 [Arg_3+4-Arg_0-Arg_1 ]
evalrealheapsortbb17in [11-3*Arg_0 ]
n_evalrealheapsortbb10in___14 [Arg_0-2*Arg_2 ]
n_evalrealheapsortbb9in___15 [Arg_0-2*Arg_3 ]
n_evalrealheapsortbb11in___13 [Arg_0-2*Arg_3 ]

MPRF for transition 626:n_evalrealheapsortbb14in___7(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___16(Arg_0,Arg_1,Arg_3,Arg_3):|:2+Arg_3<=Arg_0 && 4<=Arg_3 && 5<=Arg_2+Arg_3 && 3+Arg_2<=Arg_3 && 4<=Arg_1+Arg_3 && 10<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 2+Arg_1+Arg_3<=Arg_0 && 0<=Arg_1 && 4<=Arg_3 && 2*Arg_2+2<=Arg_3 && Arg_3<=2+2*Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3 of depth 1:

new bound:

4*Arg_0*Arg_0+11*Arg_0+9 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [Arg_0+3-Arg_1 ]
evalrealheapsortbb18in [Arg_0+3-Arg_1 ]
evalrealheapsortbb8in [Arg_0+3-Arg_1 ]
evalrealheapsortbb16in [Arg_0+3-Arg_1 ]
n_evalrealheapsortbb10in___23 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___12 [2*Arg_0+1-Arg_1-Arg_3 ]
n_evalrealheapsortbb11in___21 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___22 [Arg_1+6 ]
n_evalrealheapsortbb12in___11 [2*Arg_0+1-Arg_1-Arg_3 ]
n_evalrealheapsortbb12in___20 [2*Arg_0-Arg_1-1 ]
n_evalrealheapsortbb13in___10 [2*Arg_0-Arg_1-Arg_2 ]
n_evalrealheapsortbb13in___19 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___2 [Arg_1+6 ]
n_evalrealheapsortbb13in___4 [2*Arg_0-Arg_1-1 ]
n_evalrealheapsortbb13in___6 [Arg_1+Arg_3+7 ]
n_evalrealheapsortbb13in___8 [2*Arg_0+4-Arg_1-Arg_3 ]
n_evalrealheapsortbb14in___1 [2*Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___18 [2*Arg_0+1-Arg_1-Arg_3 ]
n_evalrealheapsortbb14in___3 [2*Arg_0+1-Arg_1-Arg_3 ]
n_evalrealheapsortbb14in___5 [2*Arg_0+1-Arg_1-Arg_3 ]
n_evalrealheapsortbb14in___7 [2*Arg_0+2-Arg_1-Arg_3 ]
n_evalrealheapsortbb14in___9 [2*Arg_0-Arg_1-Arg_2-1 ]
n_evalrealheapsortbb16in___16 [2*Arg_0+1-Arg_1-Arg_3 ]
n_evalrealheapsortbb16in___17 [2*Arg_0+1-Arg_1-Arg_3 ]
evalrealheapsortbb17in [Arg_0+3-Arg_1 ]
n_evalrealheapsortbb10in___14 [2*Arg_0+Arg_3+1-Arg_1-2*Arg_2 ]
n_evalrealheapsortbb9in___15 [2*Arg_0+Arg_3+1-Arg_1-2*Arg_2 ]
n_evalrealheapsortbb11in___13 [Arg_1+2*Arg_2+8 ]

MPRF for transition 627:n_evalrealheapsortbb14in___9(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb16in___16(Arg_0,Arg_1,Arg_3,Arg_3):|:3+Arg_3<=Arg_0 && 3<=Arg_3 && 4<=Arg_2+Arg_3 && 2+Arg_2<=Arg_3 && 3<=Arg_1+Arg_3 && 9<=Arg_0+Arg_3 && 5+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 7<=Arg_0+Arg_2 && 6+Arg_1<=Arg_0 && 0<=Arg_1 && 6<=Arg_0+Arg_1 && 6<=Arg_0 && 3+Arg_1+Arg_3<=Arg_0 && 0<=Arg_1 && 3<=Arg_3 && 2*Arg_2+1<=Arg_3 && Arg_3<=1+2*Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_2<=Arg_0 && 1+Arg_2<=Arg_3 of depth 1:

new bound:

2*Arg_0*Arg_0+3*Arg_0+1 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [0 ]
evalrealheapsortbb18in [0 ]
evalrealheapsortbb8in [0 ]
evalrealheapsortbb16in [0 ]
n_evalrealheapsortbb10in___23 [Arg_0 ]
n_evalrealheapsortbb11in___12 [Arg_0+Arg_3-2*Arg_2-2 ]
n_evalrealheapsortbb11in___21 [Arg_0 ]
n_evalrealheapsortbb11in___22 [Arg_1+1 ]
n_evalrealheapsortbb12in___11 [Arg_0-Arg_3-2 ]
n_evalrealheapsortbb12in___20 [Arg_0 ]
n_evalrealheapsortbb13in___10 [Arg_0-2*Arg_2-1 ]
n_evalrealheapsortbb13in___19 [Arg_0 ]
n_evalrealheapsortbb13in___2 [Arg_1+1 ]
n_evalrealheapsortbb13in___4 [Arg_0 ]
n_evalrealheapsortbb13in___6 [Arg_1+2 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_2-2 ]
n_evalrealheapsortbb14in___1 [Arg_0-2 ]
n_evalrealheapsortbb14in___18 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb14in___3 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb14in___5 [Arg_0-2*Arg_2-2 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_2-2 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_3 ]
n_evalrealheapsortbb16in___16 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb16in___17 [0 ]
evalrealheapsortbb17in [0 ]
n_evalrealheapsortbb10in___14 [Arg_0-Arg_2-2 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_2-2 ]
n_evalrealheapsortbb11in___13 [2*Arg_0-Arg_1-2*Arg_2-Arg_3-5 ]

MPRF for transition 628:n_evalrealheapsortbb16in___16(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb9in___15(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_2 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 2+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 && 3+Arg_1<=Arg_0 && Arg_2<=Arg_3 && Arg_3<=Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 1<=Arg_2 && 3+Arg_1+2*Arg_2<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 of depth 1:

new bound:

2*Arg_0*Arg_0+2*Arg_0 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [0 ]
evalrealheapsortbb18in [0 ]
evalrealheapsortbb8in [0 ]
evalrealheapsortbb16in [0 ]
n_evalrealheapsortbb10in___23 [Arg_0 ]
n_evalrealheapsortbb11in___12 [Arg_0-Arg_2-1 ]
n_evalrealheapsortbb11in___21 [Arg_0 ]
n_evalrealheapsortbb11in___22 [Arg_0 ]
n_evalrealheapsortbb12in___11 [Arg_0+4*Arg_2-5*Arg_3-1 ]
n_evalrealheapsortbb12in___20 [Arg_0-1 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_2-1 ]
n_evalrealheapsortbb13in___19 [Arg_0 ]
n_evalrealheapsortbb13in___2 [Arg_1+3 ]
n_evalrealheapsortbb13in___4 [Arg_0-1 ]
n_evalrealheapsortbb13in___6 [Arg_1+3 ]
n_evalrealheapsortbb13in___8 [Arg_0+Arg_3-3*Arg_2-3 ]
n_evalrealheapsortbb14in___1 [Arg_0 ]
n_evalrealheapsortbb14in___18 [Arg_0+1-Arg_3 ]
n_evalrealheapsortbb14in___3 [Arg_0+1-Arg_3 ]
n_evalrealheapsortbb14in___5 [Arg_0+1-Arg_3 ]
n_evalrealheapsortbb14in___7 [Arg_0+Arg_3-4*Arg_2-2 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_2-1 ]
n_evalrealheapsortbb16in___16 [Arg_0+Arg_3+1-2*Arg_2 ]
n_evalrealheapsortbb16in___17 [0 ]
evalrealheapsortbb17in [0 ]
n_evalrealheapsortbb10in___14 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_3-1 ]
n_evalrealheapsortbb11in___13 [Arg_1+3 ]

MPRF for transition 651:n_evalrealheapsortbb16in___16(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb17in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_2 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && 2+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 4<=Arg_0+Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=2*Arg_2+2+Arg_1 of depth 1:

new bound:

Arg_0+2 {O(n)}

MPRF:

evalrealheapsortbb18in [Arg_0-Arg_1-2 ]
evalrealheapsortbb8in [Arg_0-Arg_1-2 ]
evalrealheapsortbb16in [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb11in___12 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb11in___21 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb12in___11 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb12in___20 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb13in___10 [Arg_0+30*Arg_3-Arg_1-60*Arg_2-32 ]
n_evalrealheapsortbb13in___19 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb13in___2 [1 ]
n_evalrealheapsortbb13in___4 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb13in___6 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb14in___1 [9*Arg_1+30*Arg_3-9*Arg_0-2 ]
n_evalrealheapsortbb14in___18 [Arg_0+Arg_3-Arg_1-3 ]
n_evalrealheapsortbb14in___3 [Arg_0+Arg_3-Arg_1-4 ]
n_evalrealheapsortbb14in___5 [Arg_3 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb14in___9 [Arg_0+30*Arg_3-Arg_1-60*Arg_2-32 ]
n_evalrealheapsortbb16in___16 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb16in___17 [Arg_0-Arg_1-3 ]
evalrealheapsortbb17in [Arg_0-Arg_1-3 ]
n_evalrealheapsortbb10in___14 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb11in___13 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb10in___23 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb9in___24 [Arg_0-Arg_1-2 ]
n_evalrealheapsortbb11in___22 [1 ]

MPRF for transition 652:n_evalrealheapsortbb16in___17(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortbb17in(Arg_0,Arg_1,Arg_2,Arg_3):|:2+Arg_3<=Arg_2 && 2+Arg_3<=Arg_0 && 1<=Arg_3 && 4<=Arg_2+Arg_3 && 1<=Arg_1+Arg_3 && 4<=Arg_0+Arg_3 && Arg_2<=Arg_0 && 3<=Arg_2 && 3<=Arg_1+Arg_2 && 3+Arg_1<=Arg_2 && 6<=Arg_0+Arg_2 && Arg_0<=Arg_2 && 3+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && 0<=Arg_2 && 0<=Arg_1+Arg_2 && 3<=Arg_0+Arg_2 && 2+Arg_1<=Arg_0 && 0<=Arg_1 && 3<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=2*Arg_2+2+Arg_1 of depth 1:

new bound:

Arg_0 {O(n)}

MPRF:

evalrealheapsortbb18in [Arg_0-Arg_1 ]
evalrealheapsortbb8in [Arg_0-Arg_1 ]
evalrealheapsortbb16in [Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___12 [Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___21 [Arg_0-Arg_1 ]
n_evalrealheapsortbb12in___11 [Arg_0-Arg_1 ]
n_evalrealheapsortbb12in___20 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___19 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___2 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___4 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___6 [Arg_0-Arg_1 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___1 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___18 [Arg_0+Arg_3-Arg_1-1 ]
n_evalrealheapsortbb14in___3 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___5 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_1 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_1 ]
n_evalrealheapsortbb16in___16 [Arg_0-Arg_1 ]
n_evalrealheapsortbb16in___17 [Arg_0-Arg_1 ]
evalrealheapsortbb17in [Arg_0-Arg_1-1 ]
n_evalrealheapsortbb10in___14 [Arg_0-Arg_1 ]
n_evalrealheapsortbb9in___15 [Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___13 [Arg_0-Arg_1 ]
n_evalrealheapsortbb10in___23 [Arg_0-Arg_1 ]
n_evalrealheapsortbb9in___24 [Arg_0-Arg_1 ]
n_evalrealheapsortbb11in___22 [Arg_0-Arg_1 ]

MPRF for transition 630:n_evalrealheapsortbb9in___15(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb10in___14(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_3<=Arg_2 && 4+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && 4+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 6<=Arg_0+Arg_2 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 && 3+Arg_1+2*Arg_3<=Arg_0 && 0<=Arg_1 && 1<=Arg_3 && Arg_2<=Arg_3 && Arg_3<=Arg_2 && 4+Arg_1+2*Arg_2<=Arg_0 && 0<=Arg_1 && 0<=Arg_2 of depth 1:

new bound:

2*Arg_0*Arg_0+4*Arg_0+4 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [-2 ]
evalrealheapsortbb18in [-2 ]
evalrealheapsortbb8in [-2 ]
evalrealheapsortbb16in [-2 ]
n_evalrealheapsortbb10in___23 [Arg_0 ]
n_evalrealheapsortbb11in___12 [Arg_0-2*Arg_3-4 ]
n_evalrealheapsortbb11in___21 [Arg_0 ]
n_evalrealheapsortbb11in___22 [Arg_1-2 ]
n_evalrealheapsortbb12in___11 [Arg_0-2*Arg_2-4 ]
n_evalrealheapsortbb12in___20 [Arg_0 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_3-3 ]
n_evalrealheapsortbb13in___19 [Arg_0 ]
n_evalrealheapsortbb13in___2 [Arg_1-2 ]
n_evalrealheapsortbb13in___4 [Arg_0 ]
n_evalrealheapsortbb13in___6 [Arg_0-2*Arg_2-5 ]
n_evalrealheapsortbb13in___8 [Arg_0-Arg_3-2 ]
n_evalrealheapsortbb14in___1 [Arg_0-5 ]
n_evalrealheapsortbb14in___18 [Arg_0-2*Arg_3-3 ]
n_evalrealheapsortbb14in___3 [Arg_0-2*Arg_3-2 ]
n_evalrealheapsortbb14in___5 [Arg_0-2*Arg_2-5 ]
n_evalrealheapsortbb14in___7 [Arg_0-Arg_3-2 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_3-3 ]
n_evalrealheapsortbb16in___16 [Arg_0+Arg_3-2*Arg_2-4 ]
n_evalrealheapsortbb16in___17 [Arg_0-Arg_3-4 ]
evalrealheapsortbb17in [-2 ]
n_evalrealheapsortbb10in___14 [Arg_0-2*Arg_3-4 ]
n_evalrealheapsortbb9in___15 [Arg_0-2*Arg_2-3 ]
n_evalrealheapsortbb11in___13 [Arg_0-2*Arg_2-5 ]

MPRF for transition 631:n_evalrealheapsortbb9in___15(Arg_0,Arg_1,Arg_2,Arg_3) -> n_evalrealheapsortbb11in___13(Arg_0,Arg_1,Arg2_P,Arg_3):|:Arg_3<=Arg_2 && 4+Arg_3<=Arg_0 && 1<=Arg_3 && 2<=Arg_2+Arg_3 && Arg_2<=Arg_3 && 1<=Arg_1+Arg_3 && 6<=Arg_0+Arg_3 && 4+Arg_2<=Arg_0 && 1<=Arg_2 && 1<=Arg_1+Arg_2 && 6<=Arg_0+Arg_2 && 5+Arg_1<=Arg_0 && 0<=Arg_1 && 5<=Arg_0+Arg_1 && 5<=Arg_0 && 3+Arg_1+2*Arg_3<=Arg_0 && 0<=Arg_1 && 1<=Arg_3 && Arg_2<=Arg_3 && Arg_3<=Arg_2 && 0<=Arg_1 && 3+Arg_1<=Arg_0 && Arg_0<=Arg_1+2*Arg_2+3 && 3+Arg_1+2*Arg_2<=Arg_0 && Arg_0<=Arg_1+2*Arg2_P+3 && 3+Arg_1+2*Arg2_P<=Arg_0 of depth 1:

new bound:

2*Arg_0*Arg_0+5*Arg_0+4 {O(n^2)}

MPRF:

n_evalrealheapsortbb9in___24 [-1 ]
evalrealheapsortbb18in [-1 ]
evalrealheapsortbb8in [-1 ]
evalrealheapsortbb16in [-1 ]
n_evalrealheapsortbb10in___23 [Arg_0-1 ]
n_evalrealheapsortbb11in___12 [Arg_0-2*Arg_3-1 ]
n_evalrealheapsortbb11in___21 [Arg_0-1 ]
n_evalrealheapsortbb11in___22 [Arg_1+2 ]
n_evalrealheapsortbb12in___11 [Arg_0-2*Arg_3 ]
n_evalrealheapsortbb12in___20 [Arg_0-1 ]
n_evalrealheapsortbb13in___10 [Arg_0-Arg_3 ]
n_evalrealheapsortbb13in___19 [Arg_0-1 ]
n_evalrealheapsortbb13in___2 [Arg_1+2 ]
n_evalrealheapsortbb13in___4 [Arg_0-2 ]
n_evalrealheapsortbb13in___6 [Arg_1+2 ]
n_evalrealheapsortbb13in___8 [Arg_0+Arg_3-4*Arg_2-2 ]
n_evalrealheapsortbb14in___1 [2*Arg_0-Arg_1-4*Arg_3 ]
n_evalrealheapsortbb14in___18 [Arg_0-Arg_3 ]
n_evalrealheapsortbb14in___3 [Arg_0+2*Arg_3-6 ]
n_evalrealheapsortbb14in___5 [Arg_1+2 ]
n_evalrealheapsortbb14in___7 [Arg_0+Arg_3-4*Arg_2-2 ]
n_evalrealheapsortbb14in___9 [Arg_0-Arg_3 ]
n_evalrealheapsortbb16in___16 [Arg_0+6*Arg_3-7*Arg_2 ]
n_evalrealheapsortbb16in___17 [2 ]
evalrealheapsortbb17in [-1 ]
n_evalrealheapsortbb10in___14 [Arg_0-2*Arg_2 ]
n_evalrealheapsortbb9in___15 [Arg_0-2*Arg_2 ]
n_evalrealheapsortbb11in___13 [Arg_1+2 ]

CFR did not improve the program. Rolling back

All Bounds

Timebounds

Overall timebound:18*Arg_0*Arg_0+87*Arg_0+112 {O(n^2)}
50: evalrealheapsortbb10in->evalrealheapsortbb11in: Arg_0*Arg_0+6*Arg_0+9 {O(n^2)}
51: evalrealheapsortbb10in->evalrealheapsortbb12in: Arg_0*Arg_0+6*Arg_0+9 {O(n^2)}
52: evalrealheapsortbb11in->evalrealheapsortbb13in: Arg_0*Arg_0+5*Arg_0+7 {O(n^2)}
53: evalrealheapsortbb12in->evalrealheapsortbb13in: Arg_0*Arg_0+6*Arg_0+9 {O(n^2)}
54: evalrealheapsortbb13in->evalrealheapsortbb14in: Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}
55: evalrealheapsortbb13in->evalrealheapsortbb16in: Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}
56: evalrealheapsortbb14in->evalrealheapsortbb16in: Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}
45: evalrealheapsortbb16in->evalrealheapsortbb9in: Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}
46: evalrealheapsortbb16in->evalrealheapsortbb17in: Arg_0 {O(n)}
57: evalrealheapsortbb17in->evalrealheapsortbb18in: Arg_0 {O(n)}
42: evalrealheapsortbb18in->evalrealheapsortbb8in: Arg_0+1 {O(n)}
43: evalrealheapsortbb18in->evalrealheapsortreturnin: 1 {O(1)}
26: evalrealheapsortbb2in->evalrealheapsortbb3in: 2*Arg_0*Arg_0+10*Arg_0+12 {O(n^2)}
5: evalrealheapsortbb3in->evalrealheapsortbb5in: Arg_0+1 {O(n)}
6: evalrealheapsortbb3in->evalrealheapsortbb4in: 2*Arg_0*Arg_0+11*Arg_0+14 {O(n^2)}
8: evalrealheapsortbb4in->evalrealheapsortbb2in: 3*Arg_0*Arg_0+12*Arg_0+12 {O(n^2)}
11: evalrealheapsortbb4in->evalrealheapsortbb5in: Arg_0+2 {O(n)}
40: evalrealheapsortbb5in->evalrealheapsortbb6in: Arg_0+1 {O(n)}
3: evalrealheapsortbb6in->evalrealheapsortbb3in: Arg_0+2 {O(n)}
4: evalrealheapsortbb6in->evalrealheapsortbb7in: 1 {O(1)}
41: evalrealheapsortbb7in->evalrealheapsortbb18in: 1 {O(1)}
44: evalrealheapsortbb8in->evalrealheapsortbb16in: Arg_0+1 {O(n)}
47: evalrealheapsortbb9in->evalrealheapsortbb11in: 2*Arg_0*Arg_0+6*Arg_0+6 {O(n^2)}
48: evalrealheapsortbb9in->evalrealheapsortbb10in: Arg_0*Arg_0+5*Arg_0+7 {O(n^2)}
1: evalrealheapsortentryin->evalrealheapsortbb6in: 1 {O(1)}
2: evalrealheapsortentryin->evalrealheapsortreturnin: 1 {O(1)}
58: evalrealheapsortreturnin->evalrealheapsortstop: 1 {O(1)}
0: evalrealheapsortstart->evalrealheapsortentryin: 1 {O(1)}

Costbounds

Overall costbound: 18*Arg_0*Arg_0+87*Arg_0+112 {O(n^2)}
50: evalrealheapsortbb10in->evalrealheapsortbb11in: Arg_0*Arg_0+6*Arg_0+9 {O(n^2)}
51: evalrealheapsortbb10in->evalrealheapsortbb12in: Arg_0*Arg_0+6*Arg_0+9 {O(n^2)}
52: evalrealheapsortbb11in->evalrealheapsortbb13in: Arg_0*Arg_0+5*Arg_0+7 {O(n^2)}
53: evalrealheapsortbb12in->evalrealheapsortbb13in: Arg_0*Arg_0+6*Arg_0+9 {O(n^2)}
54: evalrealheapsortbb13in->evalrealheapsortbb14in: Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}
55: evalrealheapsortbb13in->evalrealheapsortbb16in: Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}
56: evalrealheapsortbb14in->evalrealheapsortbb16in: Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}
45: evalrealheapsortbb16in->evalrealheapsortbb9in: Arg_0*Arg_0+3*Arg_0+3 {O(n^2)}
46: evalrealheapsortbb16in->evalrealheapsortbb17in: Arg_0 {O(n)}
57: evalrealheapsortbb17in->evalrealheapsortbb18in: Arg_0 {O(n)}
42: evalrealheapsortbb18in->evalrealheapsortbb8in: Arg_0+1 {O(n)}
43: evalrealheapsortbb18in->evalrealheapsortreturnin: 1 {O(1)}
26: evalrealheapsortbb2in->evalrealheapsortbb3in: 2*Arg_0*Arg_0+10*Arg_0+12 {O(n^2)}
5: evalrealheapsortbb3in->evalrealheapsortbb5in: Arg_0+1 {O(n)}
6: evalrealheapsortbb3in->evalrealheapsortbb4in: 2*Arg_0*Arg_0+11*Arg_0+14 {O(n^2)}
8: evalrealheapsortbb4in->evalrealheapsortbb2in: 3*Arg_0*Arg_0+12*Arg_0+12 {O(n^2)}
11: evalrealheapsortbb4in->evalrealheapsortbb5in: Arg_0+2 {O(n)}
40: evalrealheapsortbb5in->evalrealheapsortbb6in: Arg_0+1 {O(n)}
3: evalrealheapsortbb6in->evalrealheapsortbb3in: Arg_0+2 {O(n)}
4: evalrealheapsortbb6in->evalrealheapsortbb7in: 1 {O(1)}
41: evalrealheapsortbb7in->evalrealheapsortbb18in: 1 {O(1)}
44: evalrealheapsortbb8in->evalrealheapsortbb16in: Arg_0+1 {O(n)}
47: evalrealheapsortbb9in->evalrealheapsortbb11in: 2*Arg_0*Arg_0+6*Arg_0+6 {O(n^2)}
48: evalrealheapsortbb9in->evalrealheapsortbb10in: Arg_0*Arg_0+5*Arg_0+7 {O(n^2)}
1: evalrealheapsortentryin->evalrealheapsortbb6in: 1 {O(1)}
2: evalrealheapsortentryin->evalrealheapsortreturnin: 1 {O(1)}
58: evalrealheapsortreturnin->evalrealheapsortstop: 1 {O(1)}
0: evalrealheapsortstart->evalrealheapsortentryin: 1 {O(1)}

Sizebounds

50: evalrealheapsortbb10in->evalrealheapsortbb11in, Arg_0: Arg_0 {O(n)}
50: evalrealheapsortbb10in->evalrealheapsortbb11in, Arg_1: Arg_0 {O(n)}
50: evalrealheapsortbb10in->evalrealheapsortbb11in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
50: evalrealheapsortbb10in->evalrealheapsortbb11in, Arg_3: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*64+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*8*Arg_0*Arg_0+Arg_3 {O(EXP)}
51: evalrealheapsortbb10in->evalrealheapsortbb12in, Arg_0: Arg_0 {O(n)}
51: evalrealheapsortbb10in->evalrealheapsortbb12in, Arg_1: Arg_0 {O(n)}
51: evalrealheapsortbb10in->evalrealheapsortbb12in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
51: evalrealheapsortbb10in->evalrealheapsortbb12in, Arg_3: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*64+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*8*Arg_0*Arg_0+Arg_3 {O(EXP)}
52: evalrealheapsortbb11in->evalrealheapsortbb13in, Arg_0: Arg_0 {O(n)}
52: evalrealheapsortbb11in->evalrealheapsortbb13in, Arg_1: Arg_0 {O(n)}
52: evalrealheapsortbb11in->evalrealheapsortbb13in, Arg_2: 22*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*32+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*4*Arg_0*Arg_0 {O(EXP)}
52: evalrealheapsortbb11in->evalrealheapsortbb13in, Arg_3: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
53: evalrealheapsortbb12in->evalrealheapsortbb13in, Arg_0: Arg_0 {O(n)}
53: evalrealheapsortbb12in->evalrealheapsortbb13in, Arg_1: Arg_0 {O(n)}
53: evalrealheapsortbb12in->evalrealheapsortbb13in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
53: evalrealheapsortbb12in->evalrealheapsortbb13in, Arg_3: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
54: evalrealheapsortbb13in->evalrealheapsortbb14in, Arg_0: Arg_0 {O(n)}
54: evalrealheapsortbb13in->evalrealheapsortbb14in, Arg_1: Arg_0 {O(n)}
54: evalrealheapsortbb13in->evalrealheapsortbb14in, Arg_2: 16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*32+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*4*Arg_0*Arg_0 {O(EXP)}
54: evalrealheapsortbb13in->evalrealheapsortbb14in, Arg_3: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
55: evalrealheapsortbb13in->evalrealheapsortbb16in, Arg_0: Arg_0 {O(n)}
55: evalrealheapsortbb13in->evalrealheapsortbb16in, Arg_1: Arg_0 {O(n)}
55: evalrealheapsortbb13in->evalrealheapsortbb16in, Arg_2: 2*Arg_0 {O(n)}
55: evalrealheapsortbb13in->evalrealheapsortbb16in, Arg_3: 22*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*32+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*4*Arg_0*Arg_0 {O(EXP)}
56: evalrealheapsortbb14in->evalrealheapsortbb16in, Arg_0: Arg_0 {O(n)}
56: evalrealheapsortbb14in->evalrealheapsortbb16in, Arg_1: Arg_0 {O(n)}
56: evalrealheapsortbb14in->evalrealheapsortbb16in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
56: evalrealheapsortbb14in->evalrealheapsortbb16in, Arg_3: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
45: evalrealheapsortbb16in->evalrealheapsortbb9in, Arg_0: Arg_0 {O(n)}
45: evalrealheapsortbb16in->evalrealheapsortbb9in, Arg_1: Arg_0 {O(n)}
45: evalrealheapsortbb16in->evalrealheapsortbb9in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
45: evalrealheapsortbb16in->evalrealheapsortbb9in, Arg_3: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*64+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*8*Arg_0*Arg_0+Arg_3 {O(EXP)}
46: evalrealheapsortbb16in->evalrealheapsortbb17in, Arg_0: Arg_0 {O(n)}
46: evalrealheapsortbb16in->evalrealheapsortbb17in, Arg_1: Arg_0 {O(n)}
46: evalrealheapsortbb16in->evalrealheapsortbb17in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2*Arg_0 {O(EXP)}
46: evalrealheapsortbb16in->evalrealheapsortbb17in, Arg_3: 16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*32+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*4*Arg_0*Arg_0+Arg_3 {O(EXP)}
57: evalrealheapsortbb17in->evalrealheapsortbb18in, Arg_0: Arg_0 {O(n)}
57: evalrealheapsortbb17in->evalrealheapsortbb18in, Arg_1: Arg_0 {O(n)}
57: evalrealheapsortbb17in->evalrealheapsortbb18in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2*Arg_0 {O(EXP)}
57: evalrealheapsortbb17in->evalrealheapsortbb18in, Arg_3: 16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*32+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*4*Arg_0*Arg_0+Arg_3 {O(EXP)}
42: evalrealheapsortbb18in->evalrealheapsortbb8in, Arg_0: Arg_0 {O(n)}
42: evalrealheapsortbb18in->evalrealheapsortbb8in, Arg_1: Arg_0 {O(n)}
42: evalrealheapsortbb18in->evalrealheapsortbb8in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+3*Arg_0+3 {O(EXP)}
42: evalrealheapsortbb18in->evalrealheapsortbb8in, Arg_3: 16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*32+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*4*Arg_0*Arg_0+Arg_3 {O(EXP)}
43: evalrealheapsortbb18in->evalrealheapsortreturnin, Arg_0: Arg_0 {O(n)}
43: evalrealheapsortbb18in->evalrealheapsortreturnin, Arg_1: Arg_0 {O(n)}
43: evalrealheapsortbb18in->evalrealheapsortreturnin, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2*Arg_0 {O(EXP)}
43: evalrealheapsortbb18in->evalrealheapsortreturnin, Arg_3: 16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*32+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*4*Arg_0*Arg_0+Arg_3 {O(EXP)}
26: evalrealheapsortbb2in->evalrealheapsortbb3in, Arg_0: Arg_0 {O(n)}
26: evalrealheapsortbb2in->evalrealheapsortbb3in, Arg_1: Arg_0+2 {O(n)}
26: evalrealheapsortbb2in->evalrealheapsortbb3in, Arg_2: Arg_0+3 {O(n)}
26: evalrealheapsortbb2in->evalrealheapsortbb3in, Arg_3: Arg_3 {O(n)}
5: evalrealheapsortbb3in->evalrealheapsortbb5in, Arg_0: Arg_0 {O(n)}
5: evalrealheapsortbb3in->evalrealheapsortbb5in, Arg_1: Arg_0+2 {O(n)}
5: evalrealheapsortbb3in->evalrealheapsortbb5in, Arg_2: 0 {O(1)}
5: evalrealheapsortbb3in->evalrealheapsortbb5in, Arg_3: Arg_3 {O(n)}
6: evalrealheapsortbb3in->evalrealheapsortbb4in, Arg_0: Arg_0 {O(n)}
6: evalrealheapsortbb3in->evalrealheapsortbb4in, Arg_1: Arg_0+2 {O(n)}
6: evalrealheapsortbb3in->evalrealheapsortbb4in, Arg_2: Arg_0+3 {O(n)}
6: evalrealheapsortbb3in->evalrealheapsortbb4in, Arg_3: Arg_3 {O(n)}
8: evalrealheapsortbb4in->evalrealheapsortbb2in, Arg_0: Arg_0 {O(n)}
8: evalrealheapsortbb4in->evalrealheapsortbb2in, Arg_1: Arg_0+2 {O(n)}
8: evalrealheapsortbb4in->evalrealheapsortbb2in, Arg_2: Arg_0+3 {O(n)}
8: evalrealheapsortbb4in->evalrealheapsortbb2in, Arg_3: Arg_3 {O(n)}
11: evalrealheapsortbb4in->evalrealheapsortbb5in, Arg_0: Arg_0 {O(n)}
11: evalrealheapsortbb4in->evalrealheapsortbb5in, Arg_1: Arg_0+2 {O(n)}
11: evalrealheapsortbb4in->evalrealheapsortbb5in, Arg_2: Arg_0+3 {O(n)}
11: evalrealheapsortbb4in->evalrealheapsortbb5in, Arg_3: Arg_3 {O(n)}
40: evalrealheapsortbb5in->evalrealheapsortbb6in, Arg_0: Arg_0 {O(n)}
40: evalrealheapsortbb5in->evalrealheapsortbb6in, Arg_1: Arg_0+2 {O(n)}
40: evalrealheapsortbb5in->evalrealheapsortbb6in, Arg_2: Arg_0+3 {O(n)}
40: evalrealheapsortbb5in->evalrealheapsortbb6in, Arg_3: Arg_3 {O(n)}
3: evalrealheapsortbb6in->evalrealheapsortbb3in, Arg_0: Arg_0 {O(n)}
3: evalrealheapsortbb6in->evalrealheapsortbb3in, Arg_1: Arg_0+2 {O(n)}
3: evalrealheapsortbb6in->evalrealheapsortbb3in, Arg_2: Arg_0+3 {O(n)}
3: evalrealheapsortbb6in->evalrealheapsortbb3in, Arg_3: Arg_3 {O(n)}
4: evalrealheapsortbb6in->evalrealheapsortbb7in, Arg_0: Arg_0 {O(n)}
4: evalrealheapsortbb6in->evalrealheapsortbb7in, Arg_1: Arg_0+2 {O(n)}
4: evalrealheapsortbb6in->evalrealheapsortbb7in, Arg_2: Arg_0+3 {O(n)}
4: evalrealheapsortbb6in->evalrealheapsortbb7in, Arg_3: Arg_3 {O(n)}
41: evalrealheapsortbb7in->evalrealheapsortbb18in, Arg_0: Arg_0 {O(n)}
41: evalrealheapsortbb7in->evalrealheapsortbb18in, Arg_1: 0 {O(1)}
41: evalrealheapsortbb7in->evalrealheapsortbb18in, Arg_2: Arg_0+3 {O(n)}
41: evalrealheapsortbb7in->evalrealheapsortbb18in, Arg_3: Arg_3 {O(n)}
44: evalrealheapsortbb8in->evalrealheapsortbb16in, Arg_0: Arg_0 {O(n)}
44: evalrealheapsortbb8in->evalrealheapsortbb16in, Arg_1: Arg_0 {O(n)}
44: evalrealheapsortbb8in->evalrealheapsortbb16in, Arg_2: 0 {O(1)}
44: evalrealheapsortbb8in->evalrealheapsortbb16in, Arg_3: 16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*32+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*4*Arg_0*Arg_0+Arg_3 {O(EXP)}
47: evalrealheapsortbb9in->evalrealheapsortbb11in, Arg_0: Arg_0 {O(n)}
47: evalrealheapsortbb9in->evalrealheapsortbb11in, Arg_1: Arg_0 {O(n)}
47: evalrealheapsortbb9in->evalrealheapsortbb11in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
47: evalrealheapsortbb9in->evalrealheapsortbb11in, Arg_3: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*64+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*8*Arg_0*Arg_0+Arg_3 {O(EXP)}
48: evalrealheapsortbb9in->evalrealheapsortbb10in, Arg_0: Arg_0 {O(n)}
48: evalrealheapsortbb9in->evalrealheapsortbb10in, Arg_1: Arg_0 {O(n)}
48: evalrealheapsortbb9in->evalrealheapsortbb10in, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0 {O(EXP)}
48: evalrealheapsortbb9in->evalrealheapsortbb10in, Arg_3: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*64+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*8*Arg_0*Arg_0+Arg_3 {O(EXP)}
1: evalrealheapsortentryin->evalrealheapsortbb6in, Arg_0: Arg_0 {O(n)}
1: evalrealheapsortentryin->evalrealheapsortbb6in, Arg_1: 1 {O(1)}
1: evalrealheapsortentryin->evalrealheapsortbb6in, Arg_2: Arg_2 {O(n)}
1: evalrealheapsortentryin->evalrealheapsortbb6in, Arg_3: Arg_3 {O(n)}
2: evalrealheapsortentryin->evalrealheapsortreturnin, Arg_0: Arg_0 {O(n)}
2: evalrealheapsortentryin->evalrealheapsortreturnin, Arg_1: Arg_1 {O(n)}
2: evalrealheapsortentryin->evalrealheapsortreturnin, Arg_2: Arg_2 {O(n)}
2: evalrealheapsortentryin->evalrealheapsortreturnin, Arg_3: Arg_3 {O(n)}
58: evalrealheapsortreturnin->evalrealheapsortstop, Arg_0: 2*Arg_0 {O(n)}
58: evalrealheapsortreturnin->evalrealheapsortstop, Arg_1: Arg_0+Arg_1 {O(n)}
58: evalrealheapsortreturnin->evalrealheapsortstop, Arg_2: 11*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0+16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2*Arg_0+Arg_2 {O(EXP)}
58: evalrealheapsortreturnin->evalrealheapsortstop, Arg_3: 16*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)+2*2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*Arg_0*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*32+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*33*Arg_0+2^(Arg_0*Arg_0+5*Arg_0+7)*2^(Arg_0*Arg_0+6*Arg_0+9)*4*Arg_0*Arg_0+2*Arg_3 {O(EXP)}
0: evalrealheapsortstart->evalrealheapsortentryin, Arg_0: Arg_0 {O(n)}
0: evalrealheapsortstart->evalrealheapsortentryin, Arg_1: Arg_1 {O(n)}
0: evalrealheapsortstart->evalrealheapsortentryin, Arg_2: Arg_2 {O(n)}
0: evalrealheapsortstart->evalrealheapsortentryin, Arg_3: Arg_3 {O(n)}