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