YES(?,POLY)
* Step 1: UnsatRules WORST_CASE(?,POLY)
    + Considered Problem:
        Rules:
          0. eval(A,B)  -> eval(A + -1*B,B) [A >= 1 + B && A >= 1 && B >= 1]               (?,1)
          1. eval(A,B)  -> eval(A + -1*B,B) [B >= 1 + A && A >= 1 && B >= 1 && A >= 1 + B] (?,1)
          2. eval(A,B)  -> eval(A,-1*A + B) [A >= 1 + B && A >= 1 && B >= 1 && B >= A]     (?,1)
          3. eval(A,B)  -> eval(A,-1*A + B) [B >= 1 + A && A >= 1 && B >= 1 && B >= A]     (?,1)
          4. start(A,B) -> eval(A,B)        True                                           (1,1)
        Signature:
          {(eval,2);(start,2)}
        Flow Graph:
          [0->{0,1,2,3},1->{0,1,2,3},2->{0,1,2,3},3->{0,1,2,3},4->{0,1,2,3}]
        
    + Applied Processor:
        UnsatRules
    + Details:
        Following transitions have unsatisfiable constraints and are removed:  [1,2]
* Step 2: AddSinks WORST_CASE(?,POLY)
    + Considered Problem:
        Rules:
          0. eval(A,B)  -> eval(A + -1*B,B) [A >= 1 + B && A >= 1 && B >= 1]           (?,1)
          3. eval(A,B)  -> eval(A,-1*A + B) [B >= 1 + A && A >= 1 && B >= 1 && B >= A] (?,1)
          4. start(A,B) -> eval(A,B)        True                                       (1,1)
        Signature:
          {(eval,2);(start,2)}
        Flow Graph:
          [0->{0,3},3->{0,3},4->{0,3}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: LooptreeTransformer WORST_CASE(?,POLY)
    + Considered Problem:
        Rules:
          0. eval(A,B)  -> eval(A + -1*B,B) [A >= 1 + B && A >= 1 && B >= 1]           (?,1)
          3. eval(A,B)  -> eval(A,-1*A + B) [B >= 1 + A && A >= 1 && B >= 1 && B >= A] (?,1)
          4. start(A,B) -> eval(A,B)        True                                       (1,1)
          5. eval(A,B)  -> exitus616(A,B)   True                                       (?,1)
        Signature:
          {(eval,2);(exitus616,2);(start,2)}
        Flow Graph:
          [0->{0,3,5},3->{0,3,5},4->{0,3,5},5->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,3,4,5]
          |
          `- p:[0,3] c: [3]
             |
             `- p:[0] c: [0]
* Step 4: SizeAbstraction WORST_CASE(?,POLY)
    + Considered Problem:
        (Rules:
          0. eval(A,B)  -> eval(A + -1*B,B) [A >= 1 + B && A >= 1 && B >= 1]           (?,1)
          3. eval(A,B)  -> eval(A,-1*A + B) [B >= 1 + A && A >= 1 && B >= 1 && B >= A] (?,1)
          4. start(A,B) -> eval(A,B)        True                                       (1,1)
          5. eval(A,B)  -> exitus616(A,B)   True                                       (?,1)
        Signature:
          {(eval,2);(exitus616,2);(start,2)}
        Flow Graph:
          [0->{0,3,5},3->{0,3,5},4->{0,3,5},5->{}]
        
        ,We construct a looptree:
          P: [0,3,4,5]
          |
          `- p:[0,3] c: [3]
             |
             `- p:[0] c: [0])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 5: FlowAbstraction WORST_CASE(?,POLY)
    + Considered Problem:
        Program:
          Domain: [A,B,0.0,0.0.0]
           eval   ~>  eval        [A <= A, B <= B]
           eval   ~>  eval        [A <= A, B <= B]
           start  ~>  eval        [A <= A, B <= B]
           eval   ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= B]
               eval  ~>  eval   [A <= A, B <= B]
               eval  ~>  eval   [A <= A, B <= B]
            + Loop: [0.0.0 <= A]
                 eval  ~>  eval   [A <= A, B <= B]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 6: LareProcessor WORST_CASE(?,POLY)
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0,0.0.0]
           eval   ~>  eval        []
           eval   ~>  eval        []
           start  ~>  eval        []
           eval   ~>  exitus616   []
          + Loop: [B ~=> 0.0]
               eval  ~>  eval   []
               eval  ~>  eval   []
            + Loop: [A ~=> 0.0.0]
                 eval  ~>  eval   []
    + Applied Processor:
        LareProcessor
    + Details:
         start  ~>  exitus616   [A ~=> 0.0.0,B ~=> 0.0,A ~+> tick,B ~+> tick,tick ~+> tick,A ~*> tick,B ~*> tick]
        + <eval  ~>  eval>  [A ~=> 0.0.0,B ~=> 0.0,A ~+> tick,B ~+> tick,tick ~+> tick,A ~*> tick,B ~*> tick]
          + <eval  ~>  eval>  [A ~=> 0.0.0,A ~+> tick,tick ~+> tick]

YES(?,POLY)