MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G) [A >= B]                   (?,1)
          1. f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,0,F,G) [B >= 1 + A]               (?,1)
          2. f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,J,K,G) [0 >= 1 + J && B >= 1 + A] (?,1)
          3. f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,J,K,G) [J >= 1 && B >= 1 + A]     (?,1)
          4. f1(A,B,C,D,E,F,G) -> f0(A,B,C,D,E,F,H) True                       (1,1)
        Signature:
          {(f0,7);(f1,7);(f2,7)}
        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:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G) [A >= B]                   (1,1)
          1. f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,0,F,G) [B >= 1 + A]               (?,1)
          2. f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,J,K,G) [0 >= 1 + J && B >= 1 + A] (?,1)
          3. f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,J,K,G) [J >= 1 && B >= 1 + A]     (?,1)
          4. f1(A,B,C,D,E,F,G) -> f0(A,B,C,D,E,F,H) True                       (1,1)
        Signature:
          {(f0,7);(f1,7);(f2,7)}
        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:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f0(A,B,C,D,E,F,G) -> f2(H,B,I,D,E,F,G)        [A >= B]                   (?,1)
        1. f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,0,F,G)        [B >= 1 + A]               (?,1)
        2. f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,J,K,G)        [0 >= 1 + J && B >= 1 + A] (?,1)
        3. f0(A,B,C,D,E,F,G) -> f0(H,B,C,I,J,K,G)        [J >= 1 && B >= 1 + A]     (?,1)
        4. f1(A,B,C,D,E,F,G) -> f0(A,B,C,D,E,F,H)        True                       (1,1)
        5. f0(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True                       (?,1)
      Signature:
        {(exitus616,7);(f0,7);(f1,7);(f2,7)}
      Flow Graph:
        [0->{},1->{0,1,2,3,5},2->{0,1,2,3,5},3->{0,1,2,3,5},4->{0,1,2,3,5},5->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5]
        |
        `- p:[1,2,3] c: []
MAYBE