pon encountering an ordering which vio-
lates the hard constraints, Snowcap uses this counter-example to
identify the (minimal) ordering constraint (which we call dependen-
cies). Snowcap then restarts its exploration taking these constraints
into account, effectively pruning the search space in a divide-and-
conquer fashion.