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
|
/********************* */
/*! \file ce_guided_instantiation.h
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2017 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 counterexample guided instantiation class
**/
#include "cvc4_private.h"
#ifndef __CVC4__THEORY__QUANTIFIERS__CE_GUIDED_INSTANTIATION_H
#define __CVC4__THEORY__QUANTIFIERS__CE_GUIDED_INSTANTIATION_H
#include "context/cdhashmap.h"
#include "theory/quantifiers/ce_guided_conjecture.h"
#include "theory/quantifiers_engine.h"
namespace CVC4 {
namespace theory {
namespace quantifiers {
class CegInstantiation : public QuantifiersModule
{
typedef context::CDHashMap<Node, bool, NodeHashFunction> NodeBoolMap;
private:
/** the quantified formula stating the synthesis conjecture */
CegConjecture * d_conj;
/** last instantiation by single invocation module? */
bool d_last_inst_si;
private: //for direct evaluation
/** get refinement evaluation */
void getCRefEvaluationLemmas( CegConjecture * conj, std::vector< Node >& vs, std::vector< Node >& ms, std::vector< Node >& lems );
private:
/** check conjecture */
void checkCegConjecture( CegConjecture * conj );
public:
CegInstantiation( QuantifiersEngine * qe, context::Context* c );
~CegInstantiation();
public:
bool needsCheck( Theory::Effort e );
QEffort needsModel(Theory::Effort e);
/* Call during quantifier engine's check */
void check(Theory::Effort e, QEffort quant_e);
/* Called for new quantifiers */
void registerQuantifier( Node q );
/** get the next decision request */
Node getNextDecisionRequest( unsigned& priority );
/** Identify this module (for debugging, dynamic configuration, etc..) */
std::string identify() const { return "CegInstantiation"; }
/** print solution for synthesis conjectures */
void printSynthSolution( std::ostream& out );
/** get synth solutions
*
* This function adds entries to sol_map that map functions-to-synthesize
* with their solutions, for all active conjectures (currently just the one
* assigned to d_conj). This should be called immediately after the solver
* answers unsat for sygus input.
*
* For details on what is added to sol_map, see
* CegConjecture::getSynthSolutions.
*/
void getSynthSolutions(std::map<Node, Node>& sol_map);
/** preregister assertion (before rewrite) */
void preregisterAssertion( Node n );
public:
class Statistics {
public:
IntStat d_cegqi_lemmas_ce;
IntStat d_cegqi_lemmas_refine;
IntStat d_cegqi_si_lemmas;
IntStat d_solutions;
IntStat d_candidate_rewrites_print;
IntStat d_candidate_rewrites;
Statistics();
~Statistics();
};/* class CegInstantiation::Statistics */
Statistics d_statistics;
}; /* class CegInstantiation */
} /* namespace CVC4::theory::quantifiers */
} /* namespace CVC4::theory */
} /* namespace CVC4 */
#endif
|
