YES(?,O(n^1))
* Step 1: TrivialSCCs WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B) -> f3(A,1)      [-1*B >= 0 && B >= 0 && 0 >= A] (?,1)
          1. f0(A,B) -> f2(A,0)      True                            (1,1)
          2. f2(A,B) -> f2(-1 + A,B) [-1*B >= 0 && B >= 0 && A >= 1] (?,1)
        Signature:
          {(f0,2);(f2,2);(f3,2)}
        Flow Graph:
          [0->{},1->{0,2},2->{0,2}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B) -> f3(A,1)      [-1*B >= 0 && B >= 0 && 0 >= A] (1,1)
          1. f0(A,B) -> f2(A,0)      True                            (1,1)
          2. f2(A,B) -> f2(-1 + A,B) [-1*B >= 0 && B >= 0 && A >= 1] (?,1)
        Signature:
          {(f0,2);(f2,2);(f3,2)}
        Flow Graph:
          [0->{},1->{0,2},2->{0,2}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: LooptreeTransformer WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f2(A,B) -> f3(A,1)        [-1*B >= 0 && B >= 0 && 0 >= A] (?,1)
          1. f0(A,B) -> f2(A,0)        True                            (1,1)
          2. f2(A,B) -> f2(-1 + A,B)   [-1*B >= 0 && B >= 0 && A >= 1] (?,1)
          3. f2(A,B) -> exitus616(A,B) True                            (?,1)
        Signature:
          {(exitus616,2);(f0,2);(f2,2);(f3,2)}
        Flow Graph:
          [0->{},1->{0,2,3},2->{0,2,3},3->{}]
        
    + Applied Processor:
        LooptreeTransformer
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[2] c: [2]
* Step 4: SizeAbstraction WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          0. f2(A,B) -> f3(A,1)        [-1*B >= 0 && B >= 0 && 0 >= A] (?,1)
          1. f0(A,B) -> f2(A,0)        True                            (1,1)
          2. f2(A,B) -> f2(-1 + A,B)   [-1*B >= 0 && B >= 0 && A >= 1] (?,1)
          3. f2(A,B) -> exitus616(A,B) True                            (?,1)
        Signature:
          {(exitus616,2);(f0,2);(f2,2);(f3,2)}
        Flow Graph:
          [0->{},1->{0,2,3},2->{0,2,3},3->{}]
        
        ,We construct a looptree:
          P: [0,1,2,3]
          |
          `- p:[2] c: [2])
    + Applied Processor:
        SizeAbstraction UseCFG Minimize
    + Details:
        ()
* Step 5: FlowAbstraction WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           f2  ~>  f3          [A <= A, B <= K]
           f0  ~>  f2          [A <= A, B <= 0*K]
           f2  ~>  f2          [A <= A, B <= B]
           f2  ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= A]
               f2  ~>  f2   [A <= A, B <= B]
    + Applied Processor:
        FlowAbstraction
    + Details:
        ()
* Step 6: LareProcessor WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           f2  ~>  f3          [K ~=> B]
           f0  ~>  f2          [K ~=> B]
           f2  ~>  f2          []
           f2  ~>  exitus616   []
          + Loop: [A ~=> 0.0]
               f2  ~>  f2   []
    + Applied Processor:
        LareProcessor
    + Details:
         f0  ~>  exitus616   [A ~=> 0.0,K ~=> B,A ~+> tick,tick ~+> tick]
         f0  ~>  f3          [A ~=> 0.0,K ~=> B,A ~+> tick,tick ~+> tick]
        + <f2  ~>  f2>  [A ~=> 0.0,A ~+> tick,tick ~+> tick]

YES(?,O(n^1))