YES(?,POLY) * Step 1: TrivialSCCs WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] (?,1) 5. evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 (?,1) && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 (?,1) && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{2,3},14->{}] + 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,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True (1,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] (1,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] (?,1) 5. evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 (?,1) && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 (?,1) && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] (1,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{2,3},14->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,7),(6,9)] * Step 3: AddSinks WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True (1,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] (1,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] (?,1) 5. evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 (?,1) && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 (?,1) && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] (1,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14},4->{6},5->{13},6->{8},7->{12},8->{10},9->{11},10->{8,9},11->{6,7},12->{4 ,5},13->{2,3},14->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] (?,1) 5. evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 (?,1) && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 (?,1) && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] (?,1) 15. evalfreturnin(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14,15},4->{6,7},5->{13},6->{8,9},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{2,3},14->{},15->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,7),(6,9)] * Step 5: LooptreeTransformer WORST_CASE(?,POLY) + Considered Problem: Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] (?,1) 5. evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 (?,1) && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 (?,1) && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] (?,1) 15. evalfreturnin(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14,15},4->{6},5->{13},6->{8},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{2,3},14->{},15->{}] + Applied Processor: LooptreeTransformer + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] | `- p:[2,13,5,12,7,11,9,10,8,6,4] c: [13] | `- p:[4,12,7,11,9,10,8,6] c: [12] | `- p:[6,11,9,10,8] c: [6] | `- p:[8,10] c: [10] * Step 6: SizeAbstraction WORST_CASE(?,POLY) + Considered Problem: (Rules: 0. evalfstart(A,B,C,D,E) -> evalfentryin(A,B,C,D,E) True (1,1) 1. evalfentryin(A,B,C,D,E) -> evalfbb10in(B,A,C,D,E) True (?,1) 2. evalfbb10in(A,B,C,D,E) -> evalfbb8in(A,B,1,D,E) [B >= 1] (?,1) 3. evalfbb10in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [0 >= B] (?,1) 4. evalfbb8in(A,B,C,D,E) -> evalfbb6in(A,B,C,B,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && A >= C] (?,1) 5. evalfbb8in(A,B,C,D,E) -> evalfbb9in(A,B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + B >= 0 && C >= 1 + A] (?,1) 6. evalfbb6in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && B + C >= D] 7. evalfbb6in(A,B,C,D,E) -> evalfbb7in(A,B,C,D,E) [-1 + D >= 0 (?,1) && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= 1 + B + C] 8. evalfbb4in(A,B,C,D,E) -> evalfbb3in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && D >= E] 9. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [-1 + E >= 0 (?,1) && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && E >= 1 + D] 10. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,1 + E) [D + -1*E >= 0 (?,1) && -1 + E >= 0 && -2 + D + E >= 0 && -2 + C + E >= 0 && -2 + B + E >= 0 && -2 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 11. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,1 + D,E) [-2 + E >= 0 (?,1) && -3 + D + E >= 0 && -1 + -1*D + E >= 0 && -3 + C + E >= 0 && -3 + B + E >= 0 && -1 + -1*B + E >= 0 && -3 + A + E >= 0 && -1 + D >= 0 && -2 + C + D >= 0 && -2 + B + D >= 0 && -1*B + D >= 0 && -2 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 12. evalfbb7in(A,B,C,D,E) -> evalfbb8in(A,B,1 + C,D,E) [-3 + D >= 0 (?,1) && -4 + C + D >= 0 && -2 + -1*C + D >= 0 && -4 + B + D >= 0 && -2 + -1*B + D >= 0 && -4 + A + D >= 0 && A + -1*C >= 0 && -1 + C >= 0 && -2 + B + C >= 0 && -2 + A + C >= 0 && -1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0] 13. evalfbb9in(A,B,C,D,E) -> evalfbb10in(A,-1 + B,C,D,E) [-1 + C >= 0 && -2 + B + C >= 0 && -1 + -1*A + C >= 0 && -1 + B >= 0] (?,1) 14. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [-1*B >= 0] (?,1) 15. evalfreturnin(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(evalfbb10in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbb8in,5) ;(evalfbb9in,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2,3},2->{4,5},3->{14,15},4->{6},5->{13},6->{8},7->{12},8->{10},9->{11},10->{8,9},11->{6,7} ,12->{4,5},13->{2,3},14->{},15->{}] ,We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15] | `- p:[2,13,5,12,7,11,9,10,8,6,4] c: [13] | `- p:[4,12,7,11,9,10,8,6] c: [12] | `- p:[6,11,9,10,8] c: [6] | `- p:[8,10] c: [10]) + Applied Processor: SizeAbstraction UseCFG NoMinimize + Details: () * Step 7: FlowAbstraction WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [A,B,C,D,E,0.0,0.0.0,0.0.0.0,0.0.0.0.0] evalfstart ~> evalfentryin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfentryin ~> evalfbb10in [A <= B, B <= A, C <= C, D <= D, E <= E] evalfbb10in ~> evalfbb8in [A <= A, B <= B, C <= K, D <= D, E <= E] evalfbb10in ~> evalfreturnin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb8in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= B, E <= E] evalfbb8in ~> evalfbb9in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K] evalfbb6in ~> evalfbb7in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K + E] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb7in ~> evalfbb8in [A <= A, B <= B, C <= 2*K + C, D <= D, E <= E] evalfbb9in ~> evalfbb10in [A <= A, B <= K + B, C <= C, D <= D, E <= E] evalfreturnin ~> evalfstop [A <= A, B <= B, C <= C, D <= D, E <= E] evalfreturnin ~> exitus616 [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0 <= B] evalfbb10in ~> evalfbb8in [A <= A, B <= B, C <= K, D <= D, E <= E] evalfbb9in ~> evalfbb10in [A <= A, B <= K + B, C <= C, D <= D, E <= E] evalfbb8in ~> evalfbb9in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb7in ~> evalfbb8in [A <= A, B <= B, C <= 2*K + C, D <= D, E <= E] evalfbb6in ~> evalfbb7in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K + E] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K] evalfbb8in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= B, E <= E] + Loop: [0.0.0 <= 2*A + C] evalfbb8in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= B, E <= E] evalfbb7in ~> evalfbb8in [A <= A, B <= B, C <= 2*K + C, D <= D, E <= E] evalfbb6in ~> evalfbb7in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K + E] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K] + Loop: [0.0.0.0 <= K + A + B + D] evalfbb6in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K + E] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0.0.0.0 <= K + D + E] evalfbb4in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= K + E] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor WORST_CASE(?,POLY) + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,0.0,0.0.0,0.0.0.0,0.0.0.0.0] evalfstart ~> evalfentryin [] evalfentryin ~> evalfbb10in [A ~=> B,B ~=> A] evalfbb10in ~> evalfbb8in [K ~=> C] evalfbb10in ~> evalfreturnin [] evalfbb8in ~> evalfbb6in [B ~=> D] evalfbb8in ~> evalfbb9in [] evalfbb6in ~> evalfbb4in [K ~=> E] evalfbb6in ~> evalfbb7in [] evalfbb4in ~> evalfbb3in [] evalfbb4in ~> evalfbb5in [] evalfbb3in ~> evalfbb4in [E ~+> E,K ~+> E] evalfbb5in ~> evalfbb6in [D ~+> D,K ~+> D] evalfbb7in ~> evalfbb8in [C ~+> C,K ~*> C] evalfbb9in ~> evalfbb10in [B ~+> B,K ~+> B] evalfreturnin ~> evalfstop [] evalfreturnin ~> exitus616 [] + Loop: [B ~=> 0.0] evalfbb10in ~> evalfbb8in [K ~=> C] evalfbb9in ~> evalfbb10in [B ~+> B,K ~+> B] evalfbb8in ~> evalfbb9in [] evalfbb7in ~> evalfbb8in [C ~+> C,K ~*> C] evalfbb6in ~> evalfbb7in [] evalfbb5in ~> evalfbb6in [D ~+> D,K ~+> D] evalfbb4in ~> evalfbb5in [] evalfbb3in ~> evalfbb4in [E ~+> E,K ~+> E] evalfbb4in ~> evalfbb3in [] evalfbb6in ~> evalfbb4in [K ~=> E] evalfbb8in ~> evalfbb6in [B ~=> D] + Loop: [C ~+> 0.0.0,A ~*> 0.0.0] evalfbb8in ~> evalfbb6in [B ~=> D] evalfbb7in ~> evalfbb8in [C ~+> C,K ~*> C] evalfbb6in ~> evalfbb7in [] evalfbb5in ~> evalfbb6in [D ~+> D,K ~+> D] evalfbb4in ~> evalfbb5in [] evalfbb3in ~> evalfbb4in [E ~+> E,K ~+> E] evalfbb4in ~> evalfbb3in [] evalfbb6in ~> evalfbb4in [K ~=> E] + Loop: [A ~+> 0.0.0.0,B ~+> 0.0.0.0,D ~+> 0.0.0.0,K ~+> 0.0.0.0] evalfbb6in ~> evalfbb4in [K ~=> E] evalfbb5in ~> evalfbb6in [D ~+> D,K ~+> D] evalfbb4in ~> evalfbb5in [] evalfbb3in ~> evalfbb4in [E ~+> E,K ~+> E] evalfbb4in ~> evalfbb3in [] + Loop: [D ~+> 0.0.0.0.0,E ~+> 0.0.0.0.0,K ~+> 0.0.0.0.0] evalfbb4in ~> evalfbb3in [] evalfbb3in ~> evalfbb4in [E ~+> E,K ~+> E] + Applied Processor: LareProcessor + Details: evalfstart ~> exitus616 [A ~=> B ,A ~=> D ,A ~=> 0.0 ,B ~=> A ,K ~=> C ,K ~=> E ,A ~+> B ,A ~+> D ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> B ,A ~*> C ,A ~*> D ,A ~*> E ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,K ~*> B ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick ,A ~^> C ,A ~^> E ,B ~^> D ,B ~^> E ,K ~^> D ,K ~^> E] evalfstart ~> evalfstop [A ~=> B ,A ~=> D ,A ~=> 0.0 ,B ~=> A ,K ~=> C ,K ~=> E ,A ~+> B ,A ~+> D ,A ~+> 0.0.0.0 ,A ~+> 0.0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> B ,A ~*> C ,A ~*> D ,A ~*> E ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0 ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,K ~*> B ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick ,A ~^> C ,A ~^> E ,B ~^> D ,B ~^> E ,K ~^> D ,K ~^> E] + evalfbb10in> [B ~=> D ,B ~=> 0.0 ,K ~=> C ,K ~=> E ,A ~+> 0.0.0.0 ,A ~+> tick ,B ~+> B ,B ~+> D ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,tick ~+> tick ,K ~+> B ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0.0 ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> C ,A ~*> D ,A ~*> E ,A ~*> 0.0.0 ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> B ,B ~*> C ,B ~*> D ,B ~*> E ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,K ~*> B ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0 ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick ,A ~^> D ,A ~^> E ,B ~^> C ,B ~^> E ,K ~^> D ,K ~^> E] + evalfbb8in> [B ~=> D ,K ~=> E ,A ~+> 0.0.0.0 ,A ~+> tick ,B ~+> D ,B ~+> 0.0.0.0 ,B ~+> 0.0.0.0.0 ,B ~+> tick ,C ~+> C ,C ~+> 0.0.0 ,C ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> C ,A ~*> D ,A ~*> E ,A ~*> 0.0.0 ,A ~*> 0.0.0.0 ,A ~*> 0.0.0.0.0 ,A ~*> tick ,B ~*> D ,B ~*> E ,B ~*> 0.0.0.0 ,B ~*> 0.0.0.0.0 ,B ~*> tick ,C ~*> C ,C ~*> D ,C ~*> tick ,K ~*> C ,K ~*> D ,K ~*> E ,K ~*> 0.0.0.0 ,K ~*> 0.0.0.0.0 ,K ~*> tick ,A ~^> D ,A ~^> E ,B ~^> E ,C ~^> D ,K ~^> E] + evalfbb6in> [K ~=> E ,A ~+> 0.0.0.0 ,A ~+> tick ,B ~+> 0.0.0.0 ,B ~+> tick ,D ~+> D ,D ~+> 0.0.0.0 ,D ~+> 0.0.0.0.0 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> E ,K ~+> 0.0.0.0 ,K ~+> 0.0.0.0.0 ,K ~+> tick ,A ~*> D ,A ~*> E ,A ~*> tick ,B ~*> D ,B ~*> E ,B ~*> tick ,D ~*> D ,D ~*> E ,D ~*> 0.0.0.0.0 ,D ~*> tick ,K ~*> D ,K ~*> E ,K ~*> 0.0.0.0.0 ,K ~*> tick ,A ~^> E ,B ~^> E ,D ~^> E ,K ~^> E] + evalfbb4in> [D ~+> 0.0.0.0.0 ,D ~+> tick ,E ~+> E ,E ~+> 0.0.0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> E ,K ~+> 0.0.0.0.0 ,K ~+> tick ,D ~*> E ,E ~*> E ,K ~*> E] YES(?,POLY)