First, we use ranges::contains to make the code a bit more concise.
Afterwards, we strengthen the requirements on what task can be passed to a shuffler.

Without this requirement, I was able to create a test case on which the shuffler was looping.
However, in that case, I was requiring that a literal (not present in the input stack) must be present in the tail (the liveness data). Then I realized that such a case should actually not be allowed. If a value can be freely generated, we should not track it in the liveness data.
Note that this might need to change for the values spilled into memory.

For context, this is a test example that would currently loop, but would be rejected with the proposed change:

initial: [v1, v3, v2]
targetStackTop: [v2, v3]
targetStackTailSet: {v1, lit0}
targetStackSize: 4