Then, the resulting graph is compacted, coalescing nodes marked by the same type as well as indistinguishable anonymous nodes.
the resulting graph does not necessarily maintain the relaxed upward closure condition, and therefore some modifications are needed.