summaryrefslogtreecommitdiff
path: root/src/proof/bitvector_proof.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'src/proof/bitvector_proof.cpp')
-rw-r--r--src/proof/bitvector_proof.cpp26
1 files changed, 13 insertions, 13 deletions
diff --git a/src/proof/bitvector_proof.cpp b/src/proof/bitvector_proof.cpp
index 18e46a292..98f57e25f 100644
--- a/src/proof/bitvector_proof.cpp
+++ b/src/proof/bitvector_proof.cpp
@@ -224,16 +224,16 @@ void BitVectorProof::printOwnedTerm(Expr term,
void BitVectorProof::printEmptyClauseProof(std::ostream& os,
std::ostream& paren)
{
- Assert(options::bitblastMode() == theory::bv::BITBLAST_MODE_EAGER,
- "the BV theory should only be proving bottom directly in the eager "
- "bitblasting mode");
+ Assert(options::bitblastMode() == theory::bv::BITBLAST_MODE_EAGER)
+ << "the BV theory should only be proving bottom directly in the eager "
+ "bitblasting mode";
}
void BitVectorProof::printBitOf(Expr term,
std::ostream& os,
const ProofLetMap& map)
{
- Assert (term.getKind() == kind::BITVECTOR_BITOF);
+ Assert(term.getKind() == kind::BITVECTOR_BITOF);
unsigned bit = term.getOperator().getConst<BitVectorBitOf>().bitIndex;
Expr var = term[0];
@@ -247,7 +247,7 @@ void BitVectorProof::printBitOf(Expr term,
void BitVectorProof::printConstant(Expr term, std::ostream& os)
{
- Assert (term.isConst());
+ Assert(term.isConst());
os << "(a_bv " << utils::getSize(term) << " ";
if (d_useConstantLetification) {
@@ -336,7 +336,7 @@ void BitVectorProof::printOperatorParametric(Expr term,
os << high <<" " << low << " " << utils::getSize(term[0]);
}
os <<" ";
- Assert (term.getNumChildren() == 1);
+ Assert(term.getNumChildren() == 1);
d_proofEngine->printBoundTerm(term[0], os, map);
os <<")";
}
@@ -346,7 +346,7 @@ void BitVectorProof::printOwnedSort(Type type, std::ostream& os)
Debug("pf::bv") << std::endl
<< "(pf::bv) BitVectorProof::printOwnedSort( " << type << " )"
<< std::endl;
- Assert (type.isBitVector());
+ Assert(type.isBitVector());
unsigned width = utils::getSize(type);
os << "(BitVec " << width << ")";
}
@@ -433,7 +433,7 @@ void BitVectorProof::printTermBitblasting(Expr term, std::ostream& os)
{
// TODO: once we have the operator elimination rules remove those that we
// eliminated
- Assert (term.getType().isBitVector());
+ Assert(term.getType().isBitVector());
Kind kind = term.getKind();
if (theory::Theory::isLeafOf(term, theory::THEORY_BV) && !term.isConst())
@@ -568,7 +568,7 @@ void BitVectorProof::printTermBitblasting(Expr term, std::ostream& os)
return;
}
- default: Unreachable("BitVectorProof Unknown operator");
+ default: Unreachable() << "BitVectorProof Unknown operator";
}
}
@@ -601,7 +601,7 @@ void BitVectorProof::printAtomBitblasting(Expr atom,
return;
}
- default: Unreachable("BitVectorProof Unknown atom kind");
+ default: Unreachable() << "BitVectorProof Unknown atom kind";
}
}
@@ -739,9 +739,9 @@ bool BitVectorProof::hasAlias(Expr expr)
void BitVectorProof::printConstantDisequalityProof(
std::ostream& os, Expr c1, Expr c2, const ProofLetMap& globalLetMap)
{
- Assert (c1.isConst());
- Assert (c2.isConst());
- Assert (utils::getSize(c1) == utils::getSize(c2));
+ Assert(c1.isConst());
+ Assert(c2.isConst());
+ Assert(utils::getSize(c1) == utils::getSize(c2));
os << "(bv_disequal_constants " << utils::getSize(c1) << " ";
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback