MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,B,C,D,E,F) -> f0(A,B,C,D,E,F)      True                   (1,1)
          1. f0(A,B,C,D,E,F) -> f0(-1 + A,B,I,G,H,F) [H >= 1 && A >= 1]     (?,1)
          2. f0(A,B,C,D,E,F) -> f0(-1 + A,B,I,G,H,F) [0 >= 1 + H && A >= 1] (?,1)
          3. f0(A,B,C,D,E,F) -> f0(A,B,-1 + C,G,0,H) [A >= 1 && C >= 3]     (?,1)
          4. f0(A,B,C,D,E,F) -> f2(A,G,C,D,E,F)      [0 >= A]               (?,1)
        Signature:
          {(f0,6);(f1,6);(f2,6)}
        Flow Graph:
          [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3,4},4->{}]
        
    + Applied Processor:
        ArgumentFilter [1,3,4,5]
    + Details:
        We remove following argument positions: [1,3,4,5].
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,C) -> f0(A,C)      True                   (1,1)
          1. f0(A,C) -> f0(-1 + A,I) [H >= 1 && A >= 1]     (?,1)
          2. f0(A,C) -> f0(-1 + A,I) [0 >= 1 + H && A >= 1] (?,1)
          3. f0(A,C) -> f0(A,-1 + C) [A >= 1 && C >= 3]     (?,1)
          4. f0(A,C) -> f2(A,C)      [0 >= A]               (?,1)
        Signature:
          {(f0,6);(f1,6);(f2,6)}
        Flow Graph:
          [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3,4},4->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(3,4)]
* Step 3: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,C) -> f0(A,C)      True                   (1,1)
          1. f0(A,C) -> f0(-1 + A,I) [H >= 1 && A >= 1]     (?,1)
          2. f0(A,C) -> f0(-1 + A,I) [0 >= 1 + H && A >= 1] (?,1)
          3. f0(A,C) -> f0(A,-1 + C) [A >= 1 && C >= 3]     (?,1)
          4. f0(A,C) -> f2(A,C)      [0 >= A]               (?,1)
        Signature:
          {(f0,6);(f1,6);(f2,6)}
        Flow Graph:
          [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3},4->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f1(A,C) -> f0(A,C)       True
          f0(A,C) -> f0(-1 + A,I)  [H >= 1 && A >= 1]
          f0(A,C) -> f0(-1 + A,I)  [0 >= 1 + H && A >= 1]
          f0(A,C) -> f0(A,-1 + C)  [A >= 1 && C >= 3]
          f0(A,C) -> f2(A,C)       [0 >= A]
        Signature:
          {(f0,6);(f1,6);(f2,6)}
        Rule Graph:
          [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3},4->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Decompose MAYBE
    + Considered Problem:
        Rules:
          f1(A,C) -> f0(A,C)         True
          f0(A,C) -> f0(-1 + A,I)    [H >= 1 && A >= 1]
          f0(A,C) -> f0(-1 + A,I)    [0 >= 1 + H && A >= 1]
          f0(A,C) -> f0(A,-1 + C)    [A >= 1 && C >= 3]
          f0(A,C) -> f2(A,C)         [0 >= A]
          f2(A,C) -> exitus616(A,C)  True
        Signature:
          {(exitus616,2);(f0,6);(f1,6);(f2,6)}
        Rule Graph:
          [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3},4->{5}]
    + Applied Processor:
        Decompose Greedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[1,2,3] c: [1,2]
             |
             `- p:[3] c: [3]
* Step 6: AbstractSize MAYBE
    + Considered Problem:
        (Rules:
          f1(A,C) -> f0(A,C)         True
          f0(A,C) -> f0(-1 + A,I)    [H >= 1 && A >= 1]
          f0(A,C) -> f0(-1 + A,I)    [0 >= 1 + H && A >= 1]
          f0(A,C) -> f0(A,-1 + C)    [A >= 1 && C >= 3]
          f0(A,C) -> f2(A,C)         [0 >= A]
          f2(A,C) -> exitus616(A,C)  True
        Signature:
          {(exitus616,2);(f0,6);(f1,6);(f2,6)}
        Rule Graph:
          [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3},4->{5}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5]
          |
          `- p:[1,2,3] c: [1,2]
             |
             `- p:[3] c: [3])
    + Applied Processor:
        AbstractSize Minimize
    + Details:
        ()
* Step 7: AbstractFlow MAYBE
    + Considered Problem:
        Program:
          Domain: [A,C,0.0,0.0.0]
           f1  ~>  f0          [A <= A, C <= C]
           f0  ~>  f0          [A <= A, C <= unknown]
           f0  ~>  f0          [A <= A, C <= unknown]
           f0  ~>  f0          [A <= A, C <= C]
           f0  ~>  f2          [A <= A, C <= C]
           f2  ~>  exitus616   [A <= A, C <= C]
          + Loop: [0.0 <= K + A]
               f0  ~>  f0   [A <= A, C <= unknown]
               f0  ~>  f0   [A <= A, C <= unknown]
               f0  ~>  f0   [A <= A, C <= C]
            + Loop: [0.0.0 <= 3*K + C]
                 f0  ~>  f0   [A <= A, C <= C]
    + Applied Processor:
        AbstractFlow
    + Details:
        ()
* Step 8: Failure MAYBE
  + Considered Problem:
      Program:
        Domain: [tick,huge,K,A,C,0.0,0.0.0]
         f1  ~>  f0          []
         f0  ~>  f0          [huge ~=> C]
         f0  ~>  f0          [huge ~=> C]
         f0  ~>  f0          []
         f0  ~>  f2          []
         f2  ~>  exitus616   []
        + Loop: [A ~+> 0.0,K ~+> 0.0]
             f0  ~>  f0   [huge ~=> C]
             f0  ~>  f0   [huge ~=> C]
             f0  ~>  f0   []
          + Loop: [C ~+> 0.0.0,K ~*> 0.0.0]
               f0  ~>  f0   []
  + Applied Processor:
      Lare
  + Details:
      Unknown bound.
MAYBE