MAYBE
* Step 1: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. start(A,B) -> eval(A,B)          True               (1,1)
          1. eval(A,B)  -> eval(-2 + B,1 + A) [A >= 1 && B >= 1] (?,1)
          2. eval(A,B)  -> eval(-1 + A,A)     [A >= 1 && B >= 1] (?,1)
        Signature:
          {(eval,2);(start,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{1,2}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 2: Failure MAYBE
  + Considered Problem:
      Rules:
        0. start(A,B) -> eval(A,B)          True               (1,1)
        1. eval(A,B)  -> eval(-2 + B,1 + A) [A >= 1 && B >= 1] (?,1)
        2. eval(A,B)  -> eval(-1 + A,A)     [A >= 1 && B >= 1] (?,1)
        3. eval(A,B)  -> exitus616(A,B)     True               (?,1)
      Signature:
        {(eval,2);(exitus616,2);(start,2)}
      Flow Graph:
        [0->{1,2,3},1->{1,2,3},2->{1,2,3},3->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3]
        |
        `- p:[1,2] c: []
MAYBE