YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalwcet2start(A,B) -> evalwcet2entryin(A,B) True (1,1) 1. evalwcet2entryin(A,B) -> evalwcet2bb5in(A,B) True (?,1) 2. evalwcet2bb5in(A,B) -> evalwcet2bb2in(A,0) [4 >= A] (?,1) 3. evalwcet2bb5in(A,B) -> evalwcet2returnin(A,B) [A >= 5] (?,1) 4. evalwcet2bb2in(A,B) -> evalwcet2bb1in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && A >= 3 && 9 >= B] (?,1) 5. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && 2 >= A] (?,1) 6. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && B >= 10] (?,1) 7. evalwcet2bb1in(A,B) -> evalwcet2bb2in(A,1 + B) [9 + -1*B >= 0 (?,1) && 6 + A + -1*B >= 0 && 13 + -1*A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && -3 + A >= 0] 8. evalwcet2bb4in(A,B) -> evalwcet2bb5in(1 + A,B) [B >= 0 && 2 + -1*A + B >= 0 && 4 + -1*A >= 0] (?,1) 9. evalwcet2returnin(A,B) -> evalwcet2stop(A,B) [-5 + A >= 0] (?,1) Signature: {(evalwcet2bb1in,2) ;(evalwcet2bb2in,2) ;(evalwcet2bb4in,2) ;(evalwcet2bb5in,2) ;(evalwcet2entryin,2) ;(evalwcet2returnin,2) ;(evalwcet2start,2) ;(evalwcet2stop,2)} Flow Graph: [0->{1},1->{2,3},2->{4,5,6},3->{9},4->{7},5->{8},6->{8},7->{4,5,6},8->{2,3},9->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalwcet2start(A,B) -> evalwcet2entryin(A,B) True (1,1) 1. evalwcet2entryin(A,B) -> evalwcet2bb5in(A,B) True (1,1) 2. evalwcet2bb5in(A,B) -> evalwcet2bb2in(A,0) [4 >= A] (?,1) 3. evalwcet2bb5in(A,B) -> evalwcet2returnin(A,B) [A >= 5] (1,1) 4. evalwcet2bb2in(A,B) -> evalwcet2bb1in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && A >= 3 && 9 >= B] (?,1) 5. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && 2 >= A] (?,1) 6. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && B >= 10] (?,1) 7. evalwcet2bb1in(A,B) -> evalwcet2bb2in(A,1 + B) [9 + -1*B >= 0 (?,1) && 6 + A + -1*B >= 0 && 13 + -1*A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && -3 + A >= 0] 8. evalwcet2bb4in(A,B) -> evalwcet2bb5in(1 + A,B) [B >= 0 && 2 + -1*A + B >= 0 && 4 + -1*A >= 0] (?,1) 9. evalwcet2returnin(A,B) -> evalwcet2stop(A,B) [-5 + A >= 0] (1,1) Signature: {(evalwcet2bb1in,2) ;(evalwcet2bb2in,2) ;(evalwcet2bb4in,2) ;(evalwcet2bb5in,2) ;(evalwcet2entryin,2) ;(evalwcet2returnin,2) ;(evalwcet2start,2) ;(evalwcet2stop,2)} Flow Graph: [0->{1},1->{2,3},2->{4,5,6},3->{9},4->{7},5->{8},6->{8},7->{4,5,6},8->{2,3},9->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,6),(7,5)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalwcet2start(A,B) -> evalwcet2entryin(A,B) True (1,1) 1. evalwcet2entryin(A,B) -> evalwcet2bb5in(A,B) True (1,1) 2. evalwcet2bb5in(A,B) -> evalwcet2bb2in(A,0) [4 >= A] (?,1) 3. evalwcet2bb5in(A,B) -> evalwcet2returnin(A,B) [A >= 5] (1,1) 4. evalwcet2bb2in(A,B) -> evalwcet2bb1in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && A >= 3 && 9 >= B] (?,1) 5. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && 2 >= A] (?,1) 6. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && B >= 10] (?,1) 7. evalwcet2bb1in(A,B) -> evalwcet2bb2in(A,1 + B) [9 + -1*B >= 0 (?,1) && 6 + A + -1*B >= 0 && 13 + -1*A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && -3 + A >= 0] 8. evalwcet2bb4in(A,B) -> evalwcet2bb5in(1 + A,B) [B >= 0 && 2 + -1*A + B >= 0 && 4 + -1*A >= 0] (?,1) 9. evalwcet2returnin(A,B) -> evalwcet2stop(A,B) [-5 + A >= 0] (1,1) Signature: {(evalwcet2bb1in,2) ;(evalwcet2bb2in,2) ;(evalwcet2bb4in,2) ;(evalwcet2bb5in,2) ;(evalwcet2entryin,2) ;(evalwcet2returnin,2) ;(evalwcet2start,2) ;(evalwcet2stop,2)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{9},4->{7},5->{8},6->{8},7->{4,6},8->{2,3},9->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalwcet2start(A,B) -> evalwcet2entryin(A,B) True (1,1) 1. evalwcet2entryin(A,B) -> evalwcet2bb5in(A,B) True (?,1) 2. evalwcet2bb5in(A,B) -> evalwcet2bb2in(A,0) [4 >= A] (?,1) 3. evalwcet2bb5in(A,B) -> evalwcet2returnin(A,B) [A >= 5] (?,1) 4. evalwcet2bb2in(A,B) -> evalwcet2bb1in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && A >= 3 && 9 >= B] (?,1) 5. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && 2 >= A] (?,1) 6. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && B >= 10] (?,1) 7. evalwcet2bb1in(A,B) -> evalwcet2bb2in(A,1 + B) [9 + -1*B >= 0 (?,1) && 6 + A + -1*B >= 0 && 13 + -1*A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && -3 + A >= 0] 8. evalwcet2bb4in(A,B) -> evalwcet2bb5in(1 + A,B) [B >= 0 && 2 + -1*A + B >= 0 && 4 + -1*A >= 0] (?,1) 9. evalwcet2returnin(A,B) -> evalwcet2stop(A,B) [-5 + A >= 0] (?,1) 10. evalwcet2returnin(A,B) -> exitus616(A,B) True (?,1) Signature: {(evalwcet2bb1in,2) ;(evalwcet2bb2in,2) ;(evalwcet2bb4in,2) ;(evalwcet2bb5in,2) ;(evalwcet2entryin,2) ;(evalwcet2returnin,2) ;(evalwcet2start,2) ;(evalwcet2stop,2) ;(exitus616,2)} Flow Graph: [0->{1},1->{2,3},2->{4,5,6},3->{9,10},4->{7},5->{8},6->{8},7->{4,5,6},8->{2,3},9->{},10->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,6),(7,5)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalwcet2start(A,B) -> evalwcet2entryin(A,B) True (1,1) 1. evalwcet2entryin(A,B) -> evalwcet2bb5in(A,B) True (?,1) 2. evalwcet2bb5in(A,B) -> evalwcet2bb2in(A,0) [4 >= A] (?,1) 3. evalwcet2bb5in(A,B) -> evalwcet2returnin(A,B) [A >= 5] (?,1) 4. evalwcet2bb2in(A,B) -> evalwcet2bb1in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && A >= 3 && 9 >= B] (?,1) 5. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && 2 >= A] (?,1) 6. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && B >= 10] (?,1) 7. evalwcet2bb1in(A,B) -> evalwcet2bb2in(A,1 + B) [9 + -1*B >= 0 (?,1) && 6 + A + -1*B >= 0 && 13 + -1*A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && -3 + A >= 0] 8. evalwcet2bb4in(A,B) -> evalwcet2bb5in(1 + A,B) [B >= 0 && 2 + -1*A + B >= 0 && 4 + -1*A >= 0] (?,1) 9. evalwcet2returnin(A,B) -> evalwcet2stop(A,B) [-5 + A >= 0] (?,1) 10. evalwcet2returnin(A,B) -> exitus616(A,B) True (?,1) Signature: {(evalwcet2bb1in,2) ;(evalwcet2bb2in,2) ;(evalwcet2bb4in,2) ;(evalwcet2bb5in,2) ;(evalwcet2entryin,2) ;(evalwcet2returnin,2) ;(evalwcet2start,2) ;(evalwcet2stop,2) ;(exitus616,2)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{9,10},4->{7},5->{8},6->{8},7->{4,6},8->{2,3},9->{},10->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | `- p:[2,8,5,6,7,4] c: [8] | `- p:[4,7] c: [7] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. evalwcet2start(A,B) -> evalwcet2entryin(A,B) True (1,1) 1. evalwcet2entryin(A,B) -> evalwcet2bb5in(A,B) True (?,1) 2. evalwcet2bb5in(A,B) -> evalwcet2bb2in(A,0) [4 >= A] (?,1) 3. evalwcet2bb5in(A,B) -> evalwcet2returnin(A,B) [A >= 5] (?,1) 4. evalwcet2bb2in(A,B) -> evalwcet2bb1in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && A >= 3 && 9 >= B] (?,1) 5. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && 2 >= A] (?,1) 6. evalwcet2bb2in(A,B) -> evalwcet2bb4in(A,B) [B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && B >= 10] (?,1) 7. evalwcet2bb1in(A,B) -> evalwcet2bb2in(A,1 + B) [9 + -1*B >= 0 (?,1) && 6 + A + -1*B >= 0 && 13 + -1*A + -1*B >= 0 && B >= 0 && -3 + A + B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && -3 + A >= 0] 8. evalwcet2bb4in(A,B) -> evalwcet2bb5in(1 + A,B) [B >= 0 && 2 + -1*A + B >= 0 && 4 + -1*A >= 0] (?,1) 9. evalwcet2returnin(A,B) -> evalwcet2stop(A,B) [-5 + A >= 0] (?,1) 10. evalwcet2returnin(A,B) -> exitus616(A,B) True (?,1) Signature: {(evalwcet2bb1in,2) ;(evalwcet2bb2in,2) ;(evalwcet2bb4in,2) ;(evalwcet2bb5in,2) ;(evalwcet2entryin,2) ;(evalwcet2returnin,2) ;(evalwcet2start,2) ;(evalwcet2stop,2) ;(exitus616,2)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{9,10},4->{7},5->{8},6->{8},7->{4,6},8->{2,3},9->{},10->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10] | `- p:[2,8,5,6,7,4] c: [8] | `- p:[4,7] c: [7]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,0.0,0.0.0] evalwcet2start ~> evalwcet2entryin [A <= A, B <= B] evalwcet2entryin ~> evalwcet2bb5in [A <= A, B <= B] evalwcet2bb5in ~> evalwcet2bb2in [A <= A, B <= 0*K] evalwcet2bb5in ~> evalwcet2returnin [A <= A, B <= B] evalwcet2bb2in ~> evalwcet2bb1in [A <= A, B <= B] evalwcet2bb2in ~> evalwcet2bb4in [A <= A, B <= B] evalwcet2bb2in ~> evalwcet2bb4in [A <= A, B <= B] evalwcet2bb1in ~> evalwcet2bb2in [A <= A, B <= 10*K] evalwcet2bb4in ~> evalwcet2bb5in [A <= K + A, B <= B] evalwcet2returnin ~> evalwcet2stop [A <= A, B <= B] evalwcet2returnin ~> exitus616 [A <= A, B <= B] + Loop: [0.0 <= 5*K + A] evalwcet2bb5in ~> evalwcet2bb2in [A <= A, B <= 0*K] evalwcet2bb4in ~> evalwcet2bb5in [A <= K + A, B <= B] evalwcet2bb2in ~> evalwcet2bb4in [A <= A, B <= B] evalwcet2bb2in ~> evalwcet2bb4in [A <= A, B <= B] evalwcet2bb1in ~> evalwcet2bb2in [A <= A, B <= 10*K] evalwcet2bb2in ~> evalwcet2bb1in [A <= A, B <= B] + Loop: [0.0.0 <= 10*K + B] evalwcet2bb2in ~> evalwcet2bb1in [A <= A, B <= B] evalwcet2bb1in ~> evalwcet2bb2in [A <= A, B <= 10*K] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,0.0,0.0.0] evalwcet2start ~> evalwcet2entryin [] evalwcet2entryin ~> evalwcet2bb5in [] evalwcet2bb5in ~> evalwcet2bb2in [K ~=> B] evalwcet2bb5in ~> evalwcet2returnin [] evalwcet2bb2in ~> evalwcet2bb1in [] evalwcet2bb2in ~> evalwcet2bb4in [] evalwcet2bb2in ~> evalwcet2bb4in [] evalwcet2bb1in ~> evalwcet2bb2in [K ~=> B] evalwcet2bb4in ~> evalwcet2bb5in [A ~+> A,K ~+> A] evalwcet2returnin ~> evalwcet2stop [] evalwcet2returnin ~> exitus616 [] + Loop: [A ~+> 0.0,K ~*> 0.0] evalwcet2bb5in ~> evalwcet2bb2in [K ~=> B] evalwcet2bb4in ~> evalwcet2bb5in [A ~+> A,K ~+> A] evalwcet2bb2in ~> evalwcet2bb4in [] evalwcet2bb2in ~> evalwcet2bb4in [] evalwcet2bb1in ~> evalwcet2bb2in [K ~=> B] evalwcet2bb2in ~> evalwcet2bb1in [] + Loop: [B ~+> 0.0.0,K ~*> 0.0.0] evalwcet2bb2in ~> evalwcet2bb1in [] evalwcet2bb1in ~> evalwcet2bb2in [K ~=> B] + Applied Processor: LareProcessor + Details: evalwcet2start ~> exitus616 [K ~=> B ,A ~+> A ,A ~+> 0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> tick ,K ~*> A ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] evalwcet2start ~> evalwcet2stop [K ~=> B ,A ~+> A ,A ~+> 0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> tick ,K ~*> A ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] + evalwcet2bb5in> [K ~=> B ,A ~+> A ,A ~+> 0.0 ,A ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> tick ,K ~*> A ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick] + evalwcet2bb2in> [K ~=> B ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~*> 0.0.0 ,K ~*> tick] YES(?,POLY)