YES(?,O(1))
* Step 1: ArgumentFilter WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B,C) -> f5(A,0,C)         [A >= 128]                                                    (1,1)
          1. f0(A,B,C) -> f7(A,0,D)         [127 >= A]                                                    (1,1)
          2. f7(A,B,C) -> f7(A,1 + B,1 + C) [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && 35 >= B] (?,1)
          3. f7(A,B,C) -> f5(A,B,C)         [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && B >= 36] (?,1)
        Signature:
          {(f0,3);(f5,3);(f7,3)}
        Flow Graph:
          [0->{},1->{2,3},2->{2,3},3->{}]
        
    + Applied Processor:
        ArgumentFilter [2]
    + Details:
        We remove following argument positions: [2].
* Step 2: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f5(A,0)     [A >= 128]                                                    (1,1)
          1. f0(A,B) -> f7(A,0)     [127 >= A]                                                    (1,1)
          2. f7(A,B) -> f7(A,1 + B) [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && 35 >= B] (?,1)
          3. f7(A,B) -> f5(A,B)     [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && B >= 36] (?,1)
        Signature:
          {(f0,3);(f5,3);(f7,3)}
        Flow Graph:
          [0->{},1->{2,3},2->{2,3},3->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,3)]
* Step 3: FromIts WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f5(A,0)     [A >= 128]                                                    (1,1)
          1. f0(A,B) -> f7(A,0)     [127 >= A]                                                    (1,1)
          2. f7(A,B) -> f7(A,1 + B) [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && 35 >= B] (?,1)
          3. f7(A,B) -> f5(A,B)     [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && B >= 36] (?,1)
        Signature:
          {(f0,3);(f5,3);(f7,3)}
        Flow Graph:
          [0->{},1->{2},2->{2,3},3->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: AddSinks WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          f0(A,B) -> f5(A,0)      [A >= 128]
          f0(A,B) -> f7(A,0)      [127 >= A]
          f7(A,B) -> f7(A,1 + B)  [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && 35 >= B]
          f7(A,B) -> f5(A,B)      [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && B >= 36]
        Signature:
          {(f0,3);(f5,3);(f7,3)}
        Rule Graph:
          [0->{},1->{2},2->{2,3},3->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Decompose WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          f0(A,B) -> f5(A,0)         [A >= 128]
          f0(A,B) -> f7(A,0)         [127 >= A]
          f7(A,B) -> f7(A,1 + B)     [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && 35 >= B]
          f7(A,B) -> f5(A,B)         [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && B >= 36]
          f5(A,B) -> exitus616(A,B)  True
          f5(A,B) -> exitus616(A,B)  True
        Signature:
          {(exitus616,2);(f0,3);(f5,3);(f7,3)}
        Rule Graph:
          [0->{5},1->{2},2->{2,3},3->{4}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[2] c: [2]
* Step 6: AbstractSize WORST_CASE(?,O(1))
    + Considered Problem:
        (Rules:
          f0(A,B) -> f5(A,0)         [A >= 128]
          f0(A,B) -> f7(A,0)         [127 >= A]
          f7(A,B) -> f7(A,1 + B)     [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && 35 >= B]
          f7(A,B) -> f5(A,B)         [B >= 0 && 127 + -1*A + B >= 0 && 127 + -1*A >= 0 && B >= 36]
          f5(A,B) -> exitus616(A,B)  True
          f5(A,B) -> exitus616(A,B)  True
        Signature:
          {(exitus616,2);(f0,3);(f5,3);(f7,3)}
        Rule Graph:
          [0->{5},1->{2},2->{2,3},3->{4}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[2] c: [2])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 7: AbstractFlow WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           f0  ~>  f5          [A <= A, B <= 0*K]
           f0  ~>  f7          [A <= A, B <= 0*K]
           f7  ~>  f7          [A <= A, B <= 36*K]
           f7  ~>  f5          [A <= A, B <= B]
           f5  ~>  exitus616   [A <= A, B <= B]
           f5  ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= 35*K + B]
               f7  ~>  f7   [A <= A, B <= 36*K]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 8: Lare WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           f0  ~>  f5          [K ~=> B]
           f0  ~>  f7          [K ~=> B]
           f7  ~>  f7          [K ~=> B]
           f7  ~>  f5          []
           f5  ~>  exitus616   []
           f5  ~>  exitus616   []
          + Loop: [B ~+> 0.0,K ~*> 0.0]
               f7  ~>  f7   [K ~=> B]
    + Applied Processor:
        Lare
    + Details:
         f0  ~>  exitus616   [K ~=> B,tick ~+> tick,K ~+> 0.0,K ~+> tick,K ~*> 0.0,K ~*> tick]
        + <f7  ~>  f7>  [K ~=> B,B ~+> 0.0,B ~+> tick,tick ~+> tick,K ~*> 0.0,K ~*> tick]

YES(?,O(1))