MAYBE
* Step 1: UnreachableRules MAYBE
    + Considered Problem:
        Rules:
          0. f8(A) -> f8(2) True (?,1)
          1. f1(A) -> f4(3) True (1,1)
          2. f4(A) -> f4(3) True (?,1)
        Signature:
          {(f1,1);(f4,1);(f8,1)}
        Flow Graph:
          [0->{0},1->{2},2->{2}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [0]
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          1. f1(A) -> f4(3) True (1,1)
          2. f4(A) -> f4(3) True (?,1)
        Signature:
          {(f1,1);(f4,1);(f8,1)}
        Flow Graph:
          [1->{2},2->{2}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        1. f1(A) -> f4(3)        True (1,1)
        2. f4(A) -> f4(3)        True (?,1)
        3. f4(A) -> exitus616(A) True (?,1)
      Signature:
        {(exitus616,1);(f1,1);(f4,1);(f8,1)}
      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