YES(?,O(1))
* Step 1: TrivialSCCs WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. evaleasy1start(A,B)    -> evaleasy1entryin(A,B)   True         (1,1)
          1. evaleasy1entryin(A,B)  -> evaleasy1bb3in(0,B)     True         (?,1)
          2. evaleasy1bb3in(A,B)    -> evaleasy1bbin(A,B)      [39 >= A]    (?,1)
          3. evaleasy1bb3in(A,B)    -> evaleasy1returnin(A,B)  [A >= 40]    (?,1)
          4. evaleasy1bbin(A,B)     -> evaleasy1bb1in(A,B)     [B = 0]      (?,1)
          5. evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [0 >= 1 + B] (?,1)
          6. evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [B >= 1]     (?,1)
          7. evaleasy1bb1in(A,B)    -> evaleasy1bb3in(1 + A,B) True         (?,1)
          8. evaleasy1bb2in(A,B)    -> evaleasy1bb3in(2 + A,B) True         (?,1)
          9. evaleasy1returnin(A,B) -> evaleasy1stop(A,B)      True         (?,1)
        Signature:
          {(evaleasy1bb1in,2)
          ;(evaleasy1bb2in,2)
          ;(evaleasy1bb3in,2)
          ;(evaleasy1bbin,2)
          ;(evaleasy1entryin,2)
          ;(evaleasy1returnin,2)
          ;(evaleasy1start,2)
          ;(evaleasy1stop,2)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5,6},3->{9},4->{7},5->{8},6->{8},7->{2,3},8->{2,3},9->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. evaleasy1start(A,B)    -> evaleasy1entryin(A,B)   True         (1,1)
          1. evaleasy1entryin(A,B)  -> evaleasy1bb3in(0,B)     True         (1,1)
          2. evaleasy1bb3in(A,B)    -> evaleasy1bbin(A,B)      [39 >= A]    (?,1)
          3. evaleasy1bb3in(A,B)    -> evaleasy1returnin(A,B)  [A >= 40]    (1,1)
          4. evaleasy1bbin(A,B)     -> evaleasy1bb1in(A,B)     [B = 0]      (?,1)
          5. evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [0 >= 1 + B] (?,1)
          6. evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [B >= 1]     (?,1)
          7. evaleasy1bb1in(A,B)    -> evaleasy1bb3in(1 + A,B) True         (?,1)
          8. evaleasy1bb2in(A,B)    -> evaleasy1bb3in(2 + A,B) True         (?,1)
          9. evaleasy1returnin(A,B) -> evaleasy1stop(A,B)      True         (1,1)
        Signature:
          {(evaleasy1bb1in,2)
          ;(evaleasy1bb2in,2)
          ;(evaleasy1bb3in,2)
          ;(evaleasy1bbin,2)
          ;(evaleasy1entryin,2)
          ;(evaleasy1returnin,2)
          ;(evaleasy1start,2)
          ;(evaleasy1stop,2)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5,6},3->{9},4->{7},5->{8},6->{8},7->{2,3},8->{2,3},9->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,3)]
* Step 3: AddSinks WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. evaleasy1start(A,B)    -> evaleasy1entryin(A,B)   True         (1,1)
          1. evaleasy1entryin(A,B)  -> evaleasy1bb3in(0,B)     True         (1,1)
          2. evaleasy1bb3in(A,B)    -> evaleasy1bbin(A,B)      [39 >= A]    (?,1)
          3. evaleasy1bb3in(A,B)    -> evaleasy1returnin(A,B)  [A >= 40]    (1,1)
          4. evaleasy1bbin(A,B)     -> evaleasy1bb1in(A,B)     [B = 0]      (?,1)
          5. evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [0 >= 1 + B] (?,1)
          6. evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [B >= 1]     (?,1)
          7. evaleasy1bb1in(A,B)    -> evaleasy1bb3in(1 + A,B) True         (?,1)
          8. evaleasy1bb2in(A,B)    -> evaleasy1bb3in(2 + A,B) True         (?,1)
          9. evaleasy1returnin(A,B) -> evaleasy1stop(A,B)      True         (1,1)
        Signature:
          {(evaleasy1bb1in,2)
          ;(evaleasy1bb2in,2)
          ;(evaleasy1bb3in,2)
          ;(evaleasy1bbin,2)
          ;(evaleasy1entryin,2)
          ;(evaleasy1returnin,2)
          ;(evaleasy1start,2)
          ;(evaleasy1stop,2)}
        Flow Graph:
          [0->{1},1->{2},2->{4,5,6},3->{9},4->{7},5->{8},6->{8},7->{2,3},8->{2,3},9->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0.  evaleasy1start(A,B)    -> evaleasy1entryin(A,B)   True         (1,1)
          1.  evaleasy1entryin(A,B)  -> evaleasy1bb3in(0,B)     True         (?,1)
          2.  evaleasy1bb3in(A,B)    -> evaleasy1bbin(A,B)      [39 >= A]    (?,1)
          3.  evaleasy1bb3in(A,B)    -> evaleasy1returnin(A,B)  [A >= 40]    (?,1)
          4.  evaleasy1bbin(A,B)     -> evaleasy1bb1in(A,B)     [B = 0]      (?,1)
          5.  evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [0 >= 1 + B] (?,1)
          6.  evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [B >= 1]     (?,1)
          7.  evaleasy1bb1in(A,B)    -> evaleasy1bb3in(1 + A,B) True         (?,1)
          8.  evaleasy1bb2in(A,B)    -> evaleasy1bb3in(2 + A,B) True         (?,1)
          9.  evaleasy1returnin(A,B) -> evaleasy1stop(A,B)      True         (?,1)
          10. evaleasy1returnin(A,B) -> exitus616(A,B)          True         (?,1)
        Signature:
          {(evaleasy1bb1in,2)
          ;(evaleasy1bb2in,2)
          ;(evaleasy1bb3in,2)
          ;(evaleasy1bbin,2)
          ;(evaleasy1entryin,2)
          ;(evaleasy1returnin,2)
          ;(evaleasy1start,2)
          ;(evaleasy1stop,2)
          ;(exitus616,2)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5,6},3->{9,10},4->{7},5->{8},6->{8},7->{2,3},8->{2,3},9->{},10->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,3)]
* Step 5: LooptreeTransformer WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0.  evaleasy1start(A,B)    -> evaleasy1entryin(A,B)   True         (1,1)
          1.  evaleasy1entryin(A,B)  -> evaleasy1bb3in(0,B)     True         (?,1)
          2.  evaleasy1bb3in(A,B)    -> evaleasy1bbin(A,B)      [39 >= A]    (?,1)
          3.  evaleasy1bb3in(A,B)    -> evaleasy1returnin(A,B)  [A >= 40]    (?,1)
          4.  evaleasy1bbin(A,B)     -> evaleasy1bb1in(A,B)     [B = 0]      (?,1)
          5.  evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [0 >= 1 + B] (?,1)
          6.  evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [B >= 1]     (?,1)
          7.  evaleasy1bb1in(A,B)    -> evaleasy1bb3in(1 + A,B) True         (?,1)
          8.  evaleasy1bb2in(A,B)    -> evaleasy1bb3in(2 + A,B) True         (?,1)
          9.  evaleasy1returnin(A,B) -> evaleasy1stop(A,B)      True         (?,1)
          10. evaleasy1returnin(A,B) -> exitus616(A,B)          True         (?,1)
        Signature:
          {(evaleasy1bb1in,2)
          ;(evaleasy1bb2in,2)
          ;(evaleasy1bb3in,2)
          ;(evaleasy1bbin,2)
          ;(evaleasy1entryin,2)
          ;(evaleasy1returnin,2)
          ;(evaleasy1start,2)
          ;(evaleasy1stop,2)
          ;(exitus616,2)}
        Flow Graph:
          [0->{1},1->{2},2->{4,5,6},3->{9,10},4->{7},5->{8},6->{8},7->{2,3},8->{2,3},9->{},10->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8,9,10]
          |
          `- p:[2,7,4,8,5,6] c: [2]
* Step 6: SizeAbstraction WORST_CASE(?,O(1))
    + Considered Problem:
        (Rules:
          0.  evaleasy1start(A,B)    -> evaleasy1entryin(A,B)   True         (1,1)
          1.  evaleasy1entryin(A,B)  -> evaleasy1bb3in(0,B)     True         (?,1)
          2.  evaleasy1bb3in(A,B)    -> evaleasy1bbin(A,B)      [39 >= A]    (?,1)
          3.  evaleasy1bb3in(A,B)    -> evaleasy1returnin(A,B)  [A >= 40]    (?,1)
          4.  evaleasy1bbin(A,B)     -> evaleasy1bb1in(A,B)     [B = 0]      (?,1)
          5.  evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [0 >= 1 + B] (?,1)
          6.  evaleasy1bbin(A,B)     -> evaleasy1bb2in(A,B)     [B >= 1]     (?,1)
          7.  evaleasy1bb1in(A,B)    -> evaleasy1bb3in(1 + A,B) True         (?,1)
          8.  evaleasy1bb2in(A,B)    -> evaleasy1bb3in(2 + A,B) True         (?,1)
          9.  evaleasy1returnin(A,B) -> evaleasy1stop(A,B)      True         (?,1)
          10. evaleasy1returnin(A,B) -> exitus616(A,B)          True         (?,1)
        Signature:
          {(evaleasy1bb1in,2)
          ;(evaleasy1bb2in,2)
          ;(evaleasy1bb3in,2)
          ;(evaleasy1bbin,2)
          ;(evaleasy1entryin,2)
          ;(evaleasy1returnin,2)
          ;(evaleasy1start,2)
          ;(evaleasy1stop,2)
          ;(exitus616,2)}
        Flow Graph:
          [0->{1},1->{2},2->{4,5,6},3->{9,10},4->{7},5->{8},6->{8},7->{2,3},8->{2,3},9->{},10->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8,9,10]
          |
          `- p:[2,7,4,8,5,6] c: [2])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 7: FlowAbstraction WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           evaleasy1start     ~>  evaleasy1entryin    [A <= A, B <= B]
           evaleasy1entryin   ~>  evaleasy1bb3in      [A <= 0*K, B <= B]
           evaleasy1bb3in     ~>  evaleasy1bbin       [A <= A, B <= B]
           evaleasy1bb3in     ~>  evaleasy1returnin   [A <= A, B <= B]
           evaleasy1bbin      ~>  evaleasy1bb1in      [A <= A, B <= B]
           evaleasy1bbin      ~>  evaleasy1bb2in      [A <= A, B <= B]
           evaleasy1bbin      ~>  evaleasy1bb2in      [A <= A, B <= B]
           evaleasy1bb1in     ~>  evaleasy1bb3in      [A <= K + A, B <= B]
           evaleasy1bb2in     ~>  evaleasy1bb3in      [A <= 2*K + A, B <= B]
           evaleasy1returnin  ~>  evaleasy1stop       [A <= A, B <= B]
           evaleasy1returnin  ~>  exitus616           [A <= A, B <= B]
          + Loop: [0.0 <= 40*K + A]
               evaleasy1bb3in  ~>  evaleasy1bbin    [A <= A, B <= B]
               evaleasy1bb1in  ~>  evaleasy1bb3in   [A <= K + A, B <= B]
               evaleasy1bbin   ~>  evaleasy1bb1in   [A <= A, B <= B]
               evaleasy1bb2in  ~>  evaleasy1bb3in   [A <= 2*K + A, B <= B]
               evaleasy1bbin   ~>  evaleasy1bb2in   [A <= A, B <= B]
               evaleasy1bbin   ~>  evaleasy1bb2in   [A <= A, B <= B]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 8: LareProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           evaleasy1start     ~>  evaleasy1entryin    []
           evaleasy1entryin   ~>  evaleasy1bb3in      [K ~=> A]
           evaleasy1bb3in     ~>  evaleasy1bbin       []
           evaleasy1bb3in     ~>  evaleasy1returnin   []
           evaleasy1bbin      ~>  evaleasy1bb1in      []
           evaleasy1bbin      ~>  evaleasy1bb2in      []
           evaleasy1bbin      ~>  evaleasy1bb2in      []
           evaleasy1bb1in     ~>  evaleasy1bb3in      [A ~+> A,K ~+> A]
           evaleasy1bb2in     ~>  evaleasy1bb3in      [A ~+> A,K ~*> A]
           evaleasy1returnin  ~>  evaleasy1stop       []
           evaleasy1returnin  ~>  exitus616           []
          + Loop: [A ~+> 0.0,K ~*> 0.0]
               evaleasy1bb3in  ~>  evaleasy1bbin    []
               evaleasy1bb1in  ~>  evaleasy1bb3in   [A ~+> A,K ~+> A]
               evaleasy1bbin   ~>  evaleasy1bb1in   []
               evaleasy1bb2in  ~>  evaleasy1bb3in   [A ~+> A,K ~*> A]
               evaleasy1bbin   ~>  evaleasy1bb2in   []
               evaleasy1bbin   ~>  evaleasy1bb2in   []
    + Applied Processor:
        LareProcessor
    + Details:
         evaleasy1start  ~>  exitus616       [K ~=> A
                                             ,tick ~+> tick
                                             ,K ~+> A
                                             ,K ~+> 0.0
                                             ,K ~+> tick
                                             ,K ~*> A
                                             ,K ~*> 0.0
                                             ,K ~*> tick]
         evaleasy1start  ~>  evaleasy1stop   [K ~=> A
                                             ,tick ~+> tick
                                             ,K ~+> A
                                             ,K ~+> 0.0
                                             ,K ~+> tick
                                             ,K ~*> A
                                             ,K ~*> 0.0
                                             ,K ~*> tick]
        + <evaleasy1bb3in  ~>  evaleasy1bb3in>  [A ~+> A
                                                ,A ~+> 0.0
                                                ,A ~+> tick
                                                ,tick ~+> tick
                                                ,K ~+> A
                                                ,A ~*> A
                                                ,K ~*> A
                                                ,K ~*> 0.0
                                                ,K ~*> tick]

YES(?,O(1))