Start: evalrealheapsortstep2start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: evalrealheapsortstep2bb10in, evalrealheapsortstep2bb11in, evalrealheapsortstep2bb1in, evalrealheapsortstep2bb2in, evalrealheapsortstep2bb3in, evalrealheapsortstep2bb4in, evalrealheapsortstep2bb5in, evalrealheapsortstep2bb6in, evalrealheapsortstep2bb7in, evalrealheapsortstep2bb9in, evalrealheapsortstep2bbin, evalrealheapsortstep2entryin, evalrealheapsortstep2returnin, evalrealheapsortstep2start, evalrealheapsortstep2stop
Transitions:
19:evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb11in(Arg_0,Arg_1+1,Arg_2,Arg_3)
4:evalrealheapsortstep2bb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:2+Arg_1<=Arg_0
5:evalrealheapsortstep2bb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=Arg_1+1
6:evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,0,Arg_3)
10:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1+4+2*Arg_2<=Arg_0
11:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2*Arg_2+2+Arg_1
9:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2*Arg_2+3+Arg_1 && 2*Arg_2+3+Arg_1<=Arg_0
12:evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3)
13:evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb5in(Arg_0,Arg_1,Arg_2,Arg_3)
14:evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,2*Arg_2+1)
15:evalrealheapsortstep2bb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,2*Arg_2+2)
16:evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb7in(Arg_0,Arg_1,Arg_2,Arg_3)
17:evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_0,Arg_3)
18:evalrealheapsortstep2bb7in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_3,Arg_3)
8:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2*Arg_2+2+Arg_1
7:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_1+3+2*Arg_2<=Arg_0
3:evalrealheapsortstep2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb11in(Arg_0,0,Arg_2,Arg_3)
1:evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:3<=Arg_0
2:evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2
20:evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2stop(Arg_0,Arg_1,Arg_2,Arg_3)
0:evalrealheapsortstep2start(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3)
Cut unsatisfiable transition 11: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in
Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb5in
Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb2in
Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb7in
Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb6in
Found invariant 3<=Arg_0 for location evalrealheapsortstep2bbin
Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb4in
Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb3in
Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb10in
Found invariant 2+Arg_1<=Arg_0 && 0<=Arg_1 && 2<=Arg_0+Arg_1 && 2<=Arg_0 for location evalrealheapsortstep2bb1in
Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb9in
Found invariant 0<=Arg_1 for location evalrealheapsortstep2bb11in
Start: evalrealheapsortstep2start
Program_Vars: Arg_0, Arg_1, Arg_2, Arg_3
Temp_Vars:
Locations: evalrealheapsortstep2bb10in, evalrealheapsortstep2bb11in, evalrealheapsortstep2bb1in, evalrealheapsortstep2bb2in, evalrealheapsortstep2bb3in, evalrealheapsortstep2bb4in, evalrealheapsortstep2bb5in, evalrealheapsortstep2bb6in, evalrealheapsortstep2bb7in, evalrealheapsortstep2bb9in, evalrealheapsortstep2bbin, evalrealheapsortstep2entryin, evalrealheapsortstep2returnin, evalrealheapsortstep2start, evalrealheapsortstep2stop
Transitions:
19:evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb11in(Arg_0,Arg_1+1,Arg_2,Arg_3):|:0<=Arg_1
4:evalrealheapsortstep2bb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && 2+Arg_1<=Arg_0
5:evalrealheapsortstep2bb11in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_0<=Arg_1+1
6:evalrealheapsortstep2bb1in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,0,Arg_3):|:2+Arg_1<=Arg_0 && 0<=Arg_1 && 2<=Arg_0+Arg_1 && 2<=Arg_0
10:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_1+4+2*Arg_2<=Arg_0
9:evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_0<=2*Arg_2+3+Arg_1 && 2*Arg_2+3+Arg_1<=Arg_0
12:evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1
13:evalrealheapsortstep2bb3in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb5in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1
14:evalrealheapsortstep2bb4in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,2*Arg_2+1):|:0<=Arg_1
15:evalrealheapsortstep2bb5in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,2*Arg_2+2):|:0<=Arg_1
16:evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb7in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1
17:evalrealheapsortstep2bb6in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_0,Arg_3):|:0<=Arg_1
18:evalrealheapsortstep2bb7in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_3,Arg_3):|:0<=Arg_1
8:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb10in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_0<=2*Arg_2+2+Arg_1
7:evalrealheapsortstep2bb9in(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb2in(Arg_0,Arg_1,Arg_2,Arg_3):|:0<=Arg_1 && Arg_1+3+2*Arg_2<=Arg_0
3:evalrealheapsortstep2bbin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bb11in(Arg_0,0,Arg_2,Arg_3):|:3<=Arg_0
1:evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2bbin(Arg_0,Arg_1,Arg_2,Arg_3):|:3<=Arg_0
2:evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3):|:Arg_0<=2
20:evalrealheapsortstep2returnin(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2stop(Arg_0,Arg_1,Arg_2,Arg_3)
0:evalrealheapsortstep2start(Arg_0,Arg_1,Arg_2,Arg_3) -> evalrealheapsortstep2entryin(Arg_0,Arg_1,Arg_2,Arg_3)
new bound:
Arg_0+1 {O(n)}
MPRF:
evalrealheapsortstep2bb11in [Arg_0+1-Arg_1 ]
evalrealheapsortstep2bb1in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb3in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb4in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb5in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb6in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb7in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb2in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb9in [Arg_0-Arg_1 ]
evalrealheapsortstep2bb10in [Arg_0-Arg_1 ]
new bound:
Arg_0+1 {O(n)}
MPRF:
evalrealheapsortstep2bb11in [Arg_0-Arg_1-1 ]
evalrealheapsortstep2bb1in [Arg_0-Arg_1-1 ]
evalrealheapsortstep2bb3in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb4in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb5in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb6in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb7in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb2in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb9in [Arg_0-Arg_1-2 ]
evalrealheapsortstep2bb10in [Arg_0-Arg_1-2 ]
new bound:
Arg_0+1 {O(n)}
MPRF:
evalrealheapsortstep2bb11in [0 ]
evalrealheapsortstep2bb1in [Arg_1+2-Arg_0 ]
evalrealheapsortstep2bb3in [1 ]
evalrealheapsortstep2bb4in [1 ]
evalrealheapsortstep2bb5in [1 ]
evalrealheapsortstep2bb6in [1 ]
evalrealheapsortstep2bb7in [1 ]
evalrealheapsortstep2bb2in [1 ]
evalrealheapsortstep2bb9in [1 ]
evalrealheapsortstep2bb10in [1 ]
new bound:
Arg_0+1 {O(n)}
MPRF:
evalrealheapsortstep2bb11in [0 ]
evalrealheapsortstep2bb1in [0 ]
evalrealheapsortstep2bb3in [1 ]
evalrealheapsortstep2bb4in [1 ]
evalrealheapsortstep2bb5in [1 ]
evalrealheapsortstep2bb6in [1 ]
evalrealheapsortstep2bb7in [1 ]
evalrealheapsortstep2bb2in [1 ]
evalrealheapsortstep2bb9in [1 ]
evalrealheapsortstep2bb10in [0 ]
Overall timebound:inf {Infinity}
19: evalrealheapsortstep2bb10in->evalrealheapsortstep2bb11in: Arg_0+1 {O(n)}
4: evalrealheapsortstep2bb11in->evalrealheapsortstep2bb1in: Arg_0+1 {O(n)}
5: evalrealheapsortstep2bb11in->evalrealheapsortstep2returnin: 1 {O(1)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in: Arg_0+1 {O(n)}
9: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb4in: inf {Infinity}
10: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in: inf {Infinity}
12: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb4in: inf {Infinity}
13: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb5in: inf {Infinity}
14: evalrealheapsortstep2bb4in->evalrealheapsortstep2bb6in: inf {Infinity}
15: evalrealheapsortstep2bb5in->evalrealheapsortstep2bb6in: inf {Infinity}
16: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb7in: inf {Infinity}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in: inf {Infinity}
18: evalrealheapsortstep2bb7in->evalrealheapsortstep2bb9in: inf {Infinity}
7: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb2in: inf {Infinity}
8: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb10in: Arg_0+1 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in: 1 {O(1)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin: 1 {O(1)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin: 1 {O(1)}
20: evalrealheapsortstep2returnin->evalrealheapsortstep2stop: 1 {O(1)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin: 1 {O(1)}
Overall costbound: inf {Infinity}
19: evalrealheapsortstep2bb10in->evalrealheapsortstep2bb11in: Arg_0+1 {O(n)}
4: evalrealheapsortstep2bb11in->evalrealheapsortstep2bb1in: Arg_0+1 {O(n)}
5: evalrealheapsortstep2bb11in->evalrealheapsortstep2returnin: 1 {O(1)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in: Arg_0+1 {O(n)}
9: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb4in: inf {Infinity}
10: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in: inf {Infinity}
12: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb4in: inf {Infinity}
13: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb5in: inf {Infinity}
14: evalrealheapsortstep2bb4in->evalrealheapsortstep2bb6in: inf {Infinity}
15: evalrealheapsortstep2bb5in->evalrealheapsortstep2bb6in: inf {Infinity}
16: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb7in: inf {Infinity}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in: inf {Infinity}
18: evalrealheapsortstep2bb7in->evalrealheapsortstep2bb9in: inf {Infinity}
7: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb2in: inf {Infinity}
8: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb10in: Arg_0+1 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in: 1 {O(1)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin: 1 {O(1)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin: 1 {O(1)}
20: evalrealheapsortstep2returnin->evalrealheapsortstep2stop: 1 {O(1)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin: 1 {O(1)}
19: evalrealheapsortstep2bb10in->evalrealheapsortstep2bb11in, Arg_0: Arg_0 {O(n)}
19: evalrealheapsortstep2bb10in->evalrealheapsortstep2bb11in, Arg_1: Arg_0+1 {O(n)}
4: evalrealheapsortstep2bb11in->evalrealheapsortstep2bb1in, Arg_0: Arg_0 {O(n)}
4: evalrealheapsortstep2bb11in->evalrealheapsortstep2bb1in, Arg_1: Arg_0+1 {O(n)}
5: evalrealheapsortstep2bb11in->evalrealheapsortstep2returnin, Arg_0: Arg_0 {O(n)}
5: evalrealheapsortstep2bb11in->evalrealheapsortstep2returnin, Arg_1: Arg_0+1 {O(n)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in, Arg_0: Arg_0 {O(n)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in, Arg_1: Arg_0+1 {O(n)}
6: evalrealheapsortstep2bb1in->evalrealheapsortstep2bb9in, Arg_2: 0 {O(1)}
9: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb4in, Arg_0: Arg_0 {O(n)}
9: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb4in, Arg_1: Arg_0+1 {O(n)}
10: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in, Arg_0: Arg_0 {O(n)}
10: evalrealheapsortstep2bb2in->evalrealheapsortstep2bb3in, Arg_1: Arg_0+1 {O(n)}
12: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb4in, Arg_0: Arg_0 {O(n)}
12: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb4in, Arg_1: Arg_0+1 {O(n)}
13: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb5in, Arg_0: Arg_0 {O(n)}
13: evalrealheapsortstep2bb3in->evalrealheapsortstep2bb5in, Arg_1: Arg_0+1 {O(n)}
14: evalrealheapsortstep2bb4in->evalrealheapsortstep2bb6in, Arg_0: Arg_0 {O(n)}
14: evalrealheapsortstep2bb4in->evalrealheapsortstep2bb6in, Arg_1: Arg_0+1 {O(n)}
15: evalrealheapsortstep2bb5in->evalrealheapsortstep2bb6in, Arg_0: Arg_0 {O(n)}
15: evalrealheapsortstep2bb5in->evalrealheapsortstep2bb6in, Arg_1: Arg_0+1 {O(n)}
16: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb7in, Arg_0: Arg_0 {O(n)}
16: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb7in, Arg_1: Arg_0+1 {O(n)}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in, Arg_0: Arg_0 {O(n)}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in, Arg_1: Arg_0+1 {O(n)}
17: evalrealheapsortstep2bb6in->evalrealheapsortstep2bb9in, Arg_2: 2*Arg_0 {O(n)}
18: evalrealheapsortstep2bb7in->evalrealheapsortstep2bb9in, Arg_0: Arg_0 {O(n)}
18: evalrealheapsortstep2bb7in->evalrealheapsortstep2bb9in, Arg_1: Arg_0+1 {O(n)}
7: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb2in, Arg_0: Arg_0 {O(n)}
7: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb2in, Arg_1: Arg_0+1 {O(n)}
8: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb10in, Arg_0: Arg_0 {O(n)}
8: evalrealheapsortstep2bb9in->evalrealheapsortstep2bb10in, Arg_1: Arg_0+1 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in, Arg_0: Arg_0 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in, Arg_1: 0 {O(1)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in, Arg_2: Arg_2 {O(n)}
3: evalrealheapsortstep2bbin->evalrealheapsortstep2bb11in, Arg_3: Arg_3 {O(n)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin, Arg_0: Arg_0 {O(n)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin, Arg_1: Arg_1 {O(n)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin, Arg_2: Arg_2 {O(n)}
1: evalrealheapsortstep2entryin->evalrealheapsortstep2bbin, Arg_3: Arg_3 {O(n)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin, Arg_0: Arg_0 {O(n)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin, Arg_1: Arg_1 {O(n)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin, Arg_2: Arg_2 {O(n)}
2: evalrealheapsortstep2entryin->evalrealheapsortstep2returnin, Arg_3: Arg_3 {O(n)}
20: evalrealheapsortstep2returnin->evalrealheapsortstep2stop, Arg_0: 2*Arg_0 {O(n)}
20: evalrealheapsortstep2returnin->evalrealheapsortstep2stop, Arg_1: Arg_0+Arg_1+1 {O(n)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin, Arg_0: Arg_0 {O(n)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin, Arg_1: Arg_1 {O(n)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin, Arg_2: Arg_2 {O(n)}
0: evalrealheapsortstep2start->evalrealheapsortstep2entryin, Arg_3: Arg_3 {O(n)}