blob: 775a0944102e8583fa8d95af61c950709180955b (
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
52
53
54
55
56
57
58
59
60
|
/********************* */
/*! \file strings_eager_pp.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 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.\endverbatim
**
** \brief The strings eager preprocess utility
**/
#include "preprocessing/passes/strings_eager_pp.h"
#include "preprocessing/assertion_pipeline.h"
#include "theory/rewriter.h"
#include "theory/strings/theory_strings_preprocess.h"
using namespace CVC5::theory;
namespace CVC5 {
namespace preprocessing {
namespace passes {
StringsEagerPp::StringsEagerPp(PreprocessingPassContext* preprocContext)
: PreprocessingPass(preprocContext, "strings-eager-pp"){};
PreprocessingPassResult StringsEagerPp::applyInternal(
AssertionPipeline* assertionsToPreprocess)
{
NodeManager* nm = NodeManager::currentNM();
theory::strings::SkolemCache skc(false);
theory::strings::StringsPreprocess pp(&skc);
for (size_t i = 0, nasserts = assertionsToPreprocess->size(); i < nasserts;
++i)
{
Node prev = (*assertionsToPreprocess)[i];
std::vector<Node> asserts;
Node rew = pp.processAssertion(prev, asserts);
if (!asserts.empty())
{
std::vector<Node> conj;
conj.push_back(rew);
conj.insert(conj.end(), asserts.begin(), asserts.end());
rew = nm->mkAnd(conj);
}
if (prev != rew)
{
assertionsToPreprocess->replace(i, theory::Rewriter::rewrite(rew));
}
}
return PreprocessingPassResult::NO_CONFLICT;
}
} // namespace passes
} // namespace preprocessing
} // namespace CVC5
|
