ConstraintStore

abstract def assertConstraint(aut: Automaton): Option[ConflictSet]

Add new automata to the store, return a sequence of term constraints in case the asserted constraints have become inconsistent

abstract def ensureCompleteLengthConstraints: Unit

Make sure that the exact length abstraction for the intersection of the stored automata has been pushed to the length prover

abstract def getAcceptedWord: Seq[Int]

Produce an arbitrary word accepted by all the stored constraints

abstract def getAcceptedWordLen(len: Int): Seq[Int]

Produce a word of length len accepted by all the stored constraints

abstract def getCompleteContents: List[Automaton]

Return all constraints that were asserted (without any modifications)

abstract def getContents: List[Automaton]

Return some representation of the asserted constraints

abstract def isAcceptedWord(w: Seq[Int]): Boolean

Check whether some word is accepted by all the stored constraints

abstract def pop: Unit

abstract def push: Unit

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit