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