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
|
/********************* */
/*! \file assertion_pipeline.cpp
** \verbatim
** Top contributors (to current version):
** Andres Noetzli, Justin Xu, Morgan Deters
** This file is part of the CVC4 project.
** Copyright (c) 2009-2019 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 AssertionPipeline stores a list of assertions modified by
** preprocessing passes
**/
#include "preprocessing/assertion_pipeline.h"
#include "expr/node_manager.h"
#include "proof/proof.h"
#include "proof/proof_manager.h"
namespace CVC4 {
namespace preprocessing {
AssertionPipeline::AssertionPipeline()
: d_realAssertionsEnd(0), d_assumptionsStart(0), d_numAssumptions(0)
{
}
void AssertionPipeline::clear()
{
d_nodes.clear();
d_realAssertionsEnd = 0;
d_assumptionsStart = 0;
d_numAssumptions = 0;
}
void AssertionPipeline::push_back(Node n, bool isAssumption)
{
d_nodes.push_back(n);
if (isAssumption)
{
if (d_numAssumptions == 0)
{
d_assumptionsStart = d_nodes.size() - 1;
}
// Currently, we assume that assumptions are all added one after another
// and that we store them in the same vector as the assertions. Once we
// split the assertions up into multiple vectors (see issue #2473), we will
// not have this limitation anymore.
Assert(d_assumptionsStart + d_numAssumptions == d_nodes.size() - 1);
d_numAssumptions++;
}
}
void AssertionPipeline::replace(size_t i, Node n)
{
PROOF(ProofManager::currentPM()->addDependence(n, d_nodes[i]););
d_nodes[i] = n;
}
void AssertionPipeline::replace(size_t i,
Node n,
const std::vector<Node>& addnDeps)
{
PROOF(ProofManager::currentPM()->addDependence(n, d_nodes[i]);
for (const auto& addnDep
: addnDeps) {
ProofManager::currentPM()->addDependence(n, addnDep);
});
d_nodes[i] = n;
}
void AssertionPipeline::replace(size_t i, const std::vector<Node>& ns)
{
PROOF(
for (const auto& n
: ns) { ProofManager::currentPM()->addDependence(n, d_nodes[i]); });
d_nodes[i] = NodeManager::currentNM()->mkConst<bool>(true);
for (const auto& n : ns)
{
d_nodes.push_back(n);
}
}
} // namespace preprocessing
} // namespace CVC4
|
