YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(0,0,C) True (?,1) 2. evalfbb3in(A,B,C) -> evalfbbin(A,B,C) [99 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [B >= 100] (?,1) 4. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 1 + A] (?,1) 5. evalfbbin(A,B,C) -> evalfbb2in(A,B,C) [A >= C] (?,1) 6. evalfbb1in(A,B,C) -> evalfbb3in(1 + A,B,C) True (?,1) 7. evalfbb2in(A,B,C) -> evalfbb3in(A,1 + B,C) True (?,1) 8. evalfreturnin(A,B,C) -> evalfstop(A,B,C) True (?,1) Signature: {(evalfbb1in,3) ;(evalfbb2in,3) ;(evalfbb3in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(0,0,C) True (1,1) 2. evalfbb3in(A,B,C) -> evalfbbin(A,B,C) [99 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [B >= 100] (1,1) 4. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 1 + A] (?,1) 5. evalfbbin(A,B,C) -> evalfbb2in(A,B,C) [A >= C] (?,1) 6. evalfbb1in(A,B,C) -> evalfbb3in(1 + A,B,C) True (?,1) 7. evalfbb2in(A,B,C) -> evalfbb3in(A,1 + B,C) True (?,1) 8. evalfreturnin(A,B,C) -> evalfstop(A,B,C) True (1,1) Signature: {(evalfbb1in,3) ;(evalfbb2in,3) ;(evalfbb3in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,3)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(0,0,C) True (1,1) 2. evalfbb3in(A,B,C) -> evalfbbin(A,B,C) [99 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [B >= 100] (1,1) 4. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 1 + A] (?,1) 5. evalfbbin(A,B,C) -> evalfbb2in(A,B,C) [A >= C] (?,1) 6. evalfbb1in(A,B,C) -> evalfbb3in(1 + A,B,C) True (?,1) 7. evalfbb2in(A,B,C) -> evalfbb3in(A,1 + B,C) True (?,1) 8. evalfreturnin(A,B,C) -> evalfstop(A,B,C) True (1,1) Signature: {(evalfbb1in,3) ;(evalfbb2in,3) ;(evalfbb3in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3)} Flow Graph: [0->{1},1->{2},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(0,0,C) True (?,1) 2. evalfbb3in(A,B,C) -> evalfbbin(A,B,C) [99 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [B >= 100] (?,1) 4. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 1 + A] (?,1) 5. evalfbbin(A,B,C) -> evalfbb2in(A,B,C) [A >= C] (?,1) 6. evalfbb1in(A,B,C) -> evalfbb3in(1 + A,B,C) True (?,1) 7. evalfbb2in(A,B,C) -> evalfbb3in(A,1 + B,C) True (?,1) 8. evalfreturnin(A,B,C) -> evalfstop(A,B,C) True (?,1) 9. evalfreturnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalfbb1in,3) ;(evalfbb2in,3) ;(evalfbb3in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{8,9},4->{6},5->{7},6->{2,3},7->{2,3},8->{},9->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,3)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(0,0,C) True (?,1) 2. evalfbb3in(A,B,C) -> evalfbbin(A,B,C) [99 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [B >= 100] (?,1) 4. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 1 + A] (?,1) 5. evalfbbin(A,B,C) -> evalfbb2in(A,B,C) [A >= C] (?,1) 6. evalfbb1in(A,B,C) -> evalfbb3in(1 + A,B,C) True (?,1) 7. evalfbb2in(A,B,C) -> evalfbb3in(A,1 + B,C) True (?,1) 8. evalfreturnin(A,B,C) -> evalfstop(A,B,C) True (?,1) 9. evalfreturnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalfbb1in,3) ;(evalfbb2in,3) ;(evalfbb3in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2},2->{4,5},3->{8,9},4->{6},5->{7},6->{2,3},7->{2,3},8->{},9->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9] | `- p:[2,6,4,7,5] c: [4] | `- p:[2,7,5] c: [2] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. evalfstart(A,B,C) -> evalfentryin(A,B,C) True (1,1) 1. evalfentryin(A,B,C) -> evalfbb3in(0,0,C) True (?,1) 2. evalfbb3in(A,B,C) -> evalfbbin(A,B,C) [99 >= B] (?,1) 3. evalfbb3in(A,B,C) -> evalfreturnin(A,B,C) [B >= 100] (?,1) 4. evalfbbin(A,B,C) -> evalfbb1in(A,B,C) [C >= 1 + A] (?,1) 5. evalfbbin(A,B,C) -> evalfbb2in(A,B,C) [A >= C] (?,1) 6. evalfbb1in(A,B,C) -> evalfbb3in(1 + A,B,C) True (?,1) 7. evalfbb2in(A,B,C) -> evalfbb3in(A,1 + B,C) True (?,1) 8. evalfreturnin(A,B,C) -> evalfstop(A,B,C) True (?,1) 9. evalfreturnin(A,B,C) -> exitus616(A,B,C) True (?,1) Signature: {(evalfbb1in,3) ;(evalfbb2in,3) ;(evalfbb3in,3) ;(evalfbbin,3) ;(evalfentryin,3) ;(evalfreturnin,3) ;(evalfstart,3) ;(evalfstop,3) ;(exitus616,3)} Flow Graph: [0->{1},1->{2},2->{4,5},3->{8,9},4->{6},5->{7},6->{2,3},7->{2,3},8->{},9->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9] | `- p:[2,6,4,7,5] c: [4] | `- p:[2,7,5] c: [2]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,0.0,0.0.0] evalfstart ~> evalfentryin [A <= A, B <= B, C <= C] evalfentryin ~> evalfbb3in [A <= 0*K, B <= 0*K, C <= C] evalfbb3in ~> evalfbbin [A <= A, B <= B, C <= C] evalfbb3in ~> evalfreturnin [A <= A, B <= B, C <= C] evalfbbin ~> evalfbb1in [A <= A, B <= B, C <= C] evalfbbin ~> evalfbb2in [A <= A, B <= B, C <= C] evalfbb1in ~> evalfbb3in [A <= K + A, B <= B, C <= C] evalfbb2in ~> evalfbb3in [A <= A, B <= K + B, C <= C] evalfreturnin ~> evalfstop [A <= A, B <= B, C <= C] evalfreturnin ~> exitus616 [A <= A, B <= B, C <= C] + Loop: [0.0 <= K + A + C] evalfbb3in ~> evalfbbin [A <= A, B <= B, C <= C] evalfbb1in ~> evalfbb3in [A <= K + A, B <= B, C <= C] evalfbbin ~> evalfbb1in [A <= A, B <= B, C <= C] evalfbb2in ~> evalfbb3in [A <= A, B <= K + B, C <= C] evalfbbin ~> evalfbb2in [A <= A, B <= B, C <= C] + Loop: [0.0.0 <= 100*K + B] evalfbb3in ~> evalfbbin [A <= A, B <= B, C <= C] evalfbb2in ~> evalfbb3in [A <= A, B <= K + B, C <= C] evalfbbin ~> evalfbb2in [A <= A, B <= B, C <= C] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,0.0,0.0.0] evalfstart ~> evalfentryin [] evalfentryin ~> evalfbb3in [K ~=> A,K ~=> B] evalfbb3in ~> evalfbbin [] evalfbb3in ~> evalfreturnin [] evalfbbin ~> evalfbb1in [] evalfbbin ~> evalfbb2in [] evalfbb1in ~> evalfbb3in [A ~+> A,K ~+> A] evalfbb2in ~> evalfbb3in [B ~+> B,K ~+> B] evalfreturnin ~> evalfstop [] evalfreturnin ~> exitus616 [] + Loop: [A ~+> 0.0,C ~+> 0.0,K ~+> 0.0] evalfbb3in ~> evalfbbin [] evalfbb1in ~> evalfbb3in [A ~+> A,K ~+> A] evalfbbin ~> evalfbb1in [] evalfbb2in ~> evalfbb3in [B ~+> B,K ~+> B] evalfbbin ~> evalfbb2in [] + Loop: [B ~+> 0.0.0,K ~*> 0.0.0] evalfbb3in ~> evalfbbin [] evalfbb2in ~> evalfbb3in [B ~+> B,K ~+> B] evalfbbin ~> evalfbb2in [] + Applied Processor: LareProcessor + Details: evalfstart ~> exitus616 [K ~=> A ,K ~=> B ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,C ~*> A ,C ~*> B ,C ~*> tick ,K ~*> A ,K ~*> B ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,C ~^> B ,K ~^> B] evalfstart ~> evalfstop [K ~=> A ,K ~=> B ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,C ~*> A ,C ~*> B ,C ~*> tick ,K ~*> A ,K ~*> B ,K ~*> 0.0 ,K ~*> 0.0.0 ,K ~*> tick ,C ~^> B ,K ~^> B] + evalfbb3in> [A ~+> A ,A ~+> 0.0 ,A ~+> tick ,B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,C ~+> 0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> B ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> tick ,A ~*> A ,A ~*> B ,A ~*> tick ,B ~*> B ,B ~*> 0.0.0 ,B ~*> tick ,C ~*> A ,C ~*> B ,C ~*> tick ,K ~*> A ,K ~*> B ,K ~*> 0.0.0 ,K ~*> tick ,A ~^> B ,C ~^> B ,K ~^> B] + evalfbbin> [B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,B ~*> B ,K ~*> B ,K ~*> 0.0.0 ,K ~*> tick] evalfbb3in> [B ~+> B ,B ~+> 0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,B ~*> B ,K ~*> B ,K ~*> 0.0.0 ,K ~*> tick] YES(?,POLY)