3. The computer-implemented method of claim 2 , further comprising: incrementally refining and extending a sequence of sets of invariants representing bounded invariants and determining a relevance of the one or more design components referenced in the invariant clauses by: evaluating, for each invariant, whether the invariant is an unbounded invariant that is first introduced at a specific timestep between the initial and the kth timestep; deterministically assigning relative priorities to one or more design components referenced in the invariant based on the specific timestep at which the unbounded invariant is introduced; determining for each design component referenced by an invariant, if the design component has a priority that is equal to a highest priority assigned among the design components; and in response to the design component not having a priority equal to the highest priority assigned, identifying the design component as a cutpoint and replacing the design component with the cutpoint within the abstracted design.
5. The computer-implemented method of claim 3 , wherein assigning relative priorities to one or more deign components comprises: initially assigning to each of the design component a priority value representing a low priority; determining if a next invariant identified is an unbounded invariant; and in response to identifying one or more unbounded invariants, assigning a highest priority to each design component contained in each of the one or more unbounded invariants.