YES * Step 1: TrivialSCCs YES + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (?,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (?,1) 3. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (?,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [-1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && A >= 1 + B] (?,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 1] 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && 0 >= C] 7. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -4 + A + C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -4 + A + C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] 9. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) [B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0] (?,1) 10. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [-1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && B >= A] (?,1) 11. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -4 + A + C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 0 && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 12. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) [-3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0] (?,1) 13. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && 1 + B >= A] (?,1) 14. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A >= 2 + B] (?,1) 15. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) [-2 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] (?,1) 16. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [C >= 0 && B + C >= 0 && -3 + A + C >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && 2 + B + 2*C >= A] (?,1) 17. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [C >= 0 && B + C >= 0 && -3 + A + C >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A >= 3 + B + 2*C] (?,1) 18. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) [C >= 0 && B + C >= 0 && -3 + A + C >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] (?,1) 19. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [-3 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A >= 4 + B + 2*C] 20. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [-3 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A = 3 + B + 2*C] 21. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) [-4 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -4 + A + C >= 0 && -4 + A + -1*B >= 0 && B >= 0 && -4 + A + B >= 0 && -4 + A >= 0] 22. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [-4 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -4 + A + C >= 0 && -4 + A + -1*B >= 0 && B >= 0 && -4 + A + B >= 0 && -4 + A >= 0] 23. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) [-3 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] 24. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) [-1 + D >= 0 (?,1) && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -4 + A + D >= 0 && -3 + A + -1*C >= 0 && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] 25. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) [-1 + D >= 0 (?,1) && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -4 + A + D >= 0 && -3 + A + -1*C >= 0 && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] 26. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) [-4 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -4 + A + C >= 0 && -4 + A + -1*B >= 0 && B >= 0 && -4 + A + B >= 0 && -4 + A >= 0] 27. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) [-1 + D >= 0 (?,1) && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -4 + A + D >= 0 && -3 + A + -1*C >= 0 && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4)} Flow Graph: [0->{1,2},1->{3},2->{4,10},3->{},4->{5,6},5->{7,8},6->{9},7->{9},8->{11},9->{4,10},10->{12},11->{5,6} ,12->{13,14},13->{3},14->{15},15->{16,17},16->{18},17->{19,20},18->{13,14},19->{21,22},20->{23},21->{26} ,22->{23},23->{24,25},24->{16,17},25->{27},26->{24,25},27->{16,17}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths YES + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (1,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (1,1) 3. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (1,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [-1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && A >= 1 + B] (?,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 1] 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && 0 >= C] 7. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -4 + A + C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -4 + A + C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] 9. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) [B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0] (?,1) 10. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [-1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && B >= A] (1,1) 11. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -4 + A + C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 0 && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 12. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) [-3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0] (1,1) 13. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && 1 + B >= A] (1,1) 14. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A >= 2 + B] (?,1) 15. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) [-2 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] (?,1) 16. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [C >= 0 && B + C >= 0 && -3 + A + C >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && 2 + B + 2*C >= A] (?,1) 17. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [C >= 0 && B + C >= 0 && -3 + A + C >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A >= 3 + B + 2*C] (?,1) 18. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) [C >= 0 && B + C >= 0 && -3 + A + C >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] (?,1) 19. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [-3 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A >= 4 + B + 2*C] 20. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [-3 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A = 3 + B + 2*C] 21. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) [-4 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -4 + A + C >= 0 && -4 + A + -1*B >= 0 && B >= 0 && -4 + A + B >= 0 && -4 + A >= 0] 22. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [-4 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -4 + A + C >= 0 && -4 + A + -1*B >= 0 && B >= 0 && -4 + A + B >= 0 && -4 + A >= 0] 23. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) [-3 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] 24. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) [-1 + D >= 0 (?,1) && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -4 + A + D >= 0 && -3 + A + -1*C >= 0 && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] 25. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) [-1 + D >= 0 (?,1) && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -4 + A + D >= 0 && -3 + A + -1*C >= 0 && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] 26. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) [-4 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -4 + A + C >= 0 && -4 + A + -1*B >= 0 && B >= 0 && -4 + A + B >= 0 && -4 + A >= 0] 27. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) [-1 + D >= 0 (?,1) && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -4 + A + D >= 0 && -3 + A + -1*C >= 0 && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4)} Flow Graph: [0->{1,2},1->{3},2->{4,10},3->{},4->{5,6},5->{7,8},6->{9},7->{9},8->{11},9->{4,10},10->{12},11->{5,6} ,12->{13,14},13->{3},14->{15},15->{16,17},16->{18},17->{19,20},18->{13,14},19->{21,22},20->{23},21->{26} ,22->{23},23->{24,25},24->{16,17},25->{27},26->{24,25},27->{16,17}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,10),(4,6),(12,13),(24,17)] * Step 3: Looptree YES + Considered Problem: Rules: 0. evalrealheapsortstart(A,B,C,D) -> evalrealheapsortentryin(A,B,C,D) True (1,1) 1. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [2 >= A] (1,1) 2. evalrealheapsortentryin(A,B,C,D) -> evalrealheapsortbb6in(A,1,C,D) [A >= 3] (1,1) 3. evalrealheapsortreturnin(A,B,C,D) -> evalrealheapsortstop(A,B,C,D) True (1,1) 4. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb3in(A,B,B,D) [-1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && A >= 1 + B] (?,1) 5. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb4in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 1] 6. evalrealheapsortbb3in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && 0 >= C] 7. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb5in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -4 + A + C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] 8. evalrealheapsortbb4in(A,B,C,D) -> evalrealheapsortbb2in(A,B,C,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -4 + A + C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 0 && E >= 0 && 1 + C >= 2*E && 2*E >= C] 9. evalrealheapsortbb5in(A,B,C,D) -> evalrealheapsortbb6in(A,1 + B,C,D) [B + -1*C >= 0 && -1 + A + -1*C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0] (?,1) 10. evalrealheapsortbb6in(A,B,C,D) -> evalrealheapsortbb7in(A,B,C,D) [-1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && B >= A] (1,1) 11. evalrealheapsortbb2in(A,B,C,D) -> evalrealheapsortbb3in(A,B,-1 + E,D) [B + -1*C >= 0 (?,1) && -1 + A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -4 + A + C >= 0 && -1 + A + -1*B >= 0 && -1 + B >= 0 && -4 + A + B >= 0 && -3 + A >= 0 && C >= 0 && F >= 0 && 1 + C >= 2*F && 2*F >= C && G >= 0 && 1 + C >= 2*G && 2*G >= C && E >= 0 && 1 + C >= 2*E && 2*E >= C] 12. evalrealheapsortbb7in(A,B,C,D) -> evalrealheapsortbb18in(A,0,C,D) [-3 + B >= 0 && -6 + A + B >= 0 && -1*A + B >= 0 && -3 + A >= 0] (1,1) 13. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortreturnin(A,B,C,D) [B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && 1 + B >= A] (1,1) 14. evalrealheapsortbb18in(A,B,C,D) -> evalrealheapsortbb8in(A,B,C,D) [B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A >= 2 + B] (?,1) 15. evalrealheapsortbb8in(A,B,C,D) -> evalrealheapsortbb16in(A,B,0,D) [-2 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] (?,1) 16. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb17in(A,B,C,D) [C >= 0 && B + C >= 0 && -3 + A + C >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && 2 + B + 2*C >= A] (?,1) 17. evalrealheapsortbb16in(A,B,C,D) -> evalrealheapsortbb9in(A,B,C,D) [C >= 0 && B + C >= 0 && -3 + A + C >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A >= 3 + B + 2*C] (?,1) 18. evalrealheapsortbb17in(A,B,C,D) -> evalrealheapsortbb18in(A,1 + B,C,D) [C >= 0 && B + C >= 0 && -3 + A + C >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] (?,1) 19. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb10in(A,B,C,D) [-3 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A >= 4 + B + 2*C] 20. evalrealheapsortbb9in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [-3 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0 && A = 3 + B + 2*C] 21. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb12in(A,B,C,D) [-4 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -4 + A + C >= 0 && -4 + A + -1*B >= 0 && B >= 0 && -4 + A + B >= 0 && -4 + A >= 0] 22. evalrealheapsortbb10in(A,B,C,D) -> evalrealheapsortbb11in(A,B,C,D) [-4 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -4 + A + C >= 0 && -4 + A + -1*B >= 0 && B >= 0 && -4 + A + B >= 0 && -4 + A >= 0] 23. evalrealheapsortbb11in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,1 + 2*C) [-3 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] 24. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb16in(A,B,A,D) [-1 + D >= 0 (?,1) && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -4 + A + D >= 0 && -3 + A + -1*C >= 0 && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] 25. evalrealheapsortbb13in(A,B,C,D) -> evalrealheapsortbb14in(A,B,C,D) [-1 + D >= 0 (?,1) && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -4 + A + D >= 0 && -3 + A + -1*C >= 0 && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] 26. evalrealheapsortbb12in(A,B,C,D) -> evalrealheapsortbb13in(A,B,C,2 + 2*C) [-4 + A + -1*C >= 0 (?,1) && C >= 0 && B + C >= 0 && -4 + A + C >= 0 && -4 + A + -1*B >= 0 && B >= 0 && -4 + A + B >= 0 && -4 + A >= 0] 27. evalrealheapsortbb14in(A,B,C,D) -> evalrealheapsortbb16in(A,B,D,D) [-1 + D >= 0 (?,1) && -1 + C + D >= 0 && -1 + -1*C + D >= 0 && -1 + B + D >= 0 && -4 + A + D >= 0 && -3 + A + -1*C >= 0 && C >= 0 && B + C >= 0 && -3 + A + C >= 0 && -3 + A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && -3 + A >= 0] Signature: {(evalrealheapsortbb10in,4) ;(evalrealheapsortbb11in,4) ;(evalrealheapsortbb12in,4) ;(evalrealheapsortbb13in,4) ;(evalrealheapsortbb14in,4) ;(evalrealheapsortbb16in,4) ;(evalrealheapsortbb17in,4) ;(evalrealheapsortbb18in,4) ;(evalrealheapsortbb2in,4) ;(evalrealheapsortbb3in,4) ;(evalrealheapsortbb4in,4) ;(evalrealheapsortbb5in,4) ;(evalrealheapsortbb6in,4) ;(evalrealheapsortbb7in,4) ;(evalrealheapsortbb8in,4) ;(evalrealheapsortbb9in,4) ;(evalrealheapsortentryin,4) ;(evalrealheapsortreturnin,4) ;(evalrealheapsortstart,4) ;(evalrealheapsortstop,4)} Flow Graph: [0->{1,2},1->{3},2->{4},3->{},4->{5},5->{7,8},6->{9},7->{9},8->{11},9->{4,10},10->{12},11->{5,6},12->{14} ,13->{3},14->{15},15->{16,17},16->{18},17->{19,20},18->{13,14},19->{21,22},20->{23},21->{26},22->{23} ,23->{24,25},24->{16},25->{27},26->{24,25},27->{16,17}] + Applied Processor: Looptree + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27] | +- p:[4,9,6,11,8,5,7] c: [9] | | | `- p:[5,11,8] c: [11] | `- p:[14,18,16,15,24,23,20,17,27,25,26,21,19,22] c: [15] | `- p:[17,27,25,23,20,22,19,26,21] c: [27] YES