YES(?,POLY) * Step 1: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalrealselectstart(A,B,C) -> evalrealselectentryin(A,B,C) True (1,1) 1. evalrealselectentryin(A,B,C) -> evalrealselectbb6in(0,B,C) True (?,1) 2. evalrealselectbb6in(A,B,C) -> evalrealselectbbin(A,B,C) [A >= 0 && B >= 2 + A] (?,1) 3. evalrealselectbb6in(A,B,C) -> evalrealselectreturnin(A,B,C) [A >= 0 && 1 + A >= B] (?,1) 4. evalrealselectbbin(A,B,C) -> evalrealselectbb4in(A,B,1 + A) [-2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalrealselectbb4in(A,B,C) -> evalrealselectbb1in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] 6. evalrealselectbb4in(A,B,C) -> evalrealselectbb5in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && C >= B] 7. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] 8. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] 9. evalrealselectbb5in(A,B,C) -> evalrealselectbb6in(1 + A,B,C) [-2 + C >= 0 (?,1) && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalrealselectreturnin(A,B,C) -> evalrealselectstop(A,B,C) [1 + A + -1*B >= 0 && A >= 0] (?,1) Signature: {(evalrealselectbb1in,3) ;(evalrealselectbb4in,3) ;(evalrealselectbb5in,3) ;(evalrealselectbb6in,3) ;(evalrealselectbbin,3) ;(evalrealselectentryin,3) ;(evalrealselectreturnin,3) ;(evalrealselectstart,3) ;(evalrealselectstop,3)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{10},4->{5,6},5->{7,8},6->{9},7->{5,6},8->{5,6},9->{2,3},10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,6)] * Step 2: FromIts WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalrealselectstart(A,B,C) -> evalrealselectentryin(A,B,C) True (1,1) 1. evalrealselectentryin(A,B,C) -> evalrealselectbb6in(0,B,C) True (?,1) 2. evalrealselectbb6in(A,B,C) -> evalrealselectbbin(A,B,C) [A >= 0 && B >= 2 + A] (?,1) 3. evalrealselectbb6in(A,B,C) -> evalrealselectreturnin(A,B,C) [A >= 0 && 1 + A >= B] (?,1) 4. evalrealselectbbin(A,B,C) -> evalrealselectbb4in(A,B,1 + A) [-2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] (?,1) 5. evalrealselectbb4in(A,B,C) -> evalrealselectbb1in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] 6. evalrealselectbb4in(A,B,C) -> evalrealselectbb5in(A,B,C) [-1 + C >= 0 (?,1) && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && C >= B] 7. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] 8. evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 (?,1) && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] 9. evalrealselectbb5in(A,B,C) -> evalrealselectbb6in(1 + A,B,C) [-2 + C >= 0 (?,1) && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] 10. evalrealselectreturnin(A,B,C) -> evalrealselectstop(A,B,C) [1 + A + -1*B >= 0 && A >= 0] (?,1) Signature: {(evalrealselectbb1in,3) ;(evalrealselectbb4in,3) ;(evalrealselectbb5in,3) ;(evalrealselectbb6in,3) ;(evalrealselectbbin,3) ;(evalrealselectentryin,3) ;(evalrealselectreturnin,3) ;(evalrealselectstart,3) ;(evalrealselectstop,3)} Flow Graph: [0->{1},1->{2,3},2->{4},3->{10},4->{5},5->{7,8},6->{9},7->{5,6},8->{5,6},9->{2,3},10->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold WORST_CASE(?,POLY) + Considered Problem: Rules: evalrealselectstart(A,B,C) -> evalrealselectentryin(A,B,C) True evalrealselectentryin(A,B,C) -> evalrealselectbb6in(0,B,C) True evalrealselectbb6in(A,B,C) -> evalrealselectbbin(A,B,C) [A >= 0 && B >= 2 + A] evalrealselectbb6in(A,B,C) -> evalrealselectreturnin(A,B,C) [A >= 0 && 1 + A >= B] evalrealselectbbin(A,B,C) -> evalrealselectbb4in(A,B,1 + A) [-2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectbb4in(A,B,C) -> evalrealselectbb1in(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] evalrealselectbb4in(A,B,C) -> evalrealselectbb5in(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && C >= B] evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] evalrealselectbb1in(A,B,C) -> evalrealselectbb4in(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] evalrealselectbb5in(A,B,C) -> evalrealselectbb6in(1 + A,B,C) [-2 + C >= 0 && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectreturnin(A,B,C) -> evalrealselectstop(A,B,C) [1 + A + -1*B >= 0 && A >= 0] Signature: {(evalrealselectbb1in,3) ;(evalrealselectbb4in,3) ;(evalrealselectbb5in,3) ;(evalrealselectbb6in,3) ;(evalrealselectbbin,3) ;(evalrealselectentryin,3) ;(evalrealselectreturnin,3) ;(evalrealselectstart,3) ;(evalrealselectstop,3)} Rule Graph: [0->{1},1->{2,3},2->{4},3->{10},4->{5},5->{7,8},6->{9},7->{5,6},8->{5,6},9->{2,3},10->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: evalrealselectstart.0(A,B,C) -> evalrealselectentryin.1(A,B,C) True evalrealselectentryin.1(A,B,C) -> evalrealselectbb6in.2(0,B,C) True evalrealselectentryin.1(A,B,C) -> evalrealselectbb6in.3(0,B,C) True evalrealselectbb6in.2(A,B,C) -> evalrealselectbbin.4(A,B,C) [A >= 0 && B >= 2 + A] evalrealselectbb6in.3(A,B,C) -> evalrealselectreturnin.10(A,B,C) [A >= 0 && 1 + A >= B] evalrealselectbbin.4(A,B,C) -> evalrealselectbb4in.5(A,B,1 + A) [-2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectbb4in.5(A,B,C) -> evalrealselectbb1in.7(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] evalrealselectbb4in.5(A,B,C) -> evalrealselectbb1in.8(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] evalrealselectbb4in.6(A,B,C) -> evalrealselectbb5in.9(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && C >= B] evalrealselectbb1in.7(A,B,C) -> evalrealselectbb4in.5(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] evalrealselectbb1in.7(A,B,C) -> evalrealselectbb4in.6(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] evalrealselectbb1in.8(A,B,C) -> evalrealselectbb4in.5(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] evalrealselectbb1in.8(A,B,C) -> evalrealselectbb4in.6(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] evalrealselectbb5in.9(A,B,C) -> evalrealselectbb6in.2(1 + A,B,C) [-2 + C >= 0 && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectbb5in.9(A,B,C) -> evalrealselectbb6in.3(1 + A,B,C) [-2 + C >= 0 && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectreturnin.10(A,B,C) -> evalrealselectstop.11(A,B,C) [1 + A + -1*B >= 0 && A >= 0] Signature: {(evalrealselectbb1in.7,3) ;(evalrealselectbb1in.8,3) ;(evalrealselectbb4in.5,3) ;(evalrealselectbb4in.6,3) ;(evalrealselectbb5in.9,3) ;(evalrealselectbb6in.2,3) ;(evalrealselectbb6in.3,3) ;(evalrealselectbbin.4,3) ;(evalrealselectentryin.1,3) ;(evalrealselectreturnin.10,3) ;(evalrealselectstart.0,3) ;(evalrealselectstop.11,3)} Rule Graph: [0->{1,2},1->{3},2->{4},3->{5},4->{15},5->{6,7},6->{9,10},7->{11,12},8->{13,14},9->{6,7},10->{8},11->{6,7} ,12->{8},13->{3},14->{4},15->{}] + Applied Processor: AddSinks + Details: () * Step 5: Decompose WORST_CASE(?,POLY) + Considered Problem: Rules: evalrealselectstart.0(A,B,C) -> evalrealselectentryin.1(A,B,C) True evalrealselectentryin.1(A,B,C) -> evalrealselectbb6in.2(0,B,C) True evalrealselectentryin.1(A,B,C) -> evalrealselectbb6in.3(0,B,C) True evalrealselectbb6in.2(A,B,C) -> evalrealselectbbin.4(A,B,C) [A >= 0 && B >= 2 + A] evalrealselectbb6in.3(A,B,C) -> evalrealselectreturnin.10(A,B,C) [A >= 0 && 1 + A >= B] evalrealselectbbin.4(A,B,C) -> evalrealselectbb4in.5(A,B,1 + A) [-2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectbb4in.5(A,B,C) -> evalrealselectbb1in.7(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] evalrealselectbb4in.5(A,B,C) -> evalrealselectbb1in.8(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] evalrealselectbb4in.6(A,B,C) -> evalrealselectbb5in.9(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && C >= B] evalrealselectbb1in.7(A,B,C) -> evalrealselectbb4in.5(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] evalrealselectbb1in.7(A,B,C) -> evalrealselectbb4in.6(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] evalrealselectbb1in.8(A,B,C) -> evalrealselectbb4in.5(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] evalrealselectbb1in.8(A,B,C) -> evalrealselectbb4in.6(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] evalrealselectbb5in.9(A,B,C) -> evalrealselectbb6in.2(1 + A,B,C) [-2 + C >= 0 && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectbb5in.9(A,B,C) -> evalrealselectbb6in.3(1 + A,B,C) [-2 + C >= 0 && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectreturnin.10(A,B,C) -> evalrealselectstop.11(A,B,C) [1 + A + -1*B >= 0 && A >= 0] evalrealselectstop.11(A,B,C) -> exitus616(A,B,C) True evalrealselectstop.11(A,B,C) -> exitus616(A,B,C) True Signature: {(evalrealselectbb1in.7,3) ;(evalrealselectbb1in.8,3) ;(evalrealselectbb4in.5,3) ;(evalrealselectbb4in.6,3) ;(evalrealselectbb5in.9,3) ;(evalrealselectbb6in.2,3) ;(evalrealselectbb6in.3,3) ;(evalrealselectbbin.4,3) ;(evalrealselectentryin.1,3) ;(evalrealselectreturnin.10,3) ;(evalrealselectstart.0,3) ;(evalrealselectstop.11,3) ;(exitus616,3)} Rule Graph: [0->{1,2},1->{3},2->{4},3->{5},4->{15},5->{6,7},6->{9,10},7->{11,12},8->{13,14},9->{6,7},10->{8},11->{6,7} ,12->{8},13->{3},14->{4},15->{16,17}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17] | `- p:[3,13,8,10,6,5,9,11,7,12] c: [3,5,8,10,12,13] | `- p:[6,9,11,7] c: [6,7,9,11] * Step 6: AbstractSize WORST_CASE(?,POLY) + Considered Problem: (Rules: evalrealselectstart.0(A,B,C) -> evalrealselectentryin.1(A,B,C) True evalrealselectentryin.1(A,B,C) -> evalrealselectbb6in.2(0,B,C) True evalrealselectentryin.1(A,B,C) -> evalrealselectbb6in.3(0,B,C) True evalrealselectbb6in.2(A,B,C) -> evalrealselectbbin.4(A,B,C) [A >= 0 && B >= 2 + A] evalrealselectbb6in.3(A,B,C) -> evalrealselectreturnin.10(A,B,C) [A >= 0 && 1 + A >= B] evalrealselectbbin.4(A,B,C) -> evalrealselectbb4in.5(A,B,1 + A) [-2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectbb4in.5(A,B,C) -> evalrealselectbb1in.7(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] evalrealselectbb4in.5(A,B,C) -> evalrealselectbb1in.8(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && B >= 1 + C] evalrealselectbb4in.6(A,B,C) -> evalrealselectbb5in.9(A,B,C) [-1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && C >= B] evalrealselectbb1in.7(A,B,C) -> evalrealselectbb4in.5(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] evalrealselectbb1in.7(A,B,C) -> evalrealselectbb4in.6(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && D >= 1 + E] evalrealselectbb1in.8(A,B,C) -> evalrealselectbb4in.5(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] evalrealselectbb1in.8(A,B,C) -> evalrealselectbb4in.6(A,B,1 + C) [-1 + B + -1*C >= 0 && -1 + C >= 0 && -3 + B + C >= 0 && -1 + A + C >= 0 && -1 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0 && E >= D] evalrealselectbb5in.9(A,B,C) -> evalrealselectbb6in.2(1 + A,B,C) [-2 + C >= 0 && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectbb5in.9(A,B,C) -> evalrealselectbb6in.3(1 + A,B,C) [-2 + C >= 0 && -4 + B + C >= 0 && -1*B + C >= 0 && -2 + A + C >= 0 && -2 + -1*A + C >= 0 && -2 + B >= 0 && -2 + A + B >= 0 && -2 + -1*A + B >= 0 && A >= 0] evalrealselectreturnin.10(A,B,C) -> evalrealselectstop.11(A,B,C) [1 + A + -1*B >= 0 && A >= 0] evalrealselectstop.11(A,B,C) -> exitus616(A,B,C) True evalrealselectstop.11(A,B,C) -> exitus616(A,B,C) True Signature: {(evalrealselectbb1in.7,3) ;(evalrealselectbb1in.8,3) ;(evalrealselectbb4in.5,3) ;(evalrealselectbb4in.6,3) ;(evalrealselectbb5in.9,3) ;(evalrealselectbb6in.2,3) ;(evalrealselectbb6in.3,3) ;(evalrealselectbbin.4,3) ;(evalrealselectentryin.1,3) ;(evalrealselectreturnin.10,3) ;(evalrealselectstart.0,3) ;(evalrealselectstop.11,3) ;(exitus616,3)} Rule Graph: [0->{1,2},1->{3},2->{4},3->{5},4->{15},5->{6,7},6->{9,10},7->{11,12},8->{13,14},9->{6,7},10->{8},11->{6,7} ,12->{8},13->{3},14->{4},15->{16,17}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17] | `- p:[3,13,8,10,6,5,9,11,7,12] c: [3,5,8,10,12,13] | `- p:[6,9,11,7] c: [6,7,9,11]) + Applied Processor: AbstractSize Minimize + Details: () * Step 7: AbstractFlow WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,0.0,0.0.0] evalrealselectstart.0 ~> evalrealselectentryin.1 [A <= A, B <= B, C <= C] evalrealselectentryin.1 ~> evalrealselectbb6in.2 [A <= 0*K, B <= B, C <= C] evalrealselectentryin.1 ~> evalrealselectbb6in.3 [A <= 0*K, B <= B, C <= C] evalrealselectbb6in.2 ~> evalrealselectbbin.4 [A <= A, B <= B, C <= C] evalrealselectbb6in.3 ~> evalrealselectreturnin.10 [A <= A, B <= B, C <= C] evalrealselectbbin.4 ~> evalrealselectbb4in.5 [A <= A, B <= B, C <= B] evalrealselectbb4in.5 ~> evalrealselectbb1in.7 [A <= A, B <= B, C <= C] evalrealselectbb4in.5 ~> evalrealselectbb1in.8 [A <= A, B <= B, C <= C] evalrealselectbb4in.6 ~> evalrealselectbb5in.9 [A <= A, B <= B, C <= C] evalrealselectbb1in.7 ~> evalrealselectbb4in.5 [A <= A, B <= B, C <= B] evalrealselectbb1in.7 ~> evalrealselectbb4in.6 [A <= A, B <= B, C <= B] evalrealselectbb1in.8 ~> evalrealselectbb4in.5 [A <= A, B <= B, C <= B] evalrealselectbb1in.8 ~> evalrealselectbb4in.6 [A <= A, B <= B, C <= B] evalrealselectbb5in.9 ~> evalrealselectbb6in.2 [A <= C, B <= B, C <= C] evalrealselectbb5in.9 ~> evalrealselectbb6in.3 [A <= C, B <= B, C <= C] evalrealselectreturnin.10 ~> evalrealselectstop.11 [A <= A, B <= B, C <= C] evalrealselectstop.11 ~> exitus616 [A <= A, B <= B, C <= C] evalrealselectstop.11 ~> exitus616 [A <= A, B <= B, C <= C] + Loop: [0.0 <= A + B] evalrealselectbb6in.2 ~> evalrealselectbbin.4 [A <= A, B <= B, C <= C] evalrealselectbb5in.9 ~> evalrealselectbb6in.2 [A <= C, B <= B, C <= C] evalrealselectbb4in.6 ~> evalrealselectbb5in.9 [A <= A, B <= B, C <= C] evalrealselectbb1in.7 ~> evalrealselectbb4in.6 [A <= A, B <= B, C <= B] evalrealselectbb4in.5 ~> evalrealselectbb1in.7 [A <= A, B <= B, C <= C] evalrealselectbbin.4 ~> evalrealselectbb4in.5 [A <= A, B <= B, C <= B] evalrealselectbb1in.7 ~> evalrealselectbb4in.5 [A <= A, B <= B, C <= B] evalrealselectbb1in.8 ~> evalrealselectbb4in.5 [A <= A, B <= B, C <= B] evalrealselectbb4in.5 ~> evalrealselectbb1in.8 [A <= A, B <= B, C <= C] evalrealselectbb1in.8 ~> evalrealselectbb4in.6 [A <= A, B <= B, C <= B] + Loop: [0.0.0 <= K + B + C] evalrealselectbb4in.5 ~> evalrealselectbb1in.7 [A <= A, B <= B, C <= C] evalrealselectbb1in.7 ~> evalrealselectbb4in.5 [A <= A, B <= B, C <= B] evalrealselectbb1in.8 ~> evalrealselectbb4in.5 [A <= A, B <= B, C <= B] evalrealselectbb4in.5 ~> evalrealselectbb1in.8 [A <= A, B <= B, C <= C] + Applied Processor: AbstractFlow + Details: () * Step 8: Lare WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0,0.0.0] evalrealselectstart.0 ~> evalrealselectentryin.1 [] evalrealselectentryin.1 ~> evalrealselectbb6in.2 [K ~=> A] evalrealselectentryin.1 ~> evalrealselectbb6in.3 [K ~=> A] evalrealselectbb6in.2 ~> evalrealselectbbin.4 [] evalrealselectbb6in.3 ~> evalrealselectreturnin.10 [] evalrealselectbbin.4 ~> evalrealselectbb4in.5 [B ~=> C] evalrealselectbb4in.5 ~> evalrealselectbb1in.7 [] evalrealselectbb4in.5 ~> evalrealselectbb1in.8 [] evalrealselectbb4in.6 ~> evalrealselectbb5in.9 [] evalrealselectbb1in.7 ~> evalrealselectbb4in.5 [B ~=> C] evalrealselectbb1in.7 ~> evalrealselectbb4in.6 [B ~=> C] evalrealselectbb1in.8 ~> evalrealselectbb4in.5 [B ~=> C] evalrealselectbb1in.8 ~> evalrealselectbb4in.6 [B ~=> C] evalrealselectbb5in.9 ~> evalrealselectbb6in.2 [C ~=> A] evalrealselectbb5in.9 ~> evalrealselectbb6in.3 [C ~=> A] evalrealselectreturnin.10 ~> evalrealselectstop.11 [] evalrealselectstop.11 ~> exitus616 [] evalrealselectstop.11 ~> exitus616 [] + Loop: [A ~+> 0.0,B ~+> 0.0] evalrealselectbb6in.2 ~> evalrealselectbbin.4 [] evalrealselectbb5in.9 ~> evalrealselectbb6in.2 [C ~=> A] evalrealselectbb4in.6 ~> evalrealselectbb5in.9 [] evalrealselectbb1in.7 ~> evalrealselectbb4in.6 [B ~=> C] evalrealselectbb4in.5 ~> evalrealselectbb1in.7 [] evalrealselectbbin.4 ~> evalrealselectbb4in.5 [B ~=> C] evalrealselectbb1in.7 ~> evalrealselectbb4in.5 [B ~=> C] evalrealselectbb1in.8 ~> evalrealselectbb4in.5 [B ~=> C] evalrealselectbb4in.5 ~> evalrealselectbb1in.8 [] evalrealselectbb1in.8 ~> evalrealselectbb4in.6 [B ~=> C] + Loop: [B ~+> 0.0.0,C ~+> 0.0.0,K ~+> 0.0.0] evalrealselectbb4in.5 ~> evalrealselectbb1in.7 [] evalrealselectbb1in.7 ~> evalrealselectbb4in.5 [B ~=> C] evalrealselectbb1in.8 ~> evalrealselectbb4in.5 [B ~=> C] evalrealselectbb4in.5 ~> evalrealselectbb1in.8 [] + Applied Processor: Lare + Details: evalrealselectstart.0 ~> exitus616 [B ~=> A ,B ~=> C ,C ~=> A ,K ~=> A ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,B ~*> 0.0.0 ,B ~*> tick ,K ~*> tick] + evalrealselectbb5in.9> [B ~=> A ,B ~=> C ,A ~+> 0.0 ,A ~+> tick ,B ~+> 0.0 ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> tick ,B ~*> 0.0.0 ,B ~*> tick ,K ~*> tick] + evalrealselectbb1in.7> [B ~=> C ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] evalrealselectbb1in.8> [B ~=> C ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> 0.0.0 ,K ~+> tick] YES(?,POLY)