When inserting a widened condition we handle the following special case:
L >u C0 && L >u C1 -> L >u max(C0, C1)
Recently insertion point finding algorithm changed.
Previously we would insert the new condition right before the conditional branch where all L operands were available.
Now we may choose the widenable condition intrinsic call as insertion point and it may happen so that the L operands are computed after the call, so we have to make sure that L operands are available where we want to insert it.
Why is that guaranteed?