MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. evalfstart(A,B,C,D)    -> evalfentryin(A,B,C,D)   True         (1,1)
          1. evalfentryin(A,B,C,D)  -> evalfbb3in(0,0,C,D)     True         (?,1)
          2. evalfbb3in(A,B,C,D)    -> evalfbbin(A,B,C,D)      [C >= 1 + B] (?,1)
          3. evalfbb3in(A,B,C,D)    -> evalfreturnin(A,B,C,D)  [B >= C]     (?,1)
          4. evalfbbin(A,B,C,D)     -> evalfbb1in(A,B,C,D)     [D >= 1 + A] (?,1)
          5. evalfbbin(A,B,C,D)     -> evalfbb2in(A,B,C,D)     [A >= D]     (?,1)
          6. evalfbb1in(A,B,C,D)    -> evalfbb3in(1 + A,B,C,D) True         (?,1)
          7. evalfbb2in(A,B,C,D)    -> evalfbb3in(0,1 + B,C,D) True         (?,1)
          8. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D)      True         (?,1)
        Signature:
          {(evalfbb1in,4)
          ;(evalfbb2in,4)
          ;(evalfbb3in,4)
          ;(evalfbbin,4)
          ;(evalfentryin,4)
          ;(evalfreturnin,4)
          ;(evalfstart,4)
          ;(evalfstop,4)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. evalfstart(A,B,C,D)    -> evalfentryin(A,B,C,D)   True         (1,1)
          1. evalfentryin(A,B,C,D)  -> evalfbb3in(0,0,C,D)     True         (1,1)
          2. evalfbb3in(A,B,C,D)    -> evalfbbin(A,B,C,D)      [C >= 1 + B] (?,1)
          3. evalfbb3in(A,B,C,D)    -> evalfreturnin(A,B,C,D)  [B >= C]     (1,1)
          4. evalfbbin(A,B,C,D)     -> evalfbb1in(A,B,C,D)     [D >= 1 + A] (?,1)
          5. evalfbbin(A,B,C,D)     -> evalfbb2in(A,B,C,D)     [A >= D]     (?,1)
          6. evalfbb1in(A,B,C,D)    -> evalfbb3in(1 + A,B,C,D) True         (?,1)
          7. evalfbb2in(A,B,C,D)    -> evalfbb3in(0,1 + B,C,D) True         (?,1)
          8. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D)      True         (1,1)
        Signature:
          {(evalfbb1in,4)
          ;(evalfbb2in,4)
          ;(evalfbb3in,4)
          ;(evalfbbin,4)
          ;(evalfentryin,4)
          ;(evalfreturnin,4)
          ;(evalfstart,4)
          ;(evalfstop,4)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{2,3},7->{2,3},8->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0. evalfstart(A,B,C,D)    -> evalfentryin(A,B,C,D)   True         (1,1)
        1. evalfentryin(A,B,C,D)  -> evalfbb3in(0,0,C,D)     True         (?,1)
        2. evalfbb3in(A,B,C,D)    -> evalfbbin(A,B,C,D)      [C >= 1 + B] (?,1)
        3. evalfbb3in(A,B,C,D)    -> evalfreturnin(A,B,C,D)  [B >= C]     (?,1)
        4. evalfbbin(A,B,C,D)     -> evalfbb1in(A,B,C,D)     [D >= 1 + A] (?,1)
        5. evalfbbin(A,B,C,D)     -> evalfbb2in(A,B,C,D)     [A >= D]     (?,1)
        6. evalfbb1in(A,B,C,D)    -> evalfbb3in(1 + A,B,C,D) True         (?,1)
        7. evalfbb2in(A,B,C,D)    -> evalfbb3in(0,1 + B,C,D) True         (?,1)
        8. evalfreturnin(A,B,C,D) -> evalfstop(A,B,C,D)      True         (?,1)
        9. evalfreturnin(A,B,C,D) -> exitus616(A,B,C,D)      True         (?,1)
      Signature:
        {(evalfbb1in,4)
        ;(evalfbb2in,4)
        ;(evalfbb3in,4)
        ;(evalfbbin,4)
        ;(evalfentryin,4)
        ;(evalfreturnin,4)
        ;(evalfstart,4)
        ;(evalfstop,4)
        ;(exitus616,4)}
      Flow Graph:
        [0->{1},1->{2,3},2->{4,5},3->{8,9},4->{6},5->{7},6->{2,3},7->{2,3},8->{},9->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9]
        |
        `- p:[2,6,4,7,5] c: []
MAYBE