9. The method of claim 1 , wherein identifying a fragment in the counterexample by iteratively applying the approach of linear constraints satisfaction comprises: dividing the identified fragment into a first and a second sub fragment; and determining if both the first and second sub fragments are valid.
9. The method of claim 1 , wherein identifying a fragment in the counterexample by iteratively applying the approach of linear constraints satisfaction comprises: dividing the identified fragment into a first and a second sub fragment; and determining if both the first and second sub fragments are valid. 11. The method of claim 9 , further comprising: identifying a fragment in an invalid counterexample that is infeasible in the LTS repeatedly until the first and the second sub fragments are both valid or until the length of an invalid fragment equals one.