1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280
|
/********************* */
/*! \file bitvector_proof.h
** \verbatim
** Top contributors (to current version):
** Alex Ozdemir, Mathias Preiner, Liana Hadarean
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 by the authors listed in the file AUTHORS
** in the top-level source directory) and their institutional affiliations.
** All rights reserved. See the file COPYING in the top-level source
** directory for licensing information.\endverbatim
**
** \brief Bitvector proof base class
**
** Contains code (e.g. proof printing code) which is common to all bitvector
*proofs.
**/
#include "cvc4_private.h"
#ifndef CVC4__BITVECTOR_PROOF_H
#define CVC4__BITVECTOR_PROOF_H
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include "expr/expr.h"
#include "proof/cnf_proof.h"
#include "proof/theory_proof.h"
#include "prop/sat_solver.h"
#include "theory/bv/theory_bv.h"
// Since TBitblaster and BitVectorProof are cyclically dependent, we need this
// forward declaration
namespace CVC4 {
namespace theory {
namespace bv {
template <class T>
class TBitblaster;
}
} // namespace theory
} // namespace CVC4
namespace CVC4 {
namespace proof {
typedef std::unordered_set<Expr, ExprHashFunction> ExprSet;
typedef std::unordered_map<Expr, ClauseId, ExprHashFunction> ExprToClauseId;
typedef std::unordered_map<Expr, unsigned, ExprHashFunction> ExprToId;
typedef std::unordered_map<Expr, Expr, ExprHashFunction> ExprToExpr;
typedef std::unordered_map<Expr, std::string, ExprHashFunction> ExprToString;
/**
* A bitvector proof is best understood as having
*
* 1. A declaration of a "bitblasted formulas" -- boolean formulas
* that are each translations of a BV-literal (a comparison between BVs).
*
* (and a proof that each "bitblasted formula" is implied by the
* corresponding BV literal)
*
* 2. A declaration of a cnf formula equisatisfiable to the bitblasted
* formula
*
* (and a proof that each clause is implied by some bitblasted formula)
*
* 3. A proof of UNSAT from the clauses.
*
* This class is responsible for 1 & 2. The proof of UNSAT is delegated to a
* subclass.
*/
class BitVectorProof : public TheoryProof
{
protected:
BitVectorProof(theory::bv::TheoryBV* bv, TheoryProofEngine* proofEngine);
virtual ~BitVectorProof(){};
// Set of BV variables in the input. (e.g. "a" in [ a = 000 ] ^ [ a == 001 ])
ExprSet d_declarations;
// terms and formulas that are actually relevant to the proof
ExprSet d_usedBB;
ExprSet d_seenBBTerms; // terms that need to be bit-blasted
std::vector<Expr> d_bbTerms; // order of bit-blasting
/** atoms that need to be bit-blasted,
* BV-literals -> (BV-literals <=> bool formula)
* where a BV literal is a signed or unsigned comparison.
*/
ExprToExpr d_bbAtoms;
// map from Expr representing normalized lemma to ClauseId in SAT solver
ExprToClauseId d_bbConflictMap;
theory::bv::TBitblaster<Node>* d_bitblaster;
/** In an LFSC proof the manifestation of this expression bit-level
* representation will have a string name. This method returns that name.
*/
std::string getBBTermName(Expr expr);
/** A mapping from constant BV terms to identifiers that will refer to them in
* an LFSC proof, if constant-letification is enabled.
*/
std::map<Expr, std::string> d_constantLetMap;
/** Should we introduced identifiers to refer to BV constant terms? It may
* reduce the textual size of a proof!
*/
bool d_useConstantLetification;
/** Temporary storage for the set of nodes in the bitblasted formula which
* correspond to CNF variables eventually used in the proof of unsat on the
* CNF formula
*/
std::set<Node> d_atomsInBitblastingProof;
/**
* Prints out
* (a) a declaration of bit-level interpretations corresponding to bits in
* the input BV terms.
* (b) a proof that the each BV literal entails a boolean formula on
* bitof expressions.
*/
void printBitblasting(std::ostream& os, std::ostream& paren);
/**
* The proof that the bit-blasted SAT formula is correctly converted to CNF
*/
std::unique_ptr<CnfProof> d_cnfProof;
theory::TheoryId getTheoryId() override;
public:
void printOwnedTermAsType(Expr term,
std::ostream& os,
const ProofLetMap& map,
TypeNode expectedType) override;
void printOwnedSort(Type type, std::ostream& os) override;
/**
* Populate the d_atomsInBitblastingProof member.
* See its documentation
*/
virtual void calculateAtomsInBitblastingProof() = 0;
/**
* Prints out a declaration of the bit-blasting, and the subsequent
* conversion of the result to CNF
*
* @param os the stream to print to
* @param paren a stream that will be placed at the back of the proof (for
* closing parens)
* @param letMap The let-map, which contains information about LFSC
* identifiers and the values they reference.
*/
virtual void printBBDeclarationAndCnf(std::ostream& os,
std::ostream& paren,
ProofLetMap& letMap) = 0;
/**
* Prints a proof of the empty clause.
*
* @param os the stream to print to
* @param paren any parentheses to add to the end of the global proof
*/
virtual void printEmptyClauseProof(std::ostream& os, std::ostream& paren);
/**
* Read the d_atomsInBitblastingProof member.
* See its documentation.
*/
const std::set<Node>* getAtomsInBitblastingProof();
void registerTermBB(Expr term);
/**
* Informs the proof that the `atom` predicate was bitblasted into the
* `atom_bb` term.
*
* The `atom` term must be a comparison of bitvectors, and the `atom_bb` term
* a boolean formula on bitof expressions
*/
void registerAtomBB(Expr atom, Expr atom_bb);
void registerTerm(Expr term) override;
/**
* This must be done before registering any terms or atoms, since the CNF
* proof must reflect the result of bitblasting those
*
* Feeds the SAT solver's true and false variables into the CNF stream.
*/
virtual void initCnfProof(prop::CnfStream* cnfStream,
context::Context* cnf,
prop::SatVariable trueVar,
prop::SatVariable falseVar) = 0;
CnfProof* getCnfProof() { return d_cnfProof.get(); }
/**
* Attaches this BVP to the given SAT solver, initializing a SAT proof.
*
* This must be invoked before `initCnfProof` because a SAT proof must already
* exist to initialize a CNF proof.
*/
virtual void attachToSatSolver(prop::SatSolver& sat_solver) = 0;
void setBitblaster(theory::bv::TBitblaster<Node>* bb);
/**
* Kind of a mess. Used for resulution-based BVP's, where in eager mode this
* must be invoked before printing a proof of the empty clause. In lazy mode
* the behavior and purpose are both highly unclear.
*
* This exists as a virtual method of BitVectorProof, and not
* ResolutionBitVectorProof, because the machinery that invokes it is
* high-level enough that it doesn't know the difference between clausal and
* resolution proofs.
*
* TODO(aozdemir) figure out what is going on and clean this up
* Issue: https://github.com/CVC4/CVC4/issues/2789
*/
virtual void finalizeConflicts(std::vector<Expr>& conflicts){};
private:
ExprToString d_exprToVariableName;
ExprToString d_assignedAliases;
std::map<std::string, std::string> d_aliasToBindDeclaration;
std::string assignAlias(Expr expr);
bool hasAlias(Expr expr);
// Functions for printing various BV terms. Helpers for BV's `printOwnedTerm`
void printConstant(Expr term, std::ostream& os);
void printOperatorNary(Expr term, std::ostream& os, const ProofLetMap& map);
void printOperatorUnary(Expr term, std::ostream& os, const ProofLetMap& map);
void printPredicate(Expr term, std::ostream& os, const ProofLetMap& map);
void printOperatorParametric(Expr term, std::ostream& os, const ProofLetMap& map);
void printBitOf(Expr term, std::ostream& os, const ProofLetMap& map);
/**
* Prints the LFSC construction of a bblast_term for `term`
*/
void printTermBitblasting(Expr term, std::ostream& os);
/**
* For a given BV-atom (a comparison), prints a proof that that comparison
* holds iff the bitblasted equivalent of it holds.
* Uses a side-condidition to do the bit-blasting.
*/
void printAtomBitblasting(Expr term, std::ostream& os, bool swap);
void printAtomBitblastingToFalse(Expr term, std::ostream& os);
void printSortDeclarations(std::ostream& os, std::ostream& paren) override;
void printTermDeclarations(std::ostream& os, std::ostream& paren) override;
void printDeferredDeclarations(std::ostream& os,
std::ostream& paren) override;
void printAliasingDeclarations(std::ostream& os,
std::ostream& paren,
const ProofLetMap& globalLetMap) override;
void printConstantDisequalityProof(std::ostream& os,
Expr c1,
Expr c2,
const ProofLetMap& globalLetMap) override;
void printRewriteProof(std::ostream& os,
const Node& n1,
const Node& n2) override;
};
} // namespace proof
}/* CVC4 namespace */
#endif /* CVC4__BITVECTOR__PROOF_H */
|