MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,J,M,G,H,I)   [J >= 1 && B >= 1 + A]     (?,1)
          1. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,J,M,G,H,I)   [0 >= 1 + J && B >= 1 + A] (?,1)
          2. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,0,F,G,H,I)   [B >= 1 + A]               (?,1)
          3. f1(A,B,C,D,E,F,G,H,I) -> f300(A,B,K,L,E,F,J,H,I) [A >= B]                   (?,1)
          4. f2(A,B,C,D,E,F,G,H,I) -> f1(A,B,C,D,E,F,G,K,L)   True                       (1,1)
        Signature:
          {(f1,9);(f2,9);(f300,9)}
        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,I) -> f1(A,B,K,L,J,M,G,H,I)   [J >= 1 && B >= 1 + A]     (?,1)
          1. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,J,M,G,H,I)   [0 >= 1 + J && B >= 1 + A] (?,1)
          2. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,0,F,G,H,I)   [B >= 1 + A]               (?,1)
          3. f1(A,B,C,D,E,F,G,H,I) -> f300(A,B,K,L,E,F,J,H,I) [A >= B]                   (1,1)
          4. f2(A,B,C,D,E,F,G,H,I) -> f1(A,B,C,D,E,F,G,K,L)   True                       (1,1)
        Signature:
          {(f1,9);(f2,9);(f300,9)}
        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,I) -> f1(A,B,K,L,J,M,G,H,I)   [J >= 1 && B >= 1 + A]     (?,1)
          1. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,J,M,G,H,I)   [0 >= 1 + J && B >= 1 + A] (?,1)
          2. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,0,F,G,H,I)   [B >= 1 + A]               (?,1)
          3. f1(A,B,C,D,E,F,G,H,I) -> f300(A,B,K,L,E,F,J,H,I) [A >= B]                   (1,1)
          4. f2(A,B,C,D,E,F,G,H,I) -> f1(A,B,C,D,E,F,G,K,L)   True                       (1,1)
        Signature:
          {(f1,9);(f2,9);(f300,9)}
        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,I) -> f1(A,B,K,L,J,M,G,H,I)        [J >= 1 && B >= 1 + A]     (?,1)
          1. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,J,M,G,H,I)        [0 >= 1 + J && B >= 1 + A] (?,1)
          2. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,0,F,G,H,I)        [B >= 1 + A]               (?,1)
          3. f1(A,B,C,D,E,F,G,H,I) -> f300(A,B,K,L,E,F,J,H,I)      [A >= B]                   (?,1)
          4. f2(A,B,C,D,E,F,G,H,I) -> f1(A,B,C,D,E,F,G,K,L)        True                       (1,1)
          5. f1(A,B,C,D,E,F,G,H,I) -> exitus616(A,B,C,D,E,F,G,H,I) True                       (?,1)
        Signature:
          {(exitus616,9);(f1,9);(f2,9);(f300,9)}
        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,I) -> f1(A,B,K,L,J,M,G,H,I)        [J >= 1 && B >= 1 + A]     (?,1)
        1. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,J,M,G,H,I)        [0 >= 1 + J && B >= 1 + A] (?,1)
        2. f1(A,B,C,D,E,F,G,H,I) -> f1(A,B,K,L,0,F,G,H,I)        [B >= 1 + A]               (?,1)
        3. f1(A,B,C,D,E,F,G,H,I) -> f300(A,B,K,L,E,F,J,H,I)      [A >= B]                   (?,1)
        4. f2(A,B,C,D,E,F,G,H,I) -> f1(A,B,C,D,E,F,G,K,L)        True                       (1,1)
        5. f1(A,B,C,D,E,F,G,H,I) -> exitus616(A,B,C,D,E,F,G,H,I) True                       (?,1)
      Signature:
        {(exitus616,9);(f1,9);(f2,9);(f300,9)}
      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