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