Initial Problem
Start: evalrealheapsortstep1start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: D, E, F
Locations: evalrealheapsortstep1bb2in, evalrealheapsortstep1bb3in, evalrealheapsortstep1bb4in, evalrealheapsortstep1bb5in, evalrealheapsortstep1bb6in, evalrealheapsortstep1entryin, evalrealheapsortstep1returnin, evalrealheapsortstep1start, evalrealheapsortstep1stop
Transitions:
13:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,-1):|:Arg_2+1<=0 && 0<=1+Arg_2
14:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && 0<=D && 2*D<=0 && 0<=1+2*D && Arg_2+1<=0 && 0<=1+Arg_2
15:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && D<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
16:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,-1):|:1<=0 && 0<=D && 2*D<=0 && 0<=1+2*D && Arg_2+1<=0 && 0<=1+Arg_2
17:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && 0<=D && 2*D<=0 && 0<=1+2*D && Arg_2+1<=0 && 0<=1+Arg_2
18:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && D<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
19:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,-1):|:1<=0 && D<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
20:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && E<=0 && 0<=D && 2*D<=0 && 0<=1+2*D && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
21:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && E<=0 && D<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
22:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,-1):|:1<=0 && 0<=D && 2*D<=0 && 0<=1+2*D && Arg_2+1<=0 && 0<=1+Arg_2
23:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && 0<=D && 2*D<=0 && 0<=1+2*D && Arg_2+1<=0 && 0<=1+Arg_2
24:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && D<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
25:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,-1):|:1<=0 && 0<=D && 2*D<=0 && 0<=1+2*D && 0<=E && 2*E<=0 && 0<=1+2*E && Arg_2+1<=0 && 0<=1+Arg_2
26:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && 0<=D && 2*D<=Arg_2+1 && Arg_2<=2*D
27:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && Arg_2+2<=0 && D<=0 && Arg_2+1<=2*D && 2*D<=2+Arg_2
28:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,-1):|:1<=0 && 0<=D && 2*D<=0 && 0<=1+2*D && E<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
29:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E && Arg_2+2<=0 && F<=0 && 0<=D && 2*D<=Arg_2+1 && Arg_2<=2*D && Arg_2+1<=2*F && 2*F<=2+Arg_2
30:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:0<=Arg_2 && 0<=E && 2*E<=Arg_2+1 && Arg_2<=2*E && Arg_2+2<=0 && F<=0 && D<=0 && Arg_2+1<=2*F && 2*F<=2+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
31:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,-1):|:1<=0 && D<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
32:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && E<=0 && 0<=D && 2*D<=0 && 0<=1+2*D && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
33:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:1<=0 && E<=0 && D<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
34:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,-1):|:1<=0 && D<=0 && 0<=E && 2*E<=0 && 0<=1+2*E && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
35:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:Arg_2+2<=0 && E<=0 && 0<=Arg_2 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && 0<=D && 2*D<=Arg_2+1 && Arg_2<=2*D && Arg_2+1<=2*E && 2*E<=2+Arg_2
36:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:Arg_2+2<=0 && E<=0 && 0<=Arg_2 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && D<=0 && Arg_2+1<=2*E && 2*E<=2+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
37:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,-1):|:1<=0 && D<=0 && E<=0 && Arg_2+1<=0 && 0<=1+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2 && Arg_2+1<=2*E && 2*E<=2+Arg_2
38:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:Arg_2+2<=0 && E<=0 && F<=0 && 0<=Arg_2 && 0<=D && 2*D<=Arg_2+1 && Arg_2<=2*D && Arg_2+1<=2*E && 2*E<=2+Arg_2 && Arg_2+1<=2*F && 2*F<=2+Arg_2
39:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|:Arg_2+2<=0 && E<=0 && F<=0 && D<=0 && Arg_2+1<=2*E && 2*E<=2+Arg_2 && Arg_2+1<=2*F && 2*F<=2+Arg_2 && Arg_2+1<=2*D && 2*D<=2+Arg_2
6:evalrealheapsortstep1bb3in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2):|:1<=Arg_2
5:evalrealheapsortstep1bb3in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2):|:Arg_2<=0
7:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2):|:Arg_2+1<=0 && 0<=1+Arg_2
8:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2):|:0<=Arg_2 && 0<=D && 2*D<=Arg_2+1 && Arg_2<=2*D
9:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2):|:Arg_2+2<=0 && D<=0 && Arg_2+1<=2*D && 2*D<=2+Arg_2
10:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2):|:Arg_2+1<=0 && 0<=1+Arg_2
11:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2):|:0<=Arg_2 && 0<=D && 2*D<=Arg_2+1 && Arg_2<=2*D
12:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2):|:Arg_2+2<=0 && D<=0 && Arg_2+1<=2*D && 2*D<=2+Arg_2
40:evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb6in(Arg_0,Arg_1+1,Arg_2)
3:evalrealheapsortstep1bb6in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,Arg_1):|:1+Arg_1<=Arg_0
4:evalrealheapsortstep1bb6in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1returnin(Arg_0,Arg_1,Arg_2):|:Arg_0<=Arg_1
1:evalrealheapsortstep1entryin(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb6in(Arg_0,1,Arg_2):|:3<=Arg_0
2:evalrealheapsortstep1entryin(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1returnin(Arg_0,Arg_1,Arg_2):|:Arg_0<=2
41:evalrealheapsortstep1returnin(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1stop(Arg_0,Arg_1,Arg_2)
0:evalrealheapsortstep1start(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1entryin(Arg_0,Arg_1,Arg_2)
Preprocessing
Cut unsatisfiable transition 14: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 15: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 16: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 17: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 18: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 19: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 20: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 21: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 22: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 23: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 24: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 25: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 27: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 28: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 29: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 30: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 31: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 32: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 33: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 34: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 35: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 36: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 37: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 38: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 7: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb2in
Cut unsatisfiable transition 9: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb2in
Cut unsatisfiable transition 10: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb5in
Cut unsatisfiable transition 12: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb5in
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 evalrealheapsortstep1bb4in
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 evalrealheapsortstep1bb5in
Found invariant Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 for location evalrealheapsortstep1bb6in
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 evalrealheapsortstep1bb3in
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 evalrealheapsortstep1bb2in
Cut unsatisfiable transition 13: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Cut unsatisfiable transition 39: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in
Problem after Preprocessing
Start: evalrealheapsortstep1start
Program_Vars: Arg_0, Arg_1, Arg_2
Temp_Vars: D, E, F
Locations: evalrealheapsortstep1bb2in, evalrealheapsortstep1bb3in, evalrealheapsortstep1bb4in, evalrealheapsortstep1bb5in, evalrealheapsortstep1bb6in, evalrealheapsortstep1entryin, evalrealheapsortstep1returnin, evalrealheapsortstep1start, evalrealheapsortstep1stop
Transitions:
26:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|: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 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && 0<=D && 2*D<=Arg_2+1 && Arg_2<=2*D
6:evalrealheapsortstep1bb3in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2):|: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:evalrealheapsortstep1bb3in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2):|: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:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2):|: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<=D && 2*D<=Arg_2+1 && Arg_2<=2*D
11:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2):|: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<=D && 2*D<=Arg_2+1 && Arg_2<=2*D
40:evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb6in(Arg_0,Arg_1+1,Arg_2):|: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:evalrealheapsortstep1bb6in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,Arg_1):|:Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && 1+Arg_1<=Arg_0
4:evalrealheapsortstep1bb6in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1returnin(Arg_0,Arg_1,Arg_2):|:Arg_1<=Arg_0 && 1<=Arg_1 && 4<=Arg_0+Arg_1 && 3<=Arg_0 && Arg_0<=Arg_1
1:evalrealheapsortstep1entryin(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb6in(Arg_0,1,Arg_2):|:3<=Arg_0
2:evalrealheapsortstep1entryin(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1returnin(Arg_0,Arg_1,Arg_2):|:Arg_0<=2
41:evalrealheapsortstep1returnin(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1stop(Arg_0,Arg_1,Arg_2)
0:evalrealheapsortstep1start(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1entryin(Arg_0,Arg_1,Arg_2)
MPRF for transition 5:evalrealheapsortstep1bb3in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2):|: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:
evalrealheapsortstep1bb2in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb4in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb5in [Arg_0-Arg_1-1 ]
evalrealheapsortstep1bb6in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb3in [Arg_0-Arg_1 ]
MPRF for transition 11:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2):|: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<=D && 2*D<=Arg_2+1 && Arg_2<=2*D of depth 1:
new bound:
Arg_0+1 {O(n)}
MPRF:
evalrealheapsortstep1bb2in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb4in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb5in [Arg_0-Arg_1-1 ]
evalrealheapsortstep1bb6in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb3in [Arg_0-Arg_1 ]
MPRF for transition 40:evalrealheapsortstep1bb5in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb6in(Arg_0,Arg_1+1,Arg_2):|: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:
evalrealheapsortstep1bb2in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb4in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb5in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb6in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb3in [Arg_0-Arg_1 ]
MPRF for transition 3:evalrealheapsortstep1bb6in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,Arg_1):|: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:
evalrealheapsortstep1bb2in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb4in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb5in [Arg_0-Arg_1 ]
evalrealheapsortstep1bb6in [Arg_0+1-Arg_1 ]
evalrealheapsortstep1bb3in [Arg_0-Arg_1 ]
MPRF for transition 26:evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb3in(Arg_0,Arg_1,D-1):|: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 && 0<=F && 2*F<=Arg_2+1 && Arg_2<=2*F && 0<=D && 2*D<=Arg_2+1 && Arg_2<=2*D of depth 1:
new bound:
2*Arg_0*Arg_0+11*Arg_0+14 {O(n^2)}
MPRF:
evalrealheapsortstep1bb3in [2*Arg_2+1 ]
evalrealheapsortstep1bb2in [2*Arg_2+1 ]
evalrealheapsortstep1bb4in [2*Arg_2+1 ]
evalrealheapsortstep1bb5in [0 ]
evalrealheapsortstep1bb6in [0 ]
MPRF for transition 6:evalrealheapsortstep1bb3in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2):|: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:
evalrealheapsortstep1bb3in [2*Arg_2+1 ]
evalrealheapsortstep1bb2in [Arg_2 ]
evalrealheapsortstep1bb4in [Arg_2 ]
evalrealheapsortstep1bb5in [0 ]
evalrealheapsortstep1bb6in [0 ]
MPRF for transition 8:evalrealheapsortstep1bb4in(Arg_0,Arg_1,Arg_2) -> evalrealheapsortstep1bb2in(Arg_0,Arg_1,Arg_2):|: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<=D && 2*D<=Arg_2+1 && Arg_2<=2*D of depth 1:
new bound:
2*Arg_0*Arg_0+10*Arg_0+12 {O(n^2)}
MPRF:
evalrealheapsortstep1bb3in [2*Arg_2 ]
evalrealheapsortstep1bb2in [Arg_2-1 ]
evalrealheapsortstep1bb4in [Arg_2+1 ]
evalrealheapsortstep1bb5in [0 ]
evalrealheapsortstep1bb6in [0 ]
All Bounds
Timebounds
Overall timebound:6*Arg_0*Arg_0+36*Arg_0+50 {O(n^2)}
26: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in: 2*Arg_0*Arg_0+11*Arg_0+14 {O(n^2)}
5: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb5in: Arg_0+1 {O(n)}
6: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb4in: 2*Arg_0*Arg_0+11*Arg_0+14 {O(n^2)}
8: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb2in: 2*Arg_0*Arg_0+10*Arg_0+12 {O(n^2)}
11: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb5in: Arg_0+1 {O(n)}
40: evalrealheapsortstep1bb5in->evalrealheapsortstep1bb6in: Arg_0+1 {O(n)}
3: evalrealheapsortstep1bb6in->evalrealheapsortstep1bb3in: Arg_0+2 {O(n)}
4: evalrealheapsortstep1bb6in->evalrealheapsortstep1returnin: 1 {O(1)}
1: evalrealheapsortstep1entryin->evalrealheapsortstep1bb6in: 1 {O(1)}
2: evalrealheapsortstep1entryin->evalrealheapsortstep1returnin: 1 {O(1)}
41: evalrealheapsortstep1returnin->evalrealheapsortstep1stop: 1 {O(1)}
0: evalrealheapsortstep1start->evalrealheapsortstep1entryin: 1 {O(1)}
Costbounds
Overall costbound: 6*Arg_0*Arg_0+36*Arg_0+50 {O(n^2)}
26: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in: 2*Arg_0*Arg_0+11*Arg_0+14 {O(n^2)}
5: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb5in: Arg_0+1 {O(n)}
6: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb4in: 2*Arg_0*Arg_0+11*Arg_0+14 {O(n^2)}
8: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb2in: 2*Arg_0*Arg_0+10*Arg_0+12 {O(n^2)}
11: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb5in: Arg_0+1 {O(n)}
40: evalrealheapsortstep1bb5in->evalrealheapsortstep1bb6in: Arg_0+1 {O(n)}
3: evalrealheapsortstep1bb6in->evalrealheapsortstep1bb3in: Arg_0+2 {O(n)}
4: evalrealheapsortstep1bb6in->evalrealheapsortstep1returnin: 1 {O(1)}
1: evalrealheapsortstep1entryin->evalrealheapsortstep1bb6in: 1 {O(1)}
2: evalrealheapsortstep1entryin->evalrealheapsortstep1returnin: 1 {O(1)}
41: evalrealheapsortstep1returnin->evalrealheapsortstep1stop: 1 {O(1)}
0: evalrealheapsortstep1start->evalrealheapsortstep1entryin: 1 {O(1)}
Sizebounds
26: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in, Arg_0: Arg_0 {O(n)}
26: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in, Arg_1: Arg_0+2 {O(n)}
26: evalrealheapsortstep1bb2in->evalrealheapsortstep1bb3in, Arg_2: Arg_0+3 {O(n)}
5: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb5in, Arg_0: Arg_0 {O(n)}
5: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb5in, Arg_1: Arg_0+2 {O(n)}
5: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb5in, Arg_2: 0 {O(1)}
6: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb4in, Arg_0: Arg_0 {O(n)}
6: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb4in, Arg_1: Arg_0+2 {O(n)}
6: evalrealheapsortstep1bb3in->evalrealheapsortstep1bb4in, Arg_2: Arg_0+3 {O(n)}
8: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb2in, Arg_0: Arg_0 {O(n)}
8: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb2in, Arg_1: Arg_0+2 {O(n)}
8: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb2in, Arg_2: Arg_0+3 {O(n)}
11: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb5in, Arg_0: Arg_0 {O(n)}
11: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb5in, Arg_1: Arg_0+2 {O(n)}
11: evalrealheapsortstep1bb4in->evalrealheapsortstep1bb5in, Arg_2: Arg_0+3 {O(n)}
40: evalrealheapsortstep1bb5in->evalrealheapsortstep1bb6in, Arg_0: Arg_0 {O(n)}
40: evalrealheapsortstep1bb5in->evalrealheapsortstep1bb6in, Arg_1: Arg_0+2 {O(n)}
40: evalrealheapsortstep1bb5in->evalrealheapsortstep1bb6in, Arg_2: Arg_0+3 {O(n)}
3: evalrealheapsortstep1bb6in->evalrealheapsortstep1bb3in, Arg_0: Arg_0 {O(n)}
3: evalrealheapsortstep1bb6in->evalrealheapsortstep1bb3in, Arg_1: Arg_0+2 {O(n)}
3: evalrealheapsortstep1bb6in->evalrealheapsortstep1bb3in, Arg_2: Arg_0+3 {O(n)}
4: evalrealheapsortstep1bb6in->evalrealheapsortstep1returnin, Arg_0: Arg_0 {O(n)}
4: evalrealheapsortstep1bb6in->evalrealheapsortstep1returnin, Arg_1: Arg_0+2 {O(n)}
4: evalrealheapsortstep1bb6in->evalrealheapsortstep1returnin, Arg_2: Arg_0+3 {O(n)}
1: evalrealheapsortstep1entryin->evalrealheapsortstep1bb6in, Arg_0: Arg_0 {O(n)}
1: evalrealheapsortstep1entryin->evalrealheapsortstep1bb6in, Arg_1: 1 {O(1)}
1: evalrealheapsortstep1entryin->evalrealheapsortstep1bb6in, Arg_2: Arg_2 {O(n)}
2: evalrealheapsortstep1entryin->evalrealheapsortstep1returnin, Arg_0: Arg_0 {O(n)}
2: evalrealheapsortstep1entryin->evalrealheapsortstep1returnin, Arg_1: Arg_1 {O(n)}
2: evalrealheapsortstep1entryin->evalrealheapsortstep1returnin, Arg_2: Arg_2 {O(n)}
41: evalrealheapsortstep1returnin->evalrealheapsortstep1stop, Arg_0: 2*Arg_0 {O(n)}
41: evalrealheapsortstep1returnin->evalrealheapsortstep1stop, Arg_1: Arg_0+Arg_1+2 {O(n)}
41: evalrealheapsortstep1returnin->evalrealheapsortstep1stop, Arg_2: Arg_0+Arg_2+3 {O(n)}
0: evalrealheapsortstep1start->evalrealheapsortstep1entryin, Arg_0: Arg_0 {O(n)}
0: evalrealheapsortstep1start->evalrealheapsortstep1entryin, Arg_1: Arg_1 {O(n)}
0: evalrealheapsortstep1start->evalrealheapsortstep1entryin, Arg_2: Arg_2 {O(n)}