YES
* Step 1: FromIts YES
    + Considered Problem:
        Rules:
          0. evalwhile2start(A,B,C)    -> evalwhile2entryin(A,B,C)    True     (1,1)
          1. evalwhile2entryin(A,B,C)  -> evalwhile2bb4in(B,B,C)      True     (?,1)
          2. evalwhile2bb4in(A,B,C)    -> evalwhile2bb2in(A,B,B)      [A >= 1] (?,1)
          3. evalwhile2bb4in(A,B,C)    -> evalwhile2returnin(A,B,C)   [0 >= A] (?,1)
          4. evalwhile2bb2in(A,B,C)    -> evalwhile2bb1in(A,B,C)      [C >= 1] (?,1)
          5. evalwhile2bb2in(A,B,C)    -> evalwhile2bb3in(A,B,C)      [0 >= C] (?,1)
          6. evalwhile2bb1in(A,B,C)    -> evalwhile2bb2in(A,B,-1 + C) True     (?,1)
          7. evalwhile2bb3in(A,B,C)    -> evalwhile2bb4in(-1 + A,B,C) True     (?,1)
          8. evalwhile2returnin(A,B,C) -> evalwhile2stop(A,B,C)       True     (?,1)
        Signature:
          {(evalwhile2bb1in,3)
          ;(evalwhile2bb2in,3)
          ;(evalwhile2bb3in,3)
          ;(evalwhile2bb4in,3)
          ;(evalwhile2entryin,3)
          ;(evalwhile2returnin,3)
          ;(evalwhile2start,3)
          ;(evalwhile2stop,3)}
        Flow Graph:
          [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{4,5},7->{2,3},8->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: Decompose YES
    + Considered Problem:
        Rules:
          evalwhile2start(A,B,C)    -> evalwhile2entryin(A,B,C)     True
          evalwhile2entryin(A,B,C)  -> evalwhile2bb4in(B,B,C)       True
          evalwhile2bb4in(A,B,C)    -> evalwhile2bb2in(A,B,B)       [A >= 1]
          evalwhile2bb4in(A,B,C)    -> evalwhile2returnin(A,B,C)    [0 >= A]
          evalwhile2bb2in(A,B,C)    -> evalwhile2bb1in(A,B,C)       [C >= 1]
          evalwhile2bb2in(A,B,C)    -> evalwhile2bb3in(A,B,C)       [0 >= C]
          evalwhile2bb1in(A,B,C)    -> evalwhile2bb2in(A,B,-1 + C)  True
          evalwhile2bb3in(A,B,C)    -> evalwhile2bb4in(-1 + A,B,C)  True
          evalwhile2returnin(A,B,C) -> evalwhile2stop(A,B,C)        True
        Signature:
          {(evalwhile2bb1in,3)
          ;(evalwhile2bb2in,3)
          ;(evalwhile2bb3in,3)
          ;(evalwhile2bb4in,3)
          ;(evalwhile2entryin,3)
          ;(evalwhile2returnin,3)
          ;(evalwhile2start,3)
          ;(evalwhile2stop,3)}
        Rule Graph:
          [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{4,5},7->{2,3},8->{}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8]
          |
          `- p:[2,7,5,6,4] c: [2,5,7]
             |
             `- p:[4,6] c: [4,6]
* Step 3: CloseWith YES
    + Considered Problem:
        (Rules:
          evalwhile2start(A,B,C)    -> evalwhile2entryin(A,B,C)     True
          evalwhile2entryin(A,B,C)  -> evalwhile2bb4in(B,B,C)       True
          evalwhile2bb4in(A,B,C)    -> evalwhile2bb2in(A,B,B)       [A >= 1]
          evalwhile2bb4in(A,B,C)    -> evalwhile2returnin(A,B,C)    [0 >= A]
          evalwhile2bb2in(A,B,C)    -> evalwhile2bb1in(A,B,C)       [C >= 1]
          evalwhile2bb2in(A,B,C)    -> evalwhile2bb3in(A,B,C)       [0 >= C]
          evalwhile2bb1in(A,B,C)    -> evalwhile2bb2in(A,B,-1 + C)  True
          evalwhile2bb3in(A,B,C)    -> evalwhile2bb4in(-1 + A,B,C)  True
          evalwhile2returnin(A,B,C) -> evalwhile2stop(A,B,C)        True
        Signature:
          {(evalwhile2bb1in,3)
          ;(evalwhile2bb2in,3)
          ;(evalwhile2bb3in,3)
          ;(evalwhile2bb4in,3)
          ;(evalwhile2entryin,3)
          ;(evalwhile2returnin,3)
          ;(evalwhile2start,3)
          ;(evalwhile2stop,3)}
        Rule Graph:
          [0->{1},1->{2,3},2->{4,5},3->{8},4->{6},5->{7},6->{4,5},7->{2,3},8->{}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8]
          |
          `- p:[2,7,5,6,4] c: [2,5,7]
             |
             `- p:[4,6] c: [4,6])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES