MAYBE
* Step 1: TrivialSCCs 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:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: 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,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 3: AddSinks 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,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:
        AddSinks
    + Details:
        ()
* Step 4: 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)
          4. f5(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True                           (1,1)
          5. f4(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True                           (?,1)
        Signature:
          {(exitus616,7);(f4,7);(f5,7);(f6,7)}
        Flow Graph:
          [0->{0,1,5},1->{},2->{0,1,5},3->{},4->{},5->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,1)]
* Step 5: Failure 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)
        4. f5(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True                           (1,1)
        5. f4(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True                           (?,1)
      Signature:
        {(exitus616,7);(f4,7);(f5,7);(f6,7)}
      Flow Graph:
        [0->{0,5},1->{},2->{0,1,5},3->{},4->{},5->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5]
        |
        `- p:[0] c: []
MAYBE