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
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
|
/********************* */
/*! \file proof_generator.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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 Implementation of proof generator utility
**/
#include "expr/proof_generator.h"
#include "expr/proof.h"
#include "expr/proof_node_algorithm.h"
#include "options/smt_options.h"
namespace CVC4 {
std::ostream& operator<<(std::ostream& out, CDPOverwrite opol)
{
switch (opol)
{
case CDPOverwrite::ALWAYS: out << "ALWAYS"; break;
case CDPOverwrite::ASSUME_ONLY: out << "ASSUME_ONLY"; break;
case CDPOverwrite::NEVER: out << "NEVER"; break;
default: out << "CDPOverwrite:unknown"; break;
}
return out;
}
ProofGenerator::ProofGenerator() {}
ProofGenerator::~ProofGenerator() {}
std::shared_ptr<ProofNode> ProofGenerator::getProofFor(Node f)
{
Unreachable() << "ProofGenerator::getProofFor: " << identify()
<< " has no implementation" << std::endl;
return nullptr;
}
bool ProofGenerator::addProofTo(Node f, CDProof* pf, CDPOverwrite opolicy)
{
Trace("pfgen") << "ProofGenerator::addProofTo: " << f << "..." << std::endl;
Assert(pf != nullptr);
// plug in the proof provided by the generator, if it exists
std::shared_ptr<ProofNode> apf = getProofFor(f);
if (apf != nullptr)
{
Trace("pfgen") << "...got proof " << *apf.get() << std::endl;
// Add the proof, without deep copying.
if (pf->addProof(apf, opolicy, false))
{
Trace("pfgen") << "...success!" << std::endl;
return true;
}
Trace("pfgen") << "...failed to add proof" << std::endl;
}
else
{
Trace("pfgen") << "...failed, no proof" << std::endl;
Assert(false) << "Failed to get proof from generator for fact " << f;
}
return false;
}
void pfgEnsureClosed(Node proven,
ProofGenerator* pg,
const char* c,
const char* ctx,
bool reqGen)
{
std::vector<Node> assumps;
pfgEnsureClosedWrt(proven, pg, assumps, c, ctx, reqGen);
}
void pfgEnsureClosedWrt(Node proven,
ProofGenerator* pg,
const std::vector<Node>& assumps,
const char* c,
const char* ctx,
bool reqGen)
{
if (!options::proofNew())
{
// proofs not enabled, do not do check
return;
}
bool isTraceDebug = Trace.isOn(c);
if (!options::proofNewEagerChecking() && !isTraceDebug)
{
// trace is off and proof new eager checking is off, do not do check
return;
}
std::stringstream ss;
ss << "ProofGenerator: " << (pg == nullptr ? "null" : pg->identify())
<< " in context " << ctx;
std::stringstream sdiag;
bool isTraceOn = Trace.isOn(c);
if (!isTraceOn)
{
sdiag << ", use -t " << c << " for details";
}
Trace(c) << "=== pfgEnsureClosed: " << ss.str() << std::endl;
Trace(c) << "Proven: " << proven << std::endl;
if (pg == nullptr)
{
// only failure if flag is true
if (reqGen)
{
Unreachable() << "...pfgEnsureClosed: no generator in context " << ctx
<< sdiag.str();
}
Trace(c) << "...pfgEnsureClosed: no generator in context " << ctx
<< std::endl;
return;
}
std::shared_ptr<ProofNode> pn = pg->getProofFor(proven);
Trace(c) << " Proof: " << *pn.get() << std::endl;
if (pn == nullptr)
{
AlwaysAssert(false) << "...pfgEnsureClosed: null proof from " << ss.str()
<< sdiag.str();
}
std::vector<Node> fassumps;
expr::getFreeAssumptions(pn.get(), fassumps);
bool isClosed = true;
std::stringstream ssf;
for (const Node& fa : fassumps)
{
if (std::find(assumps.begin(), assumps.end(), fa) == assumps.end())
{
isClosed = false;
ssf << "- " << fa << std::endl;
}
}
if (!isClosed)
{
Trace(c) << "Free assumptions:" << std::endl;
Trace(c) << ssf.str();
if (!assumps.empty())
{
Trace(c) << "Expected assumptions:" << std::endl;
for (const Node& a : assumps)
{
Trace(c) << "- " << a << std::endl;
}
}
}
AlwaysAssert(isClosed) << "...pfgEnsureClosed: open proof from " << ss.str()
<< sdiag.str();
Trace(c) << "...pfgEnsureClosed: success" << std::endl;
Trace(c) << "====" << std::endl;
}
} // namespace CVC4
|
