MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(S,T,U,V,W,F,G,H,I,J,K,L,M,N,O,P,Q,R)   True                               (1,1)
          1. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,256,S,T,U,V,W,Y,O,P,Q,R) [G >= 1 + F && X >= 1 && H = 256]  (?,1)
          2. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,H,S,T,U,V,W,N,O,P,Q,R)   [G >= 1 + F && 0 >= H]             (?,1)
          3. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f3(A,B,C,D,E,F,G,H,S,T,K,L,M,N,0,0,0,R)   [F >= G]                           (?,1)
          4. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)   [H >= 1 && G >= 1 + F && H >= 257] (?,1)
          5. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)   [H >= 1 && G >= 1 + F && 255 >= H] (?,1)
        Signature:
          {(f1,18);(f2,18);(f3,18);(f300,18)}
        Flow Graph:
          [0->{1,2,3,4,5},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{},4->{},5->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(S,T,U,V,W,F,G,H,I,J,K,L,M,N,O,P,Q,R)   True                               (1,1)
          1. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,256,S,T,U,V,W,Y,O,P,Q,R) [G >= 1 + F && X >= 1 && H = 256]  (?,1)
          2. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,H,S,T,U,V,W,N,O,P,Q,R)   [G >= 1 + F && 0 >= H]             (?,1)
          3. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f3(A,B,C,D,E,F,G,H,S,T,K,L,M,N,0,0,0,R)   [F >= G]                           (1,1)
          4. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)   [H >= 1 && G >= 1 + F && H >= 257] (1,1)
          5. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)   [H >= 1 && G >= 1 + F && 255 >= H] (1,1)
        Signature:
          {(f1,18);(f2,18);(f3,18);(f300,18)}
        Flow Graph:
          [0->{1,2,3,4,5},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{},4->{},5->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(1,3),(1,4),(1,5),(2,1),(2,3),(2,4),(2,5)]
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(S,T,U,V,W,F,G,H,I,J,K,L,M,N,O,P,Q,R)   True                               (1,1)
          1. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,256,S,T,U,V,W,Y,O,P,Q,R) [G >= 1 + F && X >= 1 && H = 256]  (?,1)
          2. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,H,S,T,U,V,W,N,O,P,Q,R)   [G >= 1 + F && 0 >= H]             (?,1)
          3. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f3(A,B,C,D,E,F,G,H,S,T,K,L,M,N,0,0,0,R)   [F >= G]                           (1,1)
          4. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)   [H >= 1 && G >= 1 + F && H >= 257] (1,1)
          5. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)   [H >= 1 && G >= 1 + F && 255 >= H] (1,1)
        Signature:
          {(f1,18);(f2,18);(f3,18);(f300,18)}
        Flow Graph:
          [0->{1,2,3,4,5},1->{1},2->{2},3->{},4->{},5->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(S,T,U,V,W,F,G,H,I,J,K,L,M,N,O,P,Q,R)        True                               (1,1)
          1. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,256,S,T,U,V,W,Y,O,P,Q,R)      [G >= 1 + F && X >= 1 && H = 256]  (?,1)
          2. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,H,S,T,U,V,W,N,O,P,Q,R)        [G >= 1 + F && 0 >= H]             (?,1)
          3. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f3(A,B,C,D,E,F,G,H,S,T,K,L,M,N,0,0,0,R)        [F >= G]                           (?,1)
          4. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)        [H >= 1 && G >= 1 + F && H >= 257] (?,1)
          5. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)        [H >= 1 && G >= 1 + F && 255 >= H] (?,1)
          6. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True                               (?,1)
        Signature:
          {(exitus616,18);(f1,18);(f2,18);(f3,18);(f300,18)}
        Flow Graph:
          [0->{1,2,3,4,5,6},1->{1,2,3,4,5,6},2->{1,2,3,4,5,6},3->{},4->{},5->{},6->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(1,3),(1,4),(1,5),(2,1),(2,3),(2,4),(2,5)]
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f300(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) -> f1(S,T,U,V,W,F,G,H,I,J,K,L,M,N,O,P,Q,R)        True                               (1,1)
        1. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,256,S,T,U,V,W,Y,O,P,Q,R)      [G >= 1 + F && X >= 1 && H = 256]  (?,1)
        2. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f1(A,B,C,D,E,F,G,H,S,T,U,V,W,N,O,P,Q,R)        [G >= 1 + F && 0 >= H]             (?,1)
        3. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f3(A,B,C,D,E,F,G,H,S,T,K,L,M,N,0,0,0,R)        [F >= G]                           (?,1)
        4. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)        [H >= 1 && G >= 1 + F && H >= 257] (?,1)
        5. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> f2(A,B,C,D,E,F,G,H,S,T,U,V,W,Y,H,H,H,X)        [H >= 1 && G >= 1 + F && 255 >= H] (?,1)
        6. f1(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R)   -> exitus616(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R) True                               (?,1)
      Signature:
        {(exitus616,18);(f1,18);(f2,18);(f3,18);(f300,18)}
      Flow Graph:
        [0->{1,2,3,4,5,6},1->{1,6},2->{2,6},3->{},4->{},5->{},6->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6]
        |
        +- p:[2] c: []
        |
        `- p:[1] c: []
MAYBE