4In general, a set of initial states may not be describable by a single pattern t , but may have a description as a finite collection of patterns t 1 , … , t n . There is no problem in handling this more general case: the narrowing-based symbolic model checking can just take a tuple ⟨ t 1 , … , t n ⟩ .