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

YES(?,O(1))