YES
* Step 1: UnsatPaths YES
    + Considered Problem:
        Rules:
          0. evalrandom1dstart(A,B)    -> evalrandom1dentryin(A,B)   True         (1,1)
          1. evalrandom1dentryin(A,B)  -> evalrandom1dbb5in(A,1)     [A >= 1]     (?,1)
          2. evalrandom1dentryin(A,B)  -> evalrandom1dreturnin(A,B)  [0 >= A]     (?,1)
          3. evalrandom1dbb5in(A,B)    -> evalrandom1dbb1in(A,B)     [A >= B]     (?,1)
          4. evalrandom1dbb5in(A,B)    -> evalrandom1dreturnin(A,B)  [B >= 1 + A] (?,1)
          5. evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B) [0 >= 1 + C] (?,1)
          6. evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B) [C >= 1]     (?,1)
          7. evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B) True         (?,1)
          8. evalrandom1dreturnin(A,B) -> evalrandom1dstop(A,B)      True         (?,1)
        Signature:
          {(evalrandom1dbb1in,2)
          ;(evalrandom1dbb5in,2)
          ;(evalrandom1dentryin,2)
          ;(evalrandom1dreturnin,2)
          ;(evalrandom1dstart,2)
          ;(evalrandom1dstop,2)}
        Flow Graph:
          [0->{1,2},1->{3,4},2->{8},3->{5,6,7},4->{8},5->{3,4},6->{3,4},7->{3,4},8->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,4)]
* Step 2: FromIts YES
    + Considered Problem:
        Rules:
          0. evalrandom1dstart(A,B)    -> evalrandom1dentryin(A,B)   True         (1,1)
          1. evalrandom1dentryin(A,B)  -> evalrandom1dbb5in(A,1)     [A >= 1]     (?,1)
          2. evalrandom1dentryin(A,B)  -> evalrandom1dreturnin(A,B)  [0 >= A]     (?,1)
          3. evalrandom1dbb5in(A,B)    -> evalrandom1dbb1in(A,B)     [A >= B]     (?,1)
          4. evalrandom1dbb5in(A,B)    -> evalrandom1dreturnin(A,B)  [B >= 1 + A] (?,1)
          5. evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B) [0 >= 1 + C] (?,1)
          6. evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B) [C >= 1]     (?,1)
          7. evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B) True         (?,1)
          8. evalrandom1dreturnin(A,B) -> evalrandom1dstop(A,B)      True         (?,1)
        Signature:
          {(evalrandom1dbb1in,2)
          ;(evalrandom1dbb5in,2)
          ;(evalrandom1dentryin,2)
          ;(evalrandom1dreturnin,2)
          ;(evalrandom1dstart,2)
          ;(evalrandom1dstop,2)}
        Flow Graph:
          [0->{1,2},1->{3},2->{8},3->{5,6,7},4->{8},5->{3,4},6->{3,4},7->{3,4},8->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Decompose YES
    + Considered Problem:
        Rules:
          evalrandom1dstart(A,B)    -> evalrandom1dentryin(A,B)    True
          evalrandom1dentryin(A,B)  -> evalrandom1dbb5in(A,1)      [A >= 1]
          evalrandom1dentryin(A,B)  -> evalrandom1dreturnin(A,B)   [0 >= A]
          evalrandom1dbb5in(A,B)    -> evalrandom1dbb1in(A,B)      [A >= B]
          evalrandom1dbb5in(A,B)    -> evalrandom1dreturnin(A,B)   [B >= 1 + A]
          evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B)  [0 >= 1 + C]
          evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B)  [C >= 1]
          evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B)  True
          evalrandom1dreturnin(A,B) -> evalrandom1dstop(A,B)       True
        Signature:
          {(evalrandom1dbb1in,2)
          ;(evalrandom1dbb5in,2)
          ;(evalrandom1dentryin,2)
          ;(evalrandom1dreturnin,2)
          ;(evalrandom1dstart,2)
          ;(evalrandom1dstop,2)}
        Rule Graph:
          [0->{1,2},1->{3},2->{8},3->{5,6,7},4->{8},5->{3,4},6->{3,4},7->{3,4},8->{}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8]
          |
          `- p:[3,5,6,7] c: [3,5,6,7]
* Step 4: CloseWith YES
    + Considered Problem:
        (Rules:
          evalrandom1dstart(A,B)    -> evalrandom1dentryin(A,B)    True
          evalrandom1dentryin(A,B)  -> evalrandom1dbb5in(A,1)      [A >= 1]
          evalrandom1dentryin(A,B)  -> evalrandom1dreturnin(A,B)   [0 >= A]
          evalrandom1dbb5in(A,B)    -> evalrandom1dbb1in(A,B)      [A >= B]
          evalrandom1dbb5in(A,B)    -> evalrandom1dreturnin(A,B)   [B >= 1 + A]
          evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B)  [0 >= 1 + C]
          evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B)  [C >= 1]
          evalrandom1dbb1in(A,B)    -> evalrandom1dbb5in(A,1 + B)  True
          evalrandom1dreturnin(A,B) -> evalrandom1dstop(A,B)       True
        Signature:
          {(evalrandom1dbb1in,2)
          ;(evalrandom1dbb5in,2)
          ;(evalrandom1dentryin,2)
          ;(evalrandom1dreturnin,2)
          ;(evalrandom1dstart,2)
          ;(evalrandom1dstop,2)}
        Rule Graph:
          [0->{1,2},1->{3},2->{8},3->{5,6,7},4->{8},5->{3,4},6->{3,4},7->{3,4},8->{}]
        ,We construct a looptree:
          P: [0,1,2,3,4,5,6,7,8]
          |
          `- p:[3,5,6,7] c: [3,5,6,7])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES