public class InterpolatingProverWithAssumptionsWrapper<T> extends BasicProverWithAssumptionsWrapper<T,InterpolatingProverEnvironment<T>> implements InterpolatingProverEnvironment<T>
delegate, solverAssumptionsAsFormula| Constructor and Description |
|---|
InterpolatingProverWithAssumptionsWrapper(InterpolatingProverEnvironment<T> pDelegate,
FormulaManager pFmgr) |
| Modifier and Type | Method and Description |
|---|---|
protected void |
clearAssumptions() |
BooleanFormula |
getInterpolant(List<T> pFormulasOfA)
Get an interpolant for two groups of formulas.
|
List<BooleanFormula> |
getSeqInterpolants(List<Set<T>> pPartitionedFormulas)
This method returns interpolants of an 'inductive sequence'.
|
List<BooleanFormula> |
getTreeInterpolants(List<Set<T>> pPartitionedFormulas,
int[] pStartOfSubTree)
Compute a sequence of interpolants.
|
boolean |
isUnsatWithAssumptions(Collection<BooleanFormula> assumptions)
Check whether the conjunction of all formulas on the stack together with the
list of assumptions is satisfiable.
|
addConstraint, close, getModel, getModelAssignments, isUnsat, pop, pushclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitpushaddConstraint, close, getModel, getModelAssignments, isUnsat, pop, pushpublic InterpolatingProverWithAssumptionsWrapper(InterpolatingProverEnvironment<T> pDelegate, FormulaManager pFmgr)
public BooleanFormula getInterpolant(List<T> pFormulasOfA) throws SolverException, InterruptedException
InterpolatingProverEnvironmentBasicProverEnvironment.isUnsat() call
that returned true.
There is no direct guarantee that the interpolants returned are part of an inductive sequence', however this seems to work for most (all?) solvers as long as the same proof is used, i.e. all interpolants are computed after the same SAT-check.
getInterpolant in interface InterpolatingProverEnvironment<T>pFormulasOfA - A list of values returned by InterpolatingProverEnvironment.push(BooleanFormula).
All the corresponding formulas from group A, the remaining formulas form group B.SolverException - if interpolant cannot be computed,
for example because interpolation procedure is incompleteInterruptedExceptionpublic List<BooleanFormula> getSeqInterpolants(List<Set<T>> pPartitionedFormulas) throws SolverException, InterruptedException
InterpolatingProverEnvironmentThe stack must contain exactly the partitioned formulas, but any order is allowed. For an input of N partitions we return N-1 interpolants.
getSeqInterpolants in interface InterpolatingProverEnvironment<T>AND(I_i, P_i) => I_(i+1) is satisfied for all i,
where P_i is the conjunction of all formulas in partition i.SolverException - if interpolant cannot be computed,
for example because interpolation procedure is incompleteInterruptedExceptionpublic List<BooleanFormula> getTreeInterpolants(List<Set<T>> pPartitionedFormulas, int[] pStartOfSubTree) throws SolverException, InterruptedException
InterpolatingProverEnvironmentExample:
A D | | B E | / C | F H | / G arrayIndex = [0,1,2,3,4,5,6,7] // only for demonstration, not needed partition = [A,B,D,E,C,F,H,G] // post-order of tree startOfSubTree = [0,0,2,2,0,0,6,0] // index of left-most leaf of the current element
getTreeInterpolants in interface InterpolatingProverEnvironment<T>pPartitionedFormulas - of formulaspStartOfSubTree - The start of the subtree containing the formula at this index as root.SolverException - if interpolant cannot be computed,
for example because interpolation procedure is incompleteInterruptedExceptionpublic boolean isUnsatWithAssumptions(Collection<BooleanFormula> assumptions) throws SolverException, InterruptedException
InterpolatingProverEnvironmentisUnsatWithAssumptions in interface InterpolatingProverEnvironment<T>assumptions - A list of literals.SolverExceptionInterruptedExceptionprotected void clearAssumptions()
clearAssumptions in class BasicProverWithAssumptionsWrapper<T,InterpolatingProverEnvironment<T>>