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