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

YES(?,O(n^1))