YES(?,O(n^1))
* Step 1: FromIts WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          0. f1(A,B) -> f2(A,B)      [A >= 1 && B >= 1]                                                  (1,1)
          1. f2(A,B) -> f2(-1 + A,B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 2 && B >= 1] (?,1)
          2. f2(A,B) -> f2(A,-1 + B) [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 && B >= 2] (?,1)
        Signature:
          {(f1,2);(f2,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{1,2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          f1(A,B) -> f2(A,B)       [A >= 1 && B >= 1]
          f2(A,B) -> f2(-1 + A,B)  [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 2 && B >= 1]
          f2(A,B) -> f2(A,-1 + B)  [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 && B >= 2]
        Signature:
          {(f1,2);(f2,2)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{1,2}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Decompose WORST_CASE(?,O(n^1))
    + Considered Problem:
        Rules:
          f1(A,B) -> f2(A,B)         [A >= 1 && B >= 1]
          f2(A,B) -> f2(-1 + A,B)    [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 2 && B >= 1]
          f2(A,B) -> f2(A,-1 + B)    [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 && B >= 2]
          f2(A,B) -> exitus616(A,B)  True
          f2(A,B) -> exitus616(A,B)  True
        Signature:
          {(exitus616,2);(f1,2);(f2,2)}
        Rule Graph:
          [0->{1,2},1->{1,2,3},2->{1,2,4}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4]
          |
          `- p:[1,2] c: [1,2]
* Step 4: AbstractSize WORST_CASE(?,O(n^1))
    + Considered Problem:
        (Rules:
          f1(A,B) -> f2(A,B)         [A >= 1 && B >= 1]
          f2(A,B) -> f2(-1 + A,B)    [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 2 && B >= 1]
          f2(A,B) -> f2(A,-1 + B)    [-1 + B >= 0 && -2 + A + B >= 0 && -1 + A >= 0 && A >= 1 && B >= 2]
          f2(A,B) -> exitus616(A,B)  True
          f2(A,B) -> exitus616(A,B)  True
        Signature:
          {(exitus616,2);(f1,2);(f2,2)}
        Rule Graph:
          [0->{1,2},1->{1,2,3},2->{1,2,4}]
        ,We construct a looptree:
          P: [0,1,2,3,4]
          |
          `- p:[1,2] c: [1,2])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 5: AbstractFlow WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [A,B,0.0]
           f1  ~>  f2          [A <= A, B <= B]
           f2  ~>  f2          [A <= A, B <= B]
           f2  ~>  f2          [A <= A, B <= B]
           f2  ~>  exitus616   [A <= A, B <= B]
           f2  ~>  exitus616   [A <= A, B <= B]
          + Loop: [0.0 <= A + B]
               f2  ~>  f2   [A <= A, B <= B]
               f2  ~>  f2   [A <= A, B <= B]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 6: Lare WORST_CASE(?,O(n^1))
    + Considered Problem:
        Program:
          Domain: [tick,huge,K,A,B,0.0]
           f1  ~>  f2          []
           f2  ~>  f2          []
           f2  ~>  f2          []
           f2  ~>  exitus616   []
           f2  ~>  exitus616   []
          + Loop: [A ~+> 0.0,B ~+> 0.0]
               f2  ~>  f2   []
               f2  ~>  f2   []
    + Applied Processor:
        Lare
    + Details:
         f1  ~>  exitus616   [A ~+> 0.0,A ~+> tick,B ~+> 0.0,B ~+> tick,tick ~+> tick]
        + <f2  ~>  f2>  [A ~+> 0.0,A ~+> tick,B ~+> 0.0,B ~+> tick,tick ~+> tick]

YES(?,O(n^1))