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

YES(?,O(1))