MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. evalEx6start(A,B,C)    -> evalEx6entryin(A,B,C)   True         (1,1)
          1. evalEx6entryin(A,B,C)  -> evalEx6bb3in(B,A,C)     True         (?,1)
          2. evalEx6bb3in(A,B,C)    -> evalEx6bbin(A,B,C)      [C >= 1 + B] (?,1)
          3. evalEx6bb3in(A,B,C)    -> evalEx6returnin(A,B,C)  [B >= C]     (?,1)
          4. evalEx6bbin(A,B,C)     -> evalEx6bb1in(A,B,C)     [A >= 1 + B] (?,1)
          5. evalEx6bbin(A,B,C)     -> evalEx6bb2in(A,B,C)     [B >= A]     (?,1)
          6. evalEx6bb1in(A,B,C)    -> evalEx6bb3in(A,1 + B,C) True         (?,1)
          7. evalEx6bb2in(A,B,C)    -> evalEx6bb3in(1 + A,B,C) True         (?,1)
          8. evalEx6returnin(A,B,C) -> evalEx6stop(A,B,C)      True         (?,1)
        Signature:
          {(evalEx6bb1in,3)
          ;(evalEx6bb2in,3)
          ;(evalEx6bb3in,3)
          ;(evalEx6bbin,3)
          ;(evalEx6entryin,3)
          ;(evalEx6returnin,3)
          ;(evalEx6start,3)
          ;(evalEx6stop,3)}
        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. evalEx6start(A,B,C)    -> evalEx6entryin(A,B,C)   True         (1,1)
          1. evalEx6entryin(A,B,C)  -> evalEx6bb3in(B,A,C)     True         (1,1)
          2. evalEx6bb3in(A,B,C)    -> evalEx6bbin(A,B,C)      [C >= 1 + B] (?,1)
          3. evalEx6bb3in(A,B,C)    -> evalEx6returnin(A,B,C)  [B >= C]     (1,1)
          4. evalEx6bbin(A,B,C)     -> evalEx6bb1in(A,B,C)     [A >= 1 + B] (?,1)
          5. evalEx6bbin(A,B,C)     -> evalEx6bb2in(A,B,C)     [B >= A]     (?,1)
          6. evalEx6bb1in(A,B,C)    -> evalEx6bb3in(A,1 + B,C) True         (?,1)
          7. evalEx6bb2in(A,B,C)    -> evalEx6bb3in(1 + A,B,C) True         (?,1)
          8. evalEx6returnin(A,B,C) -> evalEx6stop(A,B,C)      True         (1,1)
        Signature:
          {(evalEx6bb1in,3)
          ;(evalEx6bb2in,3)
          ;(evalEx6bb3in,3)
          ;(evalEx6bbin,3)
          ;(evalEx6entryin,3)
          ;(evalEx6returnin,3)
          ;(evalEx6start,3)
          ;(evalEx6stop,3)}
        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. evalEx6start(A,B,C)    -> evalEx6entryin(A,B,C)   True         (1,1)
        1. evalEx6entryin(A,B,C)  -> evalEx6bb3in(B,A,C)     True         (?,1)
        2. evalEx6bb3in(A,B,C)    -> evalEx6bbin(A,B,C)      [C >= 1 + B] (?,1)
        3. evalEx6bb3in(A,B,C)    -> evalEx6returnin(A,B,C)  [B >= C]     (?,1)
        4. evalEx6bbin(A,B,C)     -> evalEx6bb1in(A,B,C)     [A >= 1 + B] (?,1)
        5. evalEx6bbin(A,B,C)     -> evalEx6bb2in(A,B,C)     [B >= A]     (?,1)
        6. evalEx6bb1in(A,B,C)    -> evalEx6bb3in(A,1 + B,C) True         (?,1)
        7. evalEx6bb2in(A,B,C)    -> evalEx6bb3in(1 + A,B,C) True         (?,1)
        8. evalEx6returnin(A,B,C) -> evalEx6stop(A,B,C)      True         (?,1)
        9. evalEx6returnin(A,B,C) -> exitus616(A,B,C)        True         (?,1)
      Signature:
        {(evalEx6bb1in,3)
        ;(evalEx6bb2in,3)
        ;(evalEx6bb3in,3)
        ;(evalEx6bbin,3)
        ;(evalEx6entryin,3)
        ;(evalEx6returnin,3)
        ;(evalEx6start,3)
        ;(evalEx6stop,3)
        ;(exitus616,3)}
      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