YES(?,PRIMREC) * Step 1: TrivialSCCs MAYBE + 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) -> evalfbb7in(B,B,0,D,E) True (?,1) 2. evalfbb7in(A,B,C,D,E) -> evalfbbin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && A >= 0 && C >= 0] (?,1) 3. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + A] (?,1) 4. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + C] (?,1) 5. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] (?,1) 6. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] (?,1) 7. evalfbbin(A,B,C,D,E) -> evalfbb6in(A,B,C,A,C) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1) 8. evalfbb3in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && D >= 1 + B] 9. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && B >= D] 10. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] 11. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] 12. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 13. evalfbb2in(A,B,C,D,E) -> evalfbb3in(A,B,C,1 + D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 14. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,-1 + A,D) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 15. evalfbb6in(A,B,C,D,E) -> evalfbb7in(D,B,-1 + E,D,E) [E >= 0 (?,1) && 1 + D + E >= 0 && C + E >= 0 && -1*C + E >= 0 && B + E >= 0 && A + E >= 0 && B + -1*D >= 0 && A + -1*D >= 0 && 1 + D >= 0 && 1 + C + D >= 0 && 1 + B + D >= 0 && 1 + A + D >= 0 && 1 + -1*A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 16. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0] (?,1) Signature: {(evalfbb2in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbbin,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3,4},2->{5,6,7},3->{16},4->{16},5->{8,9},6->{8,9},7->{15},8->{14},9->{10,11,12},10->{13} ,11->{13},12->{14},13->{8,9},14->{15},15->{2,3,4},16->{}] + Applied Processor: TrivialSCCs + Details: All trivial SCCs of the transition graph admit timebound 1. * Step 2: UnsatPaths MAYBE + 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) -> evalfbb7in(B,B,0,D,E) True (1,1) 2. evalfbb7in(A,B,C,D,E) -> evalfbbin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && A >= 0 && C >= 0] (?,1) 3. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + A] (1,1) 4. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + C] (1,1) 5. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] (?,1) 6. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] (?,1) 7. evalfbbin(A,B,C,D,E) -> evalfbb6in(A,B,C,A,C) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1) 8. evalfbb3in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && D >= 1 + B] 9. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && B >= D] 10. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] 11. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] 12. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 13. evalfbb2in(A,B,C,D,E) -> evalfbb3in(A,B,C,1 + D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 14. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,-1 + A,D) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 15. evalfbb6in(A,B,C,D,E) -> evalfbb7in(D,B,-1 + E,D,E) [E >= 0 (?,1) && 1 + D + E >= 0 && C + E >= 0 && -1*C + E >= 0 && B + E >= 0 && A + E >= 0 && B + -1*D >= 0 && A + -1*D >= 0 && 1 + D >= 0 && 1 + C + D >= 0 && 1 + B + D >= 0 && 1 + A + D >= 0 && 1 + -1*A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 16. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0] (1,1) Signature: {(evalfbb2in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbbin,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3,4},2->{5,6,7},3->{16},4->{16},5->{8,9},6->{8,9},7->{15},8->{14},9->{10,11,12},10->{13} ,11->{13},12->{14},13->{8,9},14->{15},15->{2,3,4},16->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,4)] * Step 3: AddSinks MAYBE + 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) -> evalfbb7in(B,B,0,D,E) True (1,1) 2. evalfbb7in(A,B,C,D,E) -> evalfbbin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && A >= 0 && C >= 0] (?,1) 3. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + A] (1,1) 4. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + C] (1,1) 5. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] (?,1) 6. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] (?,1) 7. evalfbbin(A,B,C,D,E) -> evalfbb6in(A,B,C,A,C) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1) 8. evalfbb3in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && D >= 1 + B] 9. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && B >= D] 10. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] 11. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] 12. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 13. evalfbb2in(A,B,C,D,E) -> evalfbb3in(A,B,C,1 + D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 14. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,-1 + A,D) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 15. evalfbb6in(A,B,C,D,E) -> evalfbb7in(D,B,-1 + E,D,E) [E >= 0 (?,1) && 1 + D + E >= 0 && C + E >= 0 && -1*C + E >= 0 && B + E >= 0 && A + E >= 0 && B + -1*D >= 0 && A + -1*D >= 0 && 1 + D >= 0 && 1 + C + D >= 0 && 1 + B + D >= 0 && 1 + A + D >= 0 && 1 + -1*A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 16. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0] (1,1) Signature: {(evalfbb2in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbbin,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5)} Flow Graph: [0->{1},1->{2,3},2->{5,6,7},3->{16},4->{16},5->{8,9},6->{8,9},7->{15},8->{14},9->{10,11,12},10->{13} ,11->{13},12->{14},13->{8,9},14->{15},15->{2,3,4},16->{}] + Applied Processor: AddSinks + Details: () * Step 4: UnsatPaths MAYBE + 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) -> evalfbb7in(B,B,0,D,E) True (?,1) 2. evalfbb7in(A,B,C,D,E) -> evalfbbin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && A >= 0 && C >= 0] (?,1) 3. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + A] (?,1) 4. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + C] (?,1) 5. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] (?,1) 6. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] (?,1) 7. evalfbbin(A,B,C,D,E) -> evalfbb6in(A,B,C,A,C) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1) 8. evalfbb3in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && D >= 1 + B] 9. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && B >= D] 10. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] 11. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] 12. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 13. evalfbb2in(A,B,C,D,E) -> evalfbb3in(A,B,C,1 + D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 14. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,-1 + A,D) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 15. evalfbb6in(A,B,C,D,E) -> evalfbb7in(D,B,-1 + E,D,E) [E >= 0 (?,1) && 1 + D + E >= 0 && C + E >= 0 && -1*C + E >= 0 && B + E >= 0 && A + E >= 0 && B + -1*D >= 0 && A + -1*D >= 0 && 1 + D >= 0 && 1 + C + D >= 0 && 1 + B + D >= 0 && 1 + A + D >= 0 && 1 + -1*A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 16. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0] (?,1) 17. evalfreturnin(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(evalfbb2in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbbin,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2,3,4},2->{5,6,7},3->{16,17},4->{16,17},5->{8,9},6->{8,9},7->{15},8->{14},9->{10,11,12} ,10->{13},11->{13},12->{14},13->{8,9},14->{15},15->{2,3,4},16->{},17->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,4)] * Step 5: LooptreeTransformer MAYBE + 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) -> evalfbb7in(B,B,0,D,E) True (?,1) 2. evalfbb7in(A,B,C,D,E) -> evalfbbin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && A >= 0 && C >= 0] (?,1) 3. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + A] (?,1) 4. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + C] (?,1) 5. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] (?,1) 6. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] (?,1) 7. evalfbbin(A,B,C,D,E) -> evalfbb6in(A,B,C,A,C) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1) 8. evalfbb3in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && D >= 1 + B] 9. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && B >= D] 10. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] 11. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] 12. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 13. evalfbb2in(A,B,C,D,E) -> evalfbb3in(A,B,C,1 + D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 14. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,-1 + A,D) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 15. evalfbb6in(A,B,C,D,E) -> evalfbb7in(D,B,-1 + E,D,E) [E >= 0 (?,1) && 1 + D + E >= 0 && C + E >= 0 && -1*C + E >= 0 && B + E >= 0 && A + E >= 0 && B + -1*D >= 0 && A + -1*D >= 0 && 1 + D >= 0 && 1 + C + D >= 0 && 1 + B + D >= 0 && 1 + A + D >= 0 && 1 + -1*A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 16. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0] (?,1) 17. evalfreturnin(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(evalfbb2in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbbin,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2,3},2->{5,6,7},3->{16,17},4->{16,17},5->{8,9},6->{8,9},7->{15},8->{14},9->{10,11,12},10->{13} ,11->{13},12->{14},13->{8,9},14->{15},15->{2,3,4},16->{},17->{}] + 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,16,17] | `- p:[2,15,7,14,8,5,6,13,10,9,11,12] c: [14] | +- p:[2,15,7] c: [15] | `- p:[9,13,10,11] c: [13] * Step 6: SizeAbstraction MAYBE + 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) -> evalfbb7in(B,B,0,D,E) True (?,1) 2. evalfbb7in(A,B,C,D,E) -> evalfbbin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && A >= 0 && C >= 0] (?,1) 3. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + A] (?,1) 4. evalfbb7in(A,B,C,D,E) -> evalfreturnin(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0 && 0 >= 1 + C] (?,1) 5. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] (?,1) 6. evalfbbin(A,B,C,D,E) -> evalfbb3in(A,B,C,C,E) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] (?,1) 7. evalfbbin(A,B,C,D,E) -> evalfbb6in(A,B,C,A,C) [C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] (?,1) 8. evalfbb3in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && D >= 1 + B] 9. evalfbb3in(A,B,C,D,E) -> evalfbb4in(A,B,C,D,E) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && B >= D] 10. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && 0 >= 1 + F] 11. evalfbb4in(A,B,C,D,E) -> evalfbb2in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0 && F >= 1] 12. evalfbb4in(A,B,C,D,E) -> evalfbb5in(A,B,C,D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 13. evalfbb2in(A,B,C,D,E) -> evalfbb3in(A,B,C,1 + D,E) [B + -1*D >= 0 (?,1) && D >= 0 && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && B + -1*C >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 14. evalfbb5in(A,B,C,D,E) -> evalfbb6in(A,B,C,-1 + A,D) [D >= 0 (?,1) && C + D >= 0 && -1*C + D >= 0 && B + D >= 0 && A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 15. evalfbb6in(A,B,C,D,E) -> evalfbb7in(D,B,-1 + E,D,E) [E >= 0 (?,1) && 1 + D + E >= 0 && C + E >= 0 && -1*C + E >= 0 && B + E >= 0 && A + E >= 0 && B + -1*D >= 0 && A + -1*D >= 0 && 1 + D >= 0 && 1 + C + D >= 0 && 1 + B + D >= 0 && 1 + A + D >= 0 && 1 + -1*A + D >= 0 && C >= 0 && B + C >= 0 && A + C >= 0 && B >= 0 && A + B >= 0 && -1*A + B >= 0 && A >= 0] 16. evalfreturnin(A,B,C,D,E) -> evalfstop(A,B,C,D,E) [1 + C >= 0 && -1*A + B >= 0] (?,1) 17. evalfreturnin(A,B,C,D,E) -> exitus616(A,B,C,D,E) True (?,1) Signature: {(evalfbb2in,5) ;(evalfbb3in,5) ;(evalfbb4in,5) ;(evalfbb5in,5) ;(evalfbb6in,5) ;(evalfbb7in,5) ;(evalfbbin,5) ;(evalfentryin,5) ;(evalfreturnin,5) ;(evalfstart,5) ;(evalfstop,5) ;(exitus616,5)} Flow Graph: [0->{1},1->{2,3},2->{5,6,7},3->{16,17},4->{16,17},5->{8,9},6->{8,9},7->{15},8->{14},9->{10,11,12},10->{13} ,11->{13},12->{14},13->{8,9},14->{15},15->{2,3,4},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:[2,15,7,14,8,5,6,13,10,9,11,12] c: [14] | +- p:[2,15,7] c: [15] | `- p:[9,13,10,11] c: [13]) + Applied Processor: SizeAbstraction UseCFG Minimize + Details: () * Step 7: FlowAbstraction MAYBE + Considered Problem: Program: Domain: [A,B,C,D,E,0.0,0.0.0,0.0.1] evalfstart ~> evalfentryin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfentryin ~> evalfbb7in [A <= B, B <= B, C <= 0*K, D <= D, E <= E] evalfbb7in ~> evalfbbin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb7in ~> evalfreturnin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb7in ~> evalfreturnin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbbin ~> evalfbb3in [A <= A, B <= B, C <= C, D <= C, E <= E] evalfbbin ~> evalfbb3in [A <= A, B <= B, C <= C, D <= C, E <= E] evalfbbin ~> evalfbb6in [A <= A, B <= B, C <= C, D <= A, E <= C] evalfbb3in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb2in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb2in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb2in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= K + B, E <= D] evalfbb6in ~> evalfbb7in [A <= D, B <= B, C <= K + E, 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 <= K + A + D] evalfbb7in ~> evalfbbin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in ~> evalfbb7in [A <= D, B <= B, C <= K + E, D <= D, E <= E] evalfbbin ~> evalfbb6in [A <= A, B <= B, C <= C, D <= A, E <= C] evalfbb5in ~> evalfbb6in [A <= A, B <= B, C <= C, D <= K + B, E <= D] evalfbb3in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbbin ~> evalfbb3in [A <= A, B <= B, C <= C, D <= C, E <= E] evalfbbin ~> evalfbb3in [A <= A, B <= B, C <= C, D <= C, E <= E] evalfbb2in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb4in ~> evalfbb2in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb2in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb5in [A <= A, B <= B, C <= C, D <= D, E <= E] + Loop: [0.0.0 <= K + C + E] evalfbb7in ~> evalfbbin [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb6in ~> evalfbb7in [A <= D, B <= B, C <= K + E, D <= D, E <= E] evalfbbin ~> evalfbb6in [A <= A, B <= B, C <= C, D <= A, E <= C] + Loop: [0.0.1 <= K + B + D] evalfbb3in ~> evalfbb4in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb2in ~> evalfbb3in [A <= A, B <= B, C <= C, D <= K + D, E <= E] evalfbb4in ~> evalfbb2in [A <= A, B <= B, C <= C, D <= D, E <= E] evalfbb4in ~> evalfbb2in [A <= A, B <= B, C <= C, D <= D, E <= E] + Applied Processor: FlowAbstraction + Details: () * Step 8: LareProcessor MAYBE + Considered Problem: Program: Domain: [tick,huge,K,A,B,C,D,E,0.0,0.0.0,0.0.1] evalfstart ~> evalfentryin [] evalfentryin ~> evalfbb7in [B ~=> A,K ~=> C] evalfbb7in ~> evalfbbin [] evalfbb7in ~> evalfreturnin [] evalfbb7in ~> evalfreturnin [] evalfbbin ~> evalfbb3in [C ~=> D] evalfbbin ~> evalfbb3in [C ~=> D] evalfbbin ~> evalfbb6in [A ~=> D,C ~=> E] evalfbb3in ~> evalfbb5in [] evalfbb3in ~> evalfbb4in [] evalfbb4in ~> evalfbb2in [] evalfbb4in ~> evalfbb2in [] evalfbb4in ~> evalfbb5in [] evalfbb2in ~> evalfbb3in [D ~+> D,K ~+> D] evalfbb5in ~> evalfbb6in [D ~=> E,B ~+> D,K ~+> D] evalfbb6in ~> evalfbb7in [D ~=> A,E ~+> C,K ~+> C] evalfreturnin ~> evalfstop [] evalfreturnin ~> exitus616 [] + Loop: [A ~+> 0.0,D ~+> 0.0,K ~+> 0.0] evalfbb7in ~> evalfbbin [] evalfbb6in ~> evalfbb7in [D ~=> A,E ~+> C,K ~+> C] evalfbbin ~> evalfbb6in [A ~=> D,C ~=> E] evalfbb5in ~> evalfbb6in [D ~=> E,B ~+> D,K ~+> D] evalfbb3in ~> evalfbb5in [] evalfbbin ~> evalfbb3in [C ~=> D] evalfbbin ~> evalfbb3in [C ~=> D] evalfbb2in ~> evalfbb3in [D ~+> D,K ~+> D] evalfbb4in ~> evalfbb2in [] evalfbb3in ~> evalfbb4in [] evalfbb4in ~> evalfbb2in [] evalfbb4in ~> evalfbb5in [] + Loop: [C ~+> 0.0.0,E ~+> 0.0.0,K ~+> 0.0.0] evalfbb7in ~> evalfbbin [] evalfbb6in ~> evalfbb7in [D ~=> A,E ~+> C,K ~+> C] evalfbbin ~> evalfbb6in [A ~=> D,C ~=> E] + Loop: [B ~+> 0.0.1,D ~+> 0.0.1,K ~+> 0.0.1] evalfbb3in ~> evalfbb4in [] evalfbb2in ~> evalfbb3in [D ~+> D,K ~+> D] evalfbb4in ~> evalfbb2in [] evalfbb4in ~> evalfbb2in [] + Applied Processor: LareProcessor + Details: evalfstart ~> exitus616 [B ~=> A ,B ~=> D ,D ~=> A ,K ~=> C ,K ~=> E ,B ~+> A ,B ~+> D ,B ~+> 0.0 ,B ~+> 0.0.1 ,B ~+> tick ,D ~+> 0.0 ,D ~+> tick ,E ~+> C ,E ~+> E ,E ~+> 0.0.0 ,E ~+> 0.0.1 ,E ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.1 ,K ~+> tick ,B ~*> C ,B ~*> E ,B ~*> 0.0.0 ,B ~*> 0.0.1 ,B ~*> tick ,D ~*> C ,D ~*> E ,D ~*> 0.0.0 ,D ~*> 0.0.1 ,D ~*> tick ,E ~*> C ,E ~*> E ,E ~*> 0.0.0 ,E ~*> 0.0.1 ,E ~*> tick ,K ~*> C ,K ~*> E ,K ~*> 0.0.0 ,K ~*> 0.0.1 ,K ~*> tick ,B ~^> C ,B ~^> E ,B ~^> 0.0.0 ,B ~^> 0.0.1 ,B ~^> tick ,D ~^> C ,D ~^> E ,D ~^> 0.0.0 ,D ~^> 0.0.1 ,D ~^> tick ,K ~^> C ,K ~^> E ,K ~^> 0.0.0 ,K ~^> 0.0.1 ,K ~^> tick] evalfstart ~> evalfstop [B ~=> A ,B ~=> D ,D ~=> A ,K ~=> C ,K ~=> E ,B ~+> A ,B ~+> D ,B ~+> 0.0 ,B ~+> 0.0.1 ,B ~+> tick ,D ~+> 0.0 ,D ~+> tick ,E ~+> C ,E ~+> E ,E ~+> 0.0.0 ,E ~+> 0.0.1 ,E ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.1 ,K ~+> tick ,B ~*> C ,B ~*> E ,B ~*> 0.0.0 ,B ~*> 0.0.1 ,B ~*> tick ,D ~*> C ,D ~*> E ,D ~*> 0.0.0 ,D ~*> 0.0.1 ,D ~*> tick ,E ~*> C ,E ~*> E ,E ~*> 0.0.0 ,E ~*> 0.0.1 ,E ~*> tick ,K ~*> C ,K ~*> E ,K ~*> 0.0.0 ,K ~*> 0.0.1 ,K ~*> tick ,B ~^> C ,B ~^> E ,B ~^> 0.0.0 ,B ~^> 0.0.1 ,B ~^> tick ,D ~^> C ,D ~^> E ,D ~^> 0.0.0 ,D ~^> 0.0.1 ,D ~^> tick ,K ~^> C ,K ~^> E ,K ~^> 0.0.0 ,K ~^> 0.0.1 ,K ~^> tick] + evalfbb7in> [A ~=> D ,C ~=> E ,D ~=> A ,A ~+> 0.0 ,A ~+> tick ,B ~+> A ,B ~+> D ,B ~+> 0.0.1 ,B ~+> tick ,C ~+> C ,C ~+> E ,C ~+> 0.0.0 ,C ~+> 0.0.1 ,C ~+> tick ,D ~+> 0.0 ,D ~+> tick ,E ~+> C ,E ~+> E ,E ~+> 0.0.0 ,E ~+> 0.0.1 ,E ~+> tick ,tick ~+> tick ,K ~+> A ,K ~+> C ,K ~+> D ,K ~+> E ,K ~+> 0.0 ,K ~+> 0.0.0 ,K ~+> 0.0.1 ,K ~+> tick ,A ~*> C ,A ~*> E ,A ~*> 0.0.0 ,A ~*> 0.0.1 ,A ~*> tick ,B ~*> C ,B ~*> E ,B ~*> 0.0.0 ,B ~*> 0.0.1 ,B ~*> tick ,C ~*> C ,C ~*> E ,C ~*> 0.0.0 ,C ~*> 0.0.1 ,C ~*> tick ,D ~*> C ,D ~*> E ,D ~*> 0.0.0 ,D ~*> 0.0.1 ,D ~*> tick ,E ~*> C ,E ~*> E ,E ~*> 0.0.0 ,E ~*> 0.0.1 ,E ~*> tick ,K ~*> C ,K ~*> E ,K ~*> 0.0.0 ,K ~*> 0.0.1 ,K ~*> tick ,A ~^> C ,A ~^> E ,A ~^> 0.0.0 ,A ~^> 0.0.1 ,A ~^> tick ,D ~^> C ,D ~^> E ,D ~^> 0.0.0 ,D ~^> 0.0.1 ,D ~^> tick ,K ~^> C ,K ~^> E ,K ~^> 0.0.0 ,K ~^> 0.0.1 ,K ~^> tick] + evalfbbin> [D ~=> A ,C ~+> 0.0.0 ,C ~+> tick ,E ~+> C ,E ~+> E ,E ~+> 0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> E ,K ~+> 0.0.0 ,K ~+> tick ,C ~*> C ,C ~*> E ,E ~*> C ,E ~*> E ,K ~*> C ,K ~*> E] evalfbb7in> [D ~=> A ,C ~+> 0.0.0 ,C ~+> tick ,E ~+> C ,E ~+> E ,E ~+> 0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> E ,K ~+> 0.0.0 ,K ~+> tick ,C ~*> C ,C ~*> E ,E ~*> C ,E ~*> E ,K ~*> C ,K ~*> E] evalfbbin> [A ~=> D ,C ~=> E ,C ~+> C ,C ~+> E ,C ~+> 0.0.0 ,C ~+> tick ,E ~+> 0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> E ,K ~+> 0.0.0 ,K ~+> tick ,C ~*> C ,E ~*> C ,K ~*> C ,K ~*> E] evalfbb7in> [A ~=> D ,C ~=> E ,C ~+> C ,C ~+> E ,C ~+> 0.0.0 ,C ~+> tick ,E ~+> 0.0.0 ,E ~+> tick ,tick ~+> tick ,K ~+> C ,K ~+> E ,K ~+> 0.0.0 ,K ~+> tick ,C ~*> C ,C ~*> E ,E ~*> C ,E ~*> E ,K ~*> C ,K ~*> E] + evalfbb4in> [B ~+> 0.0.1 ,B ~+> tick ,D ~+> D ,D ~+> 0.0.1 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> 0.0.1 ,K ~+> tick ,B ~*> D ,D ~*> D ,K ~*> D] evalfbb3in> [B ~+> 0.0.1 ,B ~+> tick ,D ~+> D ,D ~+> 0.0.1 ,D ~+> tick ,tick ~+> tick ,K ~+> D ,K ~+> 0.0.1 ,K ~+> tick ,B ~*> D ,D ~*> D ,K ~*> D] YES(?,PRIMREC)