blob: 3ba2f887005013a8f9d44254debd487a4bb883fe (
plain)
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
|
/******************************************************************************
* Top contributors (to current version):
* Mathias Preiner
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2021 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.
* ****************************************************************************
*
* Wrap assertions in BITVECTOR_EAGER_ATOM nodes.
*
* This preprocessing pass wraps all assertions in BITVECTOR_EAGER_ATOM nodes
* and allows to use eager bit-blasting in the BV solver.
*/
#include "preprocessing/passes/bv_eager_atoms.h"
#include "preprocessing/assertion_pipeline.h"
#include "preprocessing/preprocessing_pass_context.h"
#include "theory/theory_engine.h"
#include "theory/theory_model.h"
namespace cvc5 {
namespace preprocessing {
namespace passes {
BvEagerAtoms::BvEagerAtoms(PreprocessingPassContext* preprocContext)
: PreprocessingPass(preprocContext, "bv-eager-atoms"){};
PreprocessingPassResult BvEagerAtoms::applyInternal(
AssertionPipeline* assertionsToPreprocess)
{
theory::TheoryModel* tm = d_preprocContext->getTheoryEngine()->getModel();
NodeManager* nm = NodeManager::currentNM();
for (unsigned i = 0, size = assertionsToPreprocess->size(); i < size; ++i)
{
TNode atom = (*assertionsToPreprocess)[i];
Node eager_atom = nm->mkNode(kind::BITVECTOR_EAGER_ATOM, atom);
tm->addSubstitution(eager_atom, atom);
assertionsToPreprocess->replace(i, eager_atom);
}
return PreprocessingPassResult::NO_CONFLICT;
}
} // namespace passes
} // namespace preprocessing
} // namespace cvc5
|
