MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D) -> f6(B,B,D,D)           True                  (1,1)
          1. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [0 >= 1 + A]          (?,1)
          2. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [A >= 1]              (?,1)
          3. f6(A,B,C,D) -> f14(0,B,C,D)          [D >= 1 + B && A = 0] (?,1)
          4. f6(A,B,C,D) -> f14(0,B,C,D)          [B >= 1 + D && A = 0] (?,1)
          5. f6(A,B,C,D) -> f14(0,B,C,B)          [A = 0 && B = D]      (?,1)
        Signature:
          {(f0,4);(f14,4);(f6,4)}
        Flow Graph:
          [0->{1,2,3,4,5},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{},4->{},5->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D) -> f6(B,B,D,D)           True                  (1,1)
          1. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [0 >= 1 + A]          (?,1)
          2. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [A >= 1]              (?,1)
          3. f6(A,B,C,D) -> f14(0,B,C,D)          [D >= 1 + B && A = 0] (1,1)
          4. f6(A,B,C,D) -> f14(0,B,C,D)          [B >= 1 + D && A = 0] (1,1)
          5. f6(A,B,C,D) -> f14(0,B,C,B)          [A = 0 && B = D]      (1,1)
        Signature:
          {(f0,4);(f14,4);(f6,4)}
        Flow Graph:
          [0->{1,2,3,4,5},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{},4->{},5->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(1,3),(1,4),(1,5),(2,1)]
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D) -> f6(B,B,D,D)           True                  (1,1)
          1. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [0 >= 1 + A]          (?,1)
          2. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [A >= 1]              (?,1)
          3. f6(A,B,C,D) -> f14(0,B,C,D)          [D >= 1 + B && A = 0] (1,1)
          4. f6(A,B,C,D) -> f14(0,B,C,D)          [B >= 1 + D && A = 0] (1,1)
          5. f6(A,B,C,D) -> f14(0,B,C,B)          [A = 0 && B = D]      (1,1)
        Signature:
          {(f0,4);(f14,4);(f6,4)}
        Flow Graph:
          [0->{1,2,3,4,5},1->{1},2->{2,3,4,5},3->{},4->{},5->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D) -> f6(B,B,D,D)           True                  (1,1)
          1. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [0 >= 1 + A]          (?,1)
          2. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [A >= 1]              (?,1)
          3. f6(A,B,C,D) -> f14(0,B,C,D)          [D >= 1 + B && A = 0] (?,1)
          4. f6(A,B,C,D) -> f14(0,B,C,D)          [B >= 1 + D && A = 0] (?,1)
          5. f6(A,B,C,D) -> f14(0,B,C,B)          [A = 0 && B = D]      (?,1)
          6. f6(A,B,C,D) -> exitus616(A,B,C,D)    True                  (?,1)
        Signature:
          {(exitus616,4);(f0,4);(f14,4);(f6,4)}
        Flow Graph:
          [0->{1,2,3,4,5,6},1->{1,2,3,4,5,6},2->{1,2,3,4,5,6},3->{},4->{},5->{},6->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(1,3),(1,4),(1,5),(2,1)]
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f0(A,B,C,D) -> f6(B,B,D,D)           True                  (1,1)
        1. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [0 >= 1 + A]          (?,1)
        2. f6(A,B,C,D) -> f6(-1 + A,B,-1 + C,D) [A >= 1]              (?,1)
        3. f6(A,B,C,D) -> f14(0,B,C,D)          [D >= 1 + B && A = 0] (?,1)
        4. f6(A,B,C,D) -> f14(0,B,C,D)          [B >= 1 + D && A = 0] (?,1)
        5. f6(A,B,C,D) -> f14(0,B,C,B)          [A = 0 && B = D]      (?,1)
        6. f6(A,B,C,D) -> exitus616(A,B,C,D)    True                  (?,1)
      Signature:
        {(exitus616,4);(f0,4);(f14,4);(f6,4)}
      Flow Graph:
        [0->{1,2,3,4,5,6},1->{1,6},2->{2,3,4,5,6},3->{},4->{},5->{},6->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6]
        |
        +- p:[2] c: [2]
        |
        `- p:[1] c: []
MAYBE