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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds, Haniel Barbosa, Aina Niemetz
*
* 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.
* ****************************************************************************
*
* Implementation of module for final processing proof nodes.
*/
#include "smt/proof_final_callback.h"
#include "options/proof_options.h"
#include "proof/proof_checker.h"
#include "proof/proof_node_manager.h"
#include "smt/smt_statistics_registry.h"
#include "theory/builtin/proof_checker.h"
#include "theory/theory_id.h"
using namespace cvc5::kind;
using namespace cvc5::theory;
namespace cvc5 {
namespace smt {
ProofFinalCallback::ProofFinalCallback(ProofNodeManager* pnm)
: d_ruleCount(smtStatisticsRegistry().registerHistogram<PfRule>(
"finalProof::ruleCount")),
d_instRuleIds(
smtStatisticsRegistry().registerHistogram<theory::InferenceId>(
"finalProof::instRuleId")),
d_totalRuleCount(
smtStatisticsRegistry().registerInt("finalProof::totalRuleCount")),
d_minPedanticLevel(
smtStatisticsRegistry().registerInt("finalProof::minPedanticLevel")),
d_numFinalProofs(
smtStatisticsRegistry().registerInt("finalProofs::numFinalProofs")),
d_pnm(pnm),
d_pedanticFailure(false)
{
d_minPedanticLevel += 10;
}
void ProofFinalCallback::initializeUpdate()
{
d_pedanticFailure = false;
d_pedanticFailureOut.str("");
++d_numFinalProofs;
}
bool ProofFinalCallback::shouldUpdate(std::shared_ptr<ProofNode> pn,
const std::vector<Node>& fa,
bool& continueUpdate)
{
PfRule r = pn->getRule();
// if not doing eager pedantic checking, fail if below threshold
if (options::proofCheck() != options::ProofCheckMode::EAGER)
{
if (!d_pedanticFailure)
{
Assert(d_pedanticFailureOut.str().empty());
if (d_pnm->getChecker()->isPedanticFailure(r, d_pedanticFailureOut))
{
d_pedanticFailure = true;
}
}
}
if (options::proofCheck() != options::ProofCheckMode::NONE)
{
d_pnm->ensureChecked(pn.get());
}
uint32_t plevel = d_pnm->getChecker()->getPedanticLevel(r);
if (plevel != 0)
{
d_minPedanticLevel.minAssign(plevel);
}
// record stats for the rule
d_ruleCount << r;
++d_totalRuleCount;
// take stats on the instantiations in the proof
if (r == PfRule::INSTANTIATE)
{
Node q = pn->getChildren()[0]->getResult();
const std::vector<Node>& args = pn->getArguments();
if (args.size() > q[0].getNumChildren())
{
InferenceId id;
if (getInferenceId(args[q[0].getNumChildren()], id))
{
d_instRuleIds << id;
}
}
}
return false;
}
bool ProofFinalCallback::wasPedanticFailure(std::ostream& out) const
{
if (d_pedanticFailure)
{
out << d_pedanticFailureOut.str();
return true;
}
return false;
}
} // namespace smt
} // namespace cvc5
|
