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

YES(?,O(1))