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

YES(?,O(1))