YES(?,O(1))
* Step 1: ArgumentFilter WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f3(A,B,C,D) -> f0(0,B,C,D)     True                (1,1)
          1. f0(A,B,C,D) -> f0(1 + A,B,A,D) [A >= 0 && 9 >= A]  (?,1)
          2. f0(A,B,C,D) -> f4(A,E,C,D)     [A >= 0 && A >= 10] (?,1)
        Signature:
          {(f0,4);(f3,4);(f4,4)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        ArgumentFilter [1,2,3]
    + Details:
        We remove following argument positions: [1,2,3].
* Step 2: UnsatPaths WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f3(A) -> f0(0)     True                (1,1)
          1. f0(A) -> f0(1 + A) [A >= 0 && 9 >= A]  (?,1)
          2. f0(A) -> f4(A)     [A >= 0 && A >= 10] (?,1)
        Signature:
          {(f0,4);(f3,4);(f4,4)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,2)]
* Step 3: FromIts WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f3(A) -> f0(0)     True                (1,1)
          1. f0(A) -> f0(1 + A) [A >= 0 && 9 >= A]  (?,1)
          2. f0(A) -> f4(A)     [A >= 0 && A >= 10] (?,1)
        Signature:
          {(f0,4);(f3,4);(f4,4)}
        Flow Graph:
          [0->{1},1->{1,2},2->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: AddSinks WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          f3(A) -> f0(0)      True
          f0(A) -> f0(1 + A)  [A >= 0 && 9 >= A]
          f0(A) -> f4(A)      [A >= 0 && A >= 10]
        Signature:
          {(f0,4);(f3,4);(f4,4)}
        Rule Graph:
          [0->{1},1->{1,2},2->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Decompose WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          f3(A) -> f0(0)         True
          f0(A) -> f0(1 + A)     [A >= 0 && 9 >= A]
          f0(A) -> f4(A)         [A >= 0 && A >= 10]
          f4(A) -> exitus616(A)  True
        Signature:
          {(exitus616,1);(f0,4);(f3,4);(f4,4)}
        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 6: AbstractSize WORST_CASE(?,O(1))
    + Considered Problem:
        (Rules:
          f3(A) -> f0(0)         True
          f0(A) -> f0(1 + A)     [A >= 0 && 9 >= A]
          f0(A) -> f4(A)         [A >= 0 && A >= 10]
          f4(A) -> exitus616(A)  True
        Signature:
          {(exitus616,1);(f0,4);(f3,4);(f4,4)}
        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 7: AbstractFlow WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [A,0.0]
           f3  ~>  f0          [A <= 0*K]
           f0  ~>  f0          [A <= 10*K]
           f0  ~>  f4          [A <= A]
           f4  ~>  exitus616   [A <= A]
          + Loop: [0.0 <= 9*K + A]
               f0  ~>  f0   [A <= 10*K]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 8: Lare WORST_CASE(?,O(1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,0.0]
           f3  ~>  f0          [K ~=> A]
           f0  ~>  f0          [K ~=> A]
           f0  ~>  f4          []
           f4  ~>  exitus616   []
          + Loop: [A ~+> 0.0,K ~*> 0.0]
               f0  ~>  f0   [K ~=> A]
    + Applied Processor:
        Lare
    + Details:
         f3  ~>  exitus616   [K ~=> A,tick ~+> tick,K ~+> 0.0,K ~+> tick,K ~*> 0.0,K ~*> tick]
        + <f0  ~>  f0>  [K ~=> A,A ~+> 0.0,A ~+> tick,tick ~+> tick,K ~*> 0.0,K ~*> tick]

YES(?,O(1))