YES(?,O(1))
* Step 1: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. eval(A,B)  -> eval(B,A) [A >= 1 + B] (?,1)
          1. start(A,B) -> eval(A,B) True         (1,1)
        Signature:
          {(eval,2);(start,2)}
        Flow Graph:
          [0->{0},1->{0}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,0)]
* Step 2: AddSinks WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. eval(A,B)  -> eval(B,A) [A >= 1 + B] (?,1)
          1. start(A,B) -> eval(A,B) True         (1,1)
        Signature:
          {(eval,2);(start,2)}
        Flow Graph:
          [0->{},1->{0}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. eval(A,B)  -> eval(B,A)      [A >= 1 + B] (?,1)
          1. start(A,B) -> eval(A,B)      True         (1,1)
          2. eval(A,B)  -> exitus616(A,B) True         (?,1)
        Signature:
          {(eval,2);(exitus616,2);(start,2)}
        Flow Graph:
          [0->{0,2},1->{0,2},2->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,0)]
* Step 4: LooptreeTransformer WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. eval(A,B)  -> eval(B,A)      [A >= 1 + B] (?,1)
          1. start(A,B) -> eval(A,B)      True         (1,1)
          2. eval(A,B)  -> exitus616(A,B) True         (?,1)
        Signature:
          {(eval,2);(exitus616,2);(start,2)}
        Flow Graph:
          [0->{2},1->{0,2},2->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2]
* Step 5: SizeAbstraction WORST_CASE(?,O(1))
    + Considered Problem:
        (Rules:
          0. eval(A,B)  -> eval(B,A)      [A >= 1 + B] (?,1)
          1. start(A,B) -> eval(A,B)      True         (1,1)
          2. eval(A,B)  -> exitus616(A,B) True         (?,1)
        Signature:
          {(eval,2);(exitus616,2);(start,2)}
        Flow Graph:
          [0->{2},1->{0,2},2->{}]
        
        ,We construct a looptree:
          P: [0,1,2])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 6: FlowAbstraction WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [A,B]
           eval   ~>  eval        [A <= B, B <= A]
           start  ~>  eval        [A <= A, B <= B]
           eval   ~>  exitus616   [A <= A, B <= B]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 7: LareProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B]
           eval   ~>  eval        [A ~=> B,B ~=> A]
           start  ~>  eval        []
           eval   ~>  exitus616   []
    + Applied Processor:
        LareProcessor
    + Details:
         start  ~>  exitus616   [A ~=> B,B ~=> A]

YES(?,O(1))