MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C) -> f5(A,B,C)     [A >= 1 + B] (?,1)
          1. f0(A,B,C) -> f4(D,1 + D,B) True         (1,1)
          2. f4(A,B,C) -> f4(D,1 + D,B) True         (?,1)
        Signature:
          {(f0,3);(f4,3);(f5,3)}
        Flow Graph:
          [0->{},1->{0,2},2->{0,2}]
        
    + 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) -> f5(A,B,C)     [A >= 1 + B] (1,1)
          1. f0(A,B,C) -> f4(D,1 + D,B) True         (1,1)
          2. f4(A,B,C) -> f4(D,1 + D,B) True         (?,1)
        Signature:
          {(f0,3);(f4,3);(f5,3)}
        Flow Graph:
          [0->{},1->{0,2},2->{0,2}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,0),(2,0)]
* Step 3: UnreachableRules MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C) -> f5(A,B,C)     [A >= 1 + B] (1,1)
          1. f0(A,B,C) -> f4(D,1 + D,B) True         (1,1)
          2. f4(A,B,C) -> f4(D,1 + D,B) True         (?,1)
        Signature:
          {(f0,3);(f4,3);(f5,3)}
        Flow Graph:
          [0->{},1->{2},2->{2}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [0]
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          1. f0(A,B,C) -> f4(D,1 + D,B) True (1,1)
          2. f4(A,B,C) -> f4(D,1 + D,B) True (?,1)
        Signature:
          {(f0,3);(f4,3);(f5,3)}
        Flow Graph:
          [1->{2},2->{2}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        1. f0(A,B,C) -> f4(D,1 + D,B)    True (1,1)
        2. f4(A,B,C) -> f4(D,1 + D,B)    True (?,1)
        3. f4(A,B,C) -> exitus616(A,B,C) True (?,1)
      Signature:
        {(exitus616,3);(f0,3);(f4,3);(f5,3)}
      Flow Graph:
        [1->{2,3},2->{2,3},3->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [1,2,3]
        |
        `- p:[2] c: []
MAYBE