MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C,D,E,F,G) -> f4(A + -1*B,B,C,D,E,F,G) [-1 + -1*B >= 0 && A >= 0]     (?,1)
          1. f4(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)        [-1 + -1*B >= 0 && 0 >= 1 + A] (?,1)
          2. f5(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,G)        [0 >= 1 + B]                   (1,1)
          3. f5(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)        [B >= 0]                       (1,1)
        Signature:
          {(f4,7);(f5,7);(f6,7)}
        Flow Graph:
          [0->{0,1},1->{},2->{0,1},3->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,1)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C,D,E,F,G) -> f4(A + -1*B,B,C,D,E,F,G) [-1 + -1*B >= 0 && A >= 0]     (?,1)
          1. f4(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)        [-1 + -1*B >= 0 && 0 >= 1 + A] (?,1)
          2. f5(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,G)        [0 >= 1 + B]                   (1,1)
          3. f5(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)        [B >= 0]                       (1,1)
        Signature:
          {(f4,7);(f5,7);(f6,7)}
        Flow Graph:
          [0->{0},1->{},2->{0,1},3->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          f4(A,B,C,D,E,F,G) -> f4(A + -1*B,B,C,D,E,F,G)  [-1 + -1*B >= 0 && A >= 0]
          f4(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)         [-1 + -1*B >= 0 && 0 >= 1 + A]
          f5(A,B,C,D,E,F,G) -> f4(A,B,C,D,E,F,G)         [0 >= 1 + B]
          f5(A,B,C,D,E,F,G) -> f6(A,B,0,0,0,0,0)         [B >= 0]
        Signature:
          {(f4,7);(f5,7);(f6,7)}
        Rule Graph:
          [0->{0},1->{},2->{0,1},3->{}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f4.0(A,B,C,D,E,F,G) -> f4.0(A + -1*B,B,C,D,E,F,G)  [-1 + -1*B >= 0 && A >= 0]
          f4.1(A,B,C,D,E,F,G) -> f6.4(A,B,0,0,0,0,0)         [-1 + -1*B >= 0 && 0 >= 1 + A]
          f5.2(A,B,C,D,E,F,G) -> f4.0(A,B,C,D,E,F,G)         [0 >= 1 + B]
          f5.2(A,B,C,D,E,F,G) -> f4.1(A,B,C,D,E,F,G)         [0 >= 1 + B]
          f5.3(A,B,C,D,E,F,G) -> f6.4(A,B,0,0,0,0,0)         [B >= 0]
        Signature:
          {(f4.0,7);(f4.1,7);(f5.2,7);(f5.3,7);(f6.4,7)}
        Rule Graph:
          [0->{0},1->{},2->{0},3->{1},4->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f4.0(A,B,C,D,E,F,G) -> f4.0(A + -1*B,B,C,D,E,F,G)  [-1 + -1*B >= 0 && A >= 0]
        f4.1(A,B,C,D,E,F,G) -> f6.4(A,B,0,0,0,0,0)         [-1 + -1*B >= 0 && 0 >= 1 + A]
        f5.2(A,B,C,D,E,F,G) -> f4.0(A,B,C,D,E,F,G)         [0 >= 1 + B]
        f5.2(A,B,C,D,E,F,G) -> f4.1(A,B,C,D,E,F,G)         [0 >= 1 + B]
        f5.3(A,B,C,D,E,F,G) -> f6.4(A,B,0,0,0,0,0)         [B >= 0]
        f6.4(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G)    True
        f6.4(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G)    True
        f4.0(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G)    True
      Signature:
        {(exitus616,7);(f4.0,7);(f4.1,7);(f5.2,7);(f5.3,7);(f6.4,7)}
      Rule Graph:
        [0->{0,7},1->{6},2->{0},3->{1},4->{5}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7]
        |
        `- p:[0] c: []
MAYBE