1 /********************* */
4 ** Original author: Christopher L. Conway
5 ** Major contributors: Kshitij Bansal, Morgan Deters
6 ** Minor contributors (to current version): Andrew Reynolds, Clark Barrett, Tianyi Liang
7 ** This file is part of the CVC4 project.
8 ** Copyright (c) 2009-2014 New York University and The University of Iowa
9 ** See the file COPYING in the top-level source directory for licensing
10 ** information.\endverbatim
12 ** \brief Definitions of SMT2 constants.
14 ** Definitions of SMT2 constants.
16 #include "parser/smt2/smt2.h"
19 #include "expr/type.h"
20 #include "parser/antlr_input.h"
21 #include "parser/parser.h"
22 #include "parser/smt1/smt1.h"
23 #include "parser/smt2/smt2_input.h"
24 #include "smt/command.h"
25 #include "util/bitvector.h"
27 // ANTLR defines these, which is really bad!
34 Smt2::Smt2(ExprManager
* exprManager
, Input
* input
, bool strictMode
, bool parseOnly
) :
35 Parser(exprManager
,input
,strictMode
,parseOnly
),
38 d_unsatCoreNames
.push(std::map
<Expr
, std::string
>());
39 if( !strictModeEnabled() ) {
40 addTheory(Smt2::THEORY_CORE
);
44 void Smt2::setLanguage(InputLanguage lang
) {
45 ((Smt2Input
*) getInput())->setLanguage(lang
);
48 void Smt2::addArithmeticOperators() {
49 Parser::addOperator(kind::PLUS
);
50 Parser::addOperator(kind::MINUS
);
51 Parser::addOperator(kind::UMINUS
);
52 Parser::addOperator(kind::MULT
);
53 Parser::addOperator(kind::LT
);
54 Parser::addOperator(kind::LEQ
);
55 Parser::addOperator(kind::GT
);
56 Parser::addOperator(kind::GEQ
);
59 void Smt2::addBitvectorOperators() {
60 addOperator(kind::BITVECTOR_CONCAT
, "concat");
61 addOperator(kind::BITVECTOR_NOT
, "bvnot");
62 addOperator(kind::BITVECTOR_AND
, "bvand");
63 addOperator(kind::BITVECTOR_OR
, "bvor");
64 addOperator(kind::BITVECTOR_NEG
, "bvneg");
65 addOperator(kind::BITVECTOR_PLUS
, "bvadd");
66 addOperator(kind::BITVECTOR_MULT
, "bvmul");
67 addOperator(kind::BITVECTOR_UDIV
, "bvudiv");
68 addOperator(kind::BITVECTOR_UREM
, "bvurem");
69 addOperator(kind::BITVECTOR_SHL
, "bvshl");
70 addOperator(kind::BITVECTOR_LSHR
, "bvlshr");
71 addOperator(kind::BITVECTOR_ULT
, "bvult");
72 addOperator(kind::BITVECTOR_NAND
, "bvnand");
73 addOperator(kind::BITVECTOR_NOR
, "bvnor");
74 addOperator(kind::BITVECTOR_XOR
, "bvxor");
75 addOperator(kind::BITVECTOR_XNOR
, "bvxnor");
76 addOperator(kind::BITVECTOR_COMP
, "bvcomp");
77 addOperator(kind::BITVECTOR_SUB
, "bvsub");
78 addOperator(kind::BITVECTOR_SDIV
, "bvsdiv");
79 addOperator(kind::BITVECTOR_SREM
, "bvsrem");
80 addOperator(kind::BITVECTOR_SMOD
, "bvsmod");
81 addOperator(kind::BITVECTOR_ASHR
, "bvashr");
82 addOperator(kind::BITVECTOR_ULE
, "bvule");
83 addOperator(kind::BITVECTOR_UGT
, "bvugt");
84 addOperator(kind::BITVECTOR_UGE
, "bvuge");
85 addOperator(kind::BITVECTOR_SLT
, "bvslt");
86 addOperator(kind::BITVECTOR_SLE
, "bvsle");
87 addOperator(kind::BITVECTOR_SGT
, "bvsgt");
88 addOperator(kind::BITVECTOR_SGE
, "bvsge");
89 addOperator(kind::BITVECTOR_REDOR
, "bvredor");
90 addOperator(kind::BITVECTOR_REDAND
, "bvredand");
92 Parser::addOperator(kind::BITVECTOR_BITOF
);
93 Parser::addOperator(kind::BITVECTOR_EXTRACT
);
94 Parser::addOperator(kind::BITVECTOR_REPEAT
);
95 Parser::addOperator(kind::BITVECTOR_ZERO_EXTEND
);
96 Parser::addOperator(kind::BITVECTOR_SIGN_EXTEND
);
97 Parser::addOperator(kind::BITVECTOR_ROTATE_LEFT
);
98 Parser::addOperator(kind::BITVECTOR_ROTATE_RIGHT
);
100 Parser::addOperator(kind::INT_TO_BITVECTOR
);
101 Parser::addOperator(kind::BITVECTOR_TO_NAT
);
104 void Smt2::addStringOperators() {
105 addOperator(kind::STRING_CONCAT
, "str.++");
106 addOperator(kind::STRING_LENGTH
, "str.len");
107 addOperator(kind::STRING_SUBSTR
, "str.substr" );
108 addOperator(kind::STRING_STRCTN
, "str.contains" );
109 addOperator(kind::STRING_CHARAT
, "str.at" );
110 addOperator(kind::STRING_STRIDOF
, "str.indexof" );
111 addOperator(kind::STRING_STRREPL
, "str.replace" );
112 addOperator(kind::STRING_PREFIX
, "str.prefixof" );
113 addOperator(kind::STRING_SUFFIX
, "str.suffixof" );
114 addOperator(kind::STRING_ITOS
, "int.to.str" );
115 addOperator(kind::STRING_STOI
, "str.to.int" );
116 addOperator(kind::STRING_U16TOS
, "u16.to.str" );
117 addOperator(kind::STRING_STOU16
, "str.to.u16" );
118 addOperator(kind::STRING_U32TOS
, "u32.to.str" );
119 addOperator(kind::STRING_STOU32
, "str.to.u32" );
120 addOperator(kind::STRING_IN_REGEXP
, "str.in.re");
121 addOperator(kind::STRING_TO_REGEXP
, "str.to.re");
122 addOperator(kind::REGEXP_CONCAT
, "re.++");
123 addOperator(kind::REGEXP_UNION
, "re.union");
124 addOperator(kind::REGEXP_INTER
, "re.inter");
125 addOperator(kind::REGEXP_STAR
, "re.*");
126 addOperator(kind::REGEXP_PLUS
, "re.+");
127 addOperator(kind::REGEXP_OPT
, "re.opt");
128 addOperator(kind::REGEXP_RANGE
, "re.range");
129 addOperator(kind::REGEXP_LOOP
, "re.loop");
132 void Smt2::addFloatingPointOperators() {
133 addOperator(kind::FLOATINGPOINT_FP
, "fp");
134 addOperator(kind::FLOATINGPOINT_EQ
, "fp.eq");
135 addOperator(kind::FLOATINGPOINT_ABS
, "fp.abs");
136 addOperator(kind::FLOATINGPOINT_NEG
, "fp.neg");
137 addOperator(kind::FLOATINGPOINT_PLUS
, "fp.add");
138 addOperator(kind::FLOATINGPOINT_SUB
, "fp.sub");
139 addOperator(kind::FLOATINGPOINT_MULT
, "fp.mul");
140 addOperator(kind::FLOATINGPOINT_DIV
, "fp.div");
141 addOperator(kind::FLOATINGPOINT_FMA
, "fp.fma");
142 addOperator(kind::FLOATINGPOINT_SQRT
, "fp.sqrt");
143 addOperator(kind::FLOATINGPOINT_REM
, "fp.rem");
144 addOperator(kind::FLOATINGPOINT_RTI
, "fp.roundToIntegral");
145 addOperator(kind::FLOATINGPOINT_MIN
, "fp.min");
146 addOperator(kind::FLOATINGPOINT_MAX
, "fp.max");
147 addOperator(kind::FLOATINGPOINT_LEQ
, "fp.leq");
148 addOperator(kind::FLOATINGPOINT_LT
, "fp.lt");
149 addOperator(kind::FLOATINGPOINT_GEQ
, "fp.geq");
150 addOperator(kind::FLOATINGPOINT_GT
, "fp.gt");
151 addOperator(kind::FLOATINGPOINT_ISN
, "fp.isNormal");
152 addOperator(kind::FLOATINGPOINT_ISSN
, "fp.isSubnormal");
153 addOperator(kind::FLOATINGPOINT_ISZ
, "fp.isZero");
154 addOperator(kind::FLOATINGPOINT_ISINF
, "fp.isInfinite");
155 addOperator(kind::FLOATINGPOINT_ISNAN
, "fp.isNaN");
156 addOperator(kind::FLOATINGPOINT_ISNEG
, "fp.isNegative");
157 addOperator(kind::FLOATINGPOINT_ISPOS
, "fp.isPositive");
158 addOperator(kind::FLOATINGPOINT_TO_REAL
, "fp.to_real");
160 Parser::addOperator(kind::FLOATINGPOINT_TO_FP_IEEE_BITVECTOR
);
161 Parser::addOperator(kind::FLOATINGPOINT_TO_FP_FLOATINGPOINT
);
162 Parser::addOperator(kind::FLOATINGPOINT_TO_FP_REAL
);
163 Parser::addOperator(kind::FLOATINGPOINT_TO_FP_SIGNED_BITVECTOR
);
164 Parser::addOperator(kind::FLOATINGPOINT_TO_FP_UNSIGNED_BITVECTOR
);
165 Parser::addOperator(kind::FLOATINGPOINT_TO_UBV
);
166 Parser::addOperator(kind::FLOATINGPOINT_TO_SBV
);
170 void Smt2::addTheory(Theory theory
) {
173 addOperator(kind::SELECT
, "select");
174 addOperator(kind::STORE
, "store");
177 case THEORY_BITVECTORS
:
178 addBitvectorOperators();
182 defineType("Bool", getExprManager()->booleanType());
183 defineVar("true", getExprManager()->mkConst(true));
184 defineVar("false", getExprManager()->mkConst(false));
185 Parser::addOperator(kind::AND
);
186 Parser::addOperator(kind::DISTINCT
);
187 Parser::addOperator(kind::EQUAL
);
188 Parser::addOperator(kind::IFF
);
189 Parser::addOperator(kind::IMPLIES
);
190 Parser::addOperator(kind::ITE
);
191 Parser::addOperator(kind::NOT
);
192 Parser::addOperator(kind::OR
);
193 Parser::addOperator(kind::XOR
);
196 case THEORY_REALS_INTS
:
197 defineType("Real", getExprManager()->realType());
198 Parser::addOperator(kind::DIVISION
);
199 addOperator(kind::TO_INTEGER
, "to_int");
200 addOperator(kind::IS_INTEGER
, "is_int");
201 addOperator(kind::TO_REAL
, "to_real");
202 // falling through on purpose, to add Ints part of Reals_Ints
204 defineType("Int", getExprManager()->integerType());
205 addArithmeticOperators();
206 addOperator(kind::INTS_DIVISION
, "div");
207 addOperator(kind::INTS_MODULUS
, "mod");
208 addOperator(kind::ABS
, "abs");
209 Parser::addOperator(kind::DIVISIBLE
);
213 defineType("Real", getExprManager()->realType());
214 addArithmeticOperators();
215 Parser::addOperator(kind::DIVISION
);
218 case THEORY_QUANTIFIERS
:
222 addOperator(kind::UNION
, "union");
223 addOperator(kind::INTERSECTION
, "intersection");
224 addOperator(kind::SETMINUS
, "setminus");
225 addOperator(kind::SUBSET
, "subset");
226 addOperator(kind::MEMBER
, "member");
227 addOperator(kind::SINGLETON
, "singleton");
228 addOperator(kind::INSERT
, "insert");
231 case THEORY_DATATYPES
:
232 Parser::addOperator(kind::APPLY_CONSTRUCTOR
);
233 Parser::addOperator(kind::APPLY_TESTER
);
234 Parser::addOperator(kind::APPLY_SELECTOR
);
235 Parser::addOperator(kind::APPLY_SELECTOR_TOTAL
);
239 defineType("String", getExprManager()->stringType());
240 defineType("Int", getExprManager()->integerType());
241 addStringOperators();
245 Parser::addOperator(kind::APPLY_UF
);
249 defineType("RoundingMode", getExprManager()->roundingModeType());
250 defineType("Float16", getExprManager()->mkFloatingPointType(5, 11));
251 defineType("Float32", getExprManager()->mkFloatingPointType(8, 24));
252 defineType("Float64", getExprManager()->mkFloatingPointType(11, 53));
253 defineType("Float128", getExprManager()->mkFloatingPointType(15, 113));
254 addFloatingPointOperators();
258 std::stringstream ss
;
259 ss
<< "internal error: unsupported theory " << theory
;
260 throw ParserException(ss
.str());
264 void Smt2::addOperator(Kind kind
, const std::string
& name
) {
265 Debug("parser") << "Smt2::addOperator( " << kind
<< ", " << name
<< " )"
267 Parser::addOperator(kind
);
268 operatorKindMap
[name
] = kind
;
271 Kind
Smt2::getOperatorKind(const std::string
& name
) const {
272 // precondition: isOperatorEnabled(name)
273 return operatorKindMap
.find(name
)->second
;
276 bool Smt2::isOperatorEnabled(const std::string
& name
) const {
277 return operatorKindMap
.find(name
) != operatorKindMap
.end();
280 bool Smt2::isTheoryEnabled(Theory theory
) const {
283 return d_logic
.isTheoryEnabled(theory::THEORY_ARRAY
);
284 case THEORY_BITVECTORS
:
285 return d_logic
.isTheoryEnabled(theory::THEORY_BV
);
288 case THEORY_DATATYPES
:
289 return d_logic
.isTheoryEnabled(theory::THEORY_DATATYPES
);
291 return d_logic
.isTheoryEnabled(theory::THEORY_ARITH
) &&
292 d_logic
.areIntegersUsed() && ( !d_logic
.areRealsUsed() );
294 return d_logic
.isTheoryEnabled(theory::THEORY_ARITH
) &&
295 ( !d_logic
.areIntegersUsed() ) && d_logic
.areRealsUsed();
296 case THEORY_REALS_INTS
:
297 return d_logic
.isTheoryEnabled(theory::THEORY_ARITH
) &&
298 d_logic
.areIntegersUsed() && d_logic
.areRealsUsed();
299 case THEORY_QUANTIFIERS
:
300 return d_logic
.isQuantified();
302 return d_logic
.isTheoryEnabled(theory::THEORY_SETS
);
304 return d_logic
.isTheoryEnabled(theory::THEORY_STRINGS
);
306 return d_logic
.isTheoryEnabled(theory::THEORY_UF
);
308 return d_logic
.isTheoryEnabled(theory::THEORY_FP
);
310 std::stringstream ss
;
311 ss
<< "internal error: unsupported theory " << theory
;
312 throw ParserException(ss
.str());
316 bool Smt2::logicIsSet() {
322 d_logic
= LogicInfo();
323 operatorKindMap
.clear();
324 d_lastNamedTerm
= std::pair
<Expr
, std::string
>();
325 d_unsatCoreNames
= std::stack
< std::map
<Expr
, std::string
> >();
326 this->Parser::reset();
328 d_unsatCoreNames
.push(std::map
<Expr
, std::string
>());
329 if( !strictModeEnabled() ) {
330 addTheory(Smt2::THEORY_CORE
);
334 void Smt2::resetAssertions() {
335 this->Parser::reset();
338 void Smt2::setLogic(std::string name
) {
340 if(name
== "Arrays") {
342 } else if(name
== "Reals") {
344 } else if(name
== "LIA") {
346 } else if(name
== "LRA") {
348 } else if(name
== "LIRA") {
350 } else if(name
== "BV") {
352 } else if(name
== "ALL_SUPPORTED") {
355 std::stringstream ss
;
356 ss
<< "Unknown SyGuS background logic `" << name
<< "'";
357 parseError(ss
.str());
362 if(logicIsForced()) {
363 d_logic
= getForcedLogic();
368 // Core theory belongs to every logic
369 addTheory(THEORY_CORE
);
371 if(d_logic
.isTheoryEnabled(theory::THEORY_UF
)) {
372 addTheory(THEORY_UF
);
375 if(d_logic
.isTheoryEnabled(theory::THEORY_ARITH
)) {
376 if(d_logic
.areIntegersUsed()) {
377 if(d_logic
.areRealsUsed()) {
378 addTheory(THEORY_REALS_INTS
);
380 addTheory(THEORY_INTS
);
382 } else if(d_logic
.areRealsUsed()) {
383 addTheory(THEORY_REALS
);
387 if(d_logic
.isTheoryEnabled(theory::THEORY_ARRAY
)) {
388 addTheory(THEORY_ARRAYS
);
391 if(d_logic
.isTheoryEnabled(theory::THEORY_BV
)) {
392 addTheory(THEORY_BITVECTORS
);
395 if(d_logic
.isTheoryEnabled(theory::THEORY_DATATYPES
)) {
396 addTheory(THEORY_DATATYPES
);
399 if(d_logic
.isTheoryEnabled(theory::THEORY_SETS
)) {
400 addTheory(THEORY_SETS
);
403 if(d_logic
.isTheoryEnabled(theory::THEORY_STRINGS
)) {
404 addTheory(THEORY_STRINGS
);
407 if(d_logic
.isQuantified()) {
408 addTheory(THEORY_QUANTIFIERS
);
411 if (d_logic
.isTheoryEnabled(theory::THEORY_FP
)) {
412 addTheory(THEORY_FP
);
415 }/* Smt2::setLogic() */
417 void Smt2::setInfo(const std::string
& flag
, const SExpr
& sexpr
) {
421 void Smt2::setOption(const std::string
& flag
, const SExpr
& sexpr
) {
425 void Smt2::checkThatLogicIsSet() {
426 if( ! logicIsSet() ) {
427 if(strictModeEnabled()) {
428 parseError("set-logic must appear before this point.");
433 warning("No set-logic command was given before this point.");
434 warning("CVC4 will assume the non-standard ALL_SUPPORTED logic.");
435 warning("Consider setting a stricter logic for (likely) better performance.");
436 warning("To suppress this warning in the future use (set-logic ALL_SUPPORTED).");
438 setLogic("ALL_SUPPORTED");
441 Command
* c
= new SetBenchmarkLogicCommand("ALL_SUPPORTED");
448 /* The include are managed in the lexer but called in the parser */
449 // Inspired by http://www.antlr3.org/api/C/interop.html
451 static bool newInputStream(const std::string
& filename
, pANTLR3_LEXER lexer
) {
452 Debug("parser") << "Including " << filename
<< std::endl
;
453 // Create a new input stream and take advantage of built in stream stacking
454 // in C target runtime.
456 pANTLR3_INPUT_STREAM in
;
457 #ifdef CVC4_ANTLR3_OLD_INPUT_STREAM
458 in
= antlr3AsciiFileStreamNew((pANTLR3_UINT8
) filename
.c_str());
459 #else /* CVC4_ANTLR3_OLD_INPUT_STREAM */
460 in
= antlr3FileStreamNew((pANTLR3_UINT8
) filename
.c_str(), ANTLR3_ENC_8BIT
);
461 #endif /* CVC4_ANTLR3_OLD_INPUT_STREAM */
463 Debug("parser") << "Can't open " << filename
<< std::endl
;
466 // Same thing as the predefined PUSHSTREAM(in);
467 lexer
->pushCharStream(lexer
, in
);
469 //lexer->rec->state->tokenStartCharIndex = -10;
470 //lexer->emit(lexer);
472 // Note that the input stream is not closed when it EOFs, I don't bother
473 // to do it here, but it is up to you to track streams created like this
474 // and destroy them when the whole parse session is complete. Remember that you
475 // don't want to do this until all tokens have been manipulated all the way through
476 // your tree parsers etc as the token does not store the text it just refers
477 // back to the input stream and trying to get the text for it will abort if you
478 // close the input stream too early.
480 //TODO what said before
484 void Smt2::includeFile(const std::string
& filename
) {
485 // security for online version
486 if(!canIncludeFile()) {
487 parseError("include-file feature was disabled for this run.");
491 AntlrInput
* ai
= static_cast<AntlrInput
*>(getInput());
492 pANTLR3_LEXER lexer
= ai
->getAntlr3Lexer();
493 // get the name of the current stream "Does it work inside an include?"
494 const std::string inputName
= ai
->getInputStreamName();
496 // Find the directory of the current input file
498 size_t pos
= inputName
.rfind('/');
499 if(pos
!= std::string::npos
) {
500 path
= std::string(inputName
, 0, pos
+ 1);
502 path
.append(filename
);
503 if(!newInputStream(path
, lexer
)) {
504 parseError("Couldn't open include file `" + path
+ "'");
508 Expr
Smt2::mkSygusVar(const std::string
& name
, const Type
& type
, bool isPrimed
) {
509 Expr e
= mkBoundVar(name
, type
);
510 d_sygusVars
.push_back(e
);
511 d_sygusVarPrimed
[e
] = false;
513 std::stringstream ss
;
515 Expr ep
= mkBoundVar(ss
.str(), type
);
516 d_sygusVars
.push_back(ep
);
517 d_sygusVarPrimed
[ep
] = true;
522 void collectSygusGrammarTypesFor( Type range
, std::vector
< Type
>& types
, std::map
< Type
, std::vector
< DatatypeConstructorArg
> >& sels
){
523 if( !range
.isBoolean() ){
524 if( std::find( types
.begin(), types
.end(), range
)==types
.end() ){
525 Debug("parser-sygus") << "...will make grammar for " << range
<< std::endl
;
526 types
.push_back( range
);
527 if( range
.isDatatype() ){
528 const Datatype
& dt
= ((DatatypeType
)range
).getDatatype();
529 for( unsigned i
=0; i
<dt
.getNumConstructors(); i
++ ){
530 for( unsigned j
=0; j
<dt
[i
].getNumArgs(); j
++ ){
531 Type crange
= ((SelectorType
)dt
[i
][j
].getType()).getRangeType();
532 sels
[crange
].push_back( dt
[i
][j
] );
533 collectSygusGrammarTypesFor( crange
, types
, sels
);
541 void Smt2::mkSygusDefaultGrammar( const Type
& range
, Expr
& bvl
, const std::string
& fun
, std::vector
<CVC4::Datatype
>& datatypes
,
542 std::vector
<Type
>& sorts
, std::vector
< std::vector
<Expr
> >& ops
, std::vector
<Expr
> sygus_vars
, int& startIndex
) {
544 //if( !range.isBoolean() && !range.isInteger() && !range.isBitVector() && !range.isDatatype() ){
545 // parseError("No default grammar for type.");
548 Debug("parser-sygus") << "Construct default grammar for " << fun
<< " " << range
<< std::endl
;
549 std::map
< CVC4::Type
, CVC4::Type
> sygus_to_builtin
;
551 std::vector
< Type
> types
;
552 std::map
< Type
, std::vector
< DatatypeConstructorArg
> > sels
;
553 //types for each of the variables
554 for( unsigned i
=0; i
<sygus_vars
.size(); i
++ ){
555 collectSygusGrammarTypesFor( sygus_vars
[i
].getType(), types
, sels
);
557 //types connected to range
558 collectSygusGrammarTypesFor( range
, types
, sels
);
560 //name of boolean sort
561 std::stringstream ssb
;
562 ssb
<< fun
<< "_Bool";
563 std::string dbname
= ssb
.str();
564 Type unres_bt
= mkUnresolvedType(ssb
.str());
566 std::vector
< Type
> unres_types
;
567 std::map
< Type
, Type
> type_to_unres
;
568 for( unsigned i
=0; i
<types
.size(); i
++ ){
569 std::stringstream ss
;
570 ss
<< fun
<< "_" << types
[i
];
571 std::string dname
= ss
.str();
572 datatypes
.push_back(Datatype(dname
));
573 ops
.push_back(std::vector
<Expr
>());
574 //make unresolved type
575 Type unres_t
= mkUnresolvedType(dname
);
576 unres_types
.push_back(unres_t
);
577 type_to_unres
[types
[i
]] = unres_t
;
578 sygus_to_builtin
[unres_t
] = types
[i
];
580 for( unsigned i
=0; i
<types
.size(); i
++ ){
581 Debug("parser-sygus") << "Make grammar for " << types
[i
] << " " << unres_types
[i
] << std::endl
;
582 std::vector
<std::string
> cnames
;
583 std::vector
<std::vector
<CVC4::Type
> > cargs
;
584 std::vector
<std::string
> unresolved_gterm_sym
;
585 Type unres_t
= unres_types
[i
];
587 for( unsigned j
=0; j
<sygus_vars
.size(); j
++ ){
588 if( sygus_vars
[j
].getType()==types
[i
] ){
589 std::stringstream ss
;
591 Debug("parser-sygus") << "...add for variable " << ss
.str() << std::endl
;
592 ops
[i
].push_back( sygus_vars
[j
] );
593 cnames
.push_back( ss
.str() );
594 cargs
.push_back( std::vector
< CVC4::Type
>() );
598 std::vector
< Expr
> consts
;
599 mkSygusConstantsForType( types
[i
], consts
);
600 for( unsigned j
=0; j
<consts
.size(); j
++ ){
601 std::stringstream ss
;
603 Debug("parser-sygus") << "...add for constant " << ss
.str() << std::endl
;
604 ops
[i
].push_back( consts
[j
] );
605 cnames
.push_back( ss
.str() );
606 cargs
.push_back( std::vector
< CVC4::Type
>() );
609 CVC4::Kind k
= kind::ITE
;
610 Debug("parser-sygus") << "...add for " << k
<< std::endl
;
611 ops
[i
].push_back(getExprManager()->operatorOf(k
));
612 cnames
.push_back( kind::kindToString(k
) );
613 cargs
.push_back( std::vector
< CVC4::Type
>() );
614 cargs
.back().push_back(unres_bt
);
615 cargs
.back().push_back(unres_t
);
616 cargs
.back().push_back(unres_t
);
618 if( types
[i
].isInteger() ){
619 for( unsigned j
=0; j
<2; j
++ ){
620 CVC4::Kind k
= j
==0 ? kind::PLUS
: kind::MINUS
;
621 Debug("parser-sygus") << "...add for " << k
<< std::endl
;
622 ops
[i
].push_back(getExprManager()->operatorOf(k
));
623 cnames
.push_back(kind::kindToString(k
));
624 cargs
.push_back( std::vector
< CVC4::Type
>() );
625 cargs
.back().push_back(unres_t
);
626 cargs
.back().push_back(unres_t
);
628 }else if( types
[i
].isDatatype() ){
629 Debug("parser-sygus") << "...add for constructors" << std::endl
;
630 const Datatype
& dt
= ((DatatypeType
)types
[i
]).getDatatype();
631 for( unsigned k
=0; k
<dt
.getNumConstructors(); k
++ ){
632 Debug("parser-sygus") << "...for " << dt
[k
].getName() << std::endl
;
633 ops
[i
].push_back( dt
[k
].getConstructor() );
634 cnames
.push_back( dt
[k
].getName() );
635 cargs
.push_back( std::vector
< CVC4::Type
>() );
636 for( unsigned j
=0; j
<dt
[k
].getNumArgs(); j
++ ){
637 Type crange
= ((SelectorType
)dt
[k
][j
].getType()).getRangeType();
638 //Assert( type_to_unres.find(crange)!=type_to_unres.end() );
639 cargs
.back().push_back( type_to_unres
[crange
] );
643 std::stringstream sserr
;
644 sserr
<< "No implementation for default Sygus grammar of type " << types
[i
] << std::endl
;
645 warning(sserr
.str());
647 //add for all selectors to this type
648 if( !sels
[types
[i
]].empty() ){
649 Debug("parser-sygus") << "...add for selectors" << std::endl
;
650 for( unsigned j
=0; j
<sels
[types
[i
]].size(); j
++ ){
651 Debug("parser-sygus") << "...for " << sels
[types
[i
]][j
].getName() << std::endl
;
652 Type arg_type
= ((SelectorType
)sels
[types
[i
]][j
].getType()).getDomain();
653 ops
[i
].push_back( sels
[types
[i
]][j
].getSelector() );
654 cnames
.push_back( sels
[types
[i
]][j
].getName() );
655 cargs
.push_back( std::vector
< CVC4::Type
>() );
656 //Assert( type_to_unres.find(arg_type)!=type_to_unres.end() );
657 cargs
.back().push_back( type_to_unres
[arg_type
] );
660 Debug("parser-sygus") << "...make datatype " << datatypes
.back() << std::endl
;
661 datatypes
[i
].setSygus( types
[i
], bvl
, true, true );
662 mkSygusDatatype( datatypes
[i
], ops
[i
], cnames
, cargs
, unresolved_gterm_sym
, sygus_to_builtin
);
663 sorts
.push_back( types
[i
] );
664 //set start index if applicable
665 if( types
[i
]==range
){
671 Type btype
= getExprManager()->booleanType();
672 datatypes
.push_back(Datatype(dbname
));
673 ops
.push_back(std::vector
<Expr
>());
674 std::vector
<std::string
> cnames
;
675 std::vector
<std::vector
<CVC4::Type
> > cargs
;
676 std::vector
<std::string
> unresolved_gterm_sym
;
677 Debug("parser-sygus") << "Make grammar for " << btype
<< " " << datatypes
.back() << std::endl
;
679 for( unsigned i
=0; i
<sygus_vars
.size(); i
++ ){
680 if( sygus_vars
[i
].getType().isBoolean() ){
681 std::stringstream ss
;
683 Debug("parser-sygus") << "...add for variable " << ss
.str() << std::endl
;
684 ops
.back().push_back( sygus_vars
[i
] );
685 cnames
.push_back( ss
.str() );
686 cargs
.push_back( std::vector
< CVC4::Type
>() );
689 //add constants if no variables and no connected types
690 if( ops
.back().empty() && types
.empty() ){
691 std::vector
< Expr
> consts
;
692 mkSygusConstantsForType( btype
, consts
);
693 for( unsigned j
=0; j
<consts
.size(); j
++ ){
694 std::stringstream ss
;
696 Debug("parser-sygus") << "...add for constant " << ss
.str() << std::endl
;
697 ops
.back().push_back( consts
[j
] );
698 cnames
.push_back( ss
.str() );
699 cargs
.push_back( std::vector
< CVC4::Type
>() );
703 for( unsigned i
=0; i
<3; i
++ ){
704 CVC4::Kind k
= i
==0 ? kind::NOT
: ( i
==1 ? kind::AND
: kind::OR
);
705 Debug("parser-sygus") << "...add for " << k
<< std::endl
;
706 ops
.back().push_back(getExprManager()->operatorOf(k
));
707 cnames
.push_back(kind::kindToString(k
));
708 cargs
.push_back( std::vector
< CVC4::Type
>() );
710 cargs
.back().push_back(unres_bt
);
711 }else if( k
==kind::AND
|| k
==kind::OR
){
712 cargs
.back().push_back(unres_bt
);
713 cargs
.back().push_back(unres_bt
);
716 //add predicates for types
717 for( unsigned i
=0; i
<types
.size(); i
++ ){
718 Debug("parser-sygus") << "...add predicates for " << types
[i
] << std::endl
;
719 //add equality per type
720 CVC4::Kind k
= kind::EQUAL
;
721 Debug("parser-sygus") << "...add for " << k
<< std::endl
;
722 ops
.back().push_back(getExprManager()->operatorOf(k
));
723 std::stringstream ss
;
724 ss
<< kind::kindToString(k
) << "_" << types
[i
];
725 cnames
.push_back(ss
.str());
726 cargs
.push_back( std::vector
< CVC4::Type
>() );
727 cargs
.back().push_back(unres_types
[i
]);
728 cargs
.back().push_back(unres_types
[i
]);
729 //type specific predicates
730 if( types
[i
].isInteger() ){
731 CVC4::Kind k
= kind::LEQ
;
732 Debug("parser-sygus") << "...add for " << k
<< std::endl
;
733 ops
.back().push_back(getExprManager()->operatorOf(k
));
734 cnames
.push_back(kind::kindToString(k
));
735 cargs
.push_back( std::vector
< CVC4::Type
>() );
736 cargs
.back().push_back(unres_types
[i
]);
737 cargs
.back().push_back(unres_types
[i
]);
738 }else if( types
[i
].isDatatype() ){
740 Debug("parser-sygus") << "...add for testers" << std::endl
;
741 const Datatype
& dt
= ((DatatypeType
)types
[i
]).getDatatype();
742 for( unsigned k
=0; k
<dt
.getNumConstructors(); k
++ ){
743 Debug("parser-sygus") << "...for " << dt
[k
].getTesterName() << std::endl
;
744 ops
.back().push_back(dt
[k
].getTester());
745 cnames
.push_back(dt
[k
].getTesterName());
746 cargs
.push_back( std::vector
< CVC4::Type
>() );
747 cargs
.back().push_back(unres_types
[i
]);
752 startIndex
= sorts
.size();
754 Debug("parser-sygus") << "...make datatype " << datatypes
.back() << std::endl
;
755 datatypes
.back().setSygus( btype
, bvl
, true, true );
756 mkSygusDatatype( datatypes
.back(), ops
.back(), cnames
, cargs
, unresolved_gterm_sym
, sygus_to_builtin
);
757 sorts
.push_back( btype
);
759 Debug("parser-sygus") << "...finished make default grammar for " << fun
<< " " << range
<< std::endl
;
762 void Smt2::mkSygusConstantsForType( const Type
& type
, std::vector
<CVC4::Expr
>& ops
) {
763 if( type
.isInteger() ){
764 ops
.push_back(getExprManager()->mkConst(Rational(0)));
765 ops
.push_back(getExprManager()->mkConst(Rational(1)));
766 }else if( type
.isBitVector() ){
767 unsigned sz
= ((BitVectorType
)type
).getSize();
768 BitVector
bval0(sz
, (unsigned int)0);
769 ops
.push_back( getExprManager()->mkConst(bval0
) );
770 BitVector
bval1(sz
, (unsigned int)1);
771 ops
.push_back( getExprManager()->mkConst(bval1
) );
772 }else if( type
.isBoolean() ){
773 ops
.push_back(getExprManager()->mkConst(true));
774 ops
.push_back(getExprManager()->mkConst(false));
779 // This method adds N operators to ops[index], N names to cnames[index] and N type argument vectors to cargs[index] (where typically N=1)
780 // This method may also add new elements pairwise into datatypes/sorts/ops/cnames/cargs in the case of non-flat gterms.
781 void Smt2::processSygusGTerm( CVC4::SygusGTerm
& sgt
, int index
,
782 std::vector
< CVC4::Datatype
>& datatypes
,
783 std::vector
< CVC4::Type
>& sorts
,
784 std::vector
< std::vector
<CVC4::Expr
> >& ops
,
785 std::vector
< std::vector
<std::string
> >& cnames
,
786 std::vector
< std::vector
< std::vector
< CVC4::Type
> > >& cargs
,
787 std::vector
< bool >& allow_const
,
788 std::vector
< std::vector
< std::string
> >& unresolved_gterm_sym
,
789 std::vector
<CVC4::Expr
>& sygus_vars
,
790 std::map
< CVC4::Type
, CVC4::Type
>& sygus_to_builtin
, std::map
< CVC4::Type
, CVC4::Expr
>& sygus_to_builtin_expr
,
791 CVC4::Type
& ret
, bool isNested
){
792 if( sgt
.d_gterm_type
==SygusGTerm::gterm_op
|| sgt
.d_gterm_type
==SygusGTerm::gterm_let
){
793 Debug("parser-sygus") << "Add " << sgt
.d_expr
<< " to datatype " << index
<< std::endl
;
795 Kind newKind
= kind::UNDEFINED_KIND
;
796 //convert to UMINUS if one child of MINUS
797 if( sgt
.d_children
.size()==1 && sgt
.d_expr
==getExprManager()->operatorOf(kind::MINUS
) ){
798 oldKind
= kind::MINUS
;
799 newKind
= kind::UMINUS
;
801 //convert to IFF if boolean EQUAL
802 if( sgt
.d_expr
==getExprManager()->operatorOf(kind::EQUAL
) ){
803 Type ctn
= sgt
.d_children
[0].d_type
;
804 std::map
< CVC4::Type
, CVC4::Type
>::iterator it
= sygus_to_builtin
.find( ctn
);
805 if( it
!= sygus_to_builtin
.end() && it
->second
.isBoolean() ){
806 oldKind
= kind::EQUAL
;
810 if( newKind
!=kind::UNDEFINED_KIND
){
811 Expr newExpr
= getExprManager()->operatorOf(newKind
);
812 Debug("parser-sygus") << "Replace " << sgt
.d_expr
<< " with " << newExpr
<< std::endl
;
813 sgt
.d_expr
= newExpr
;
814 std::string oldName
= kind::kindToString(oldKind
);
815 std::string newName
= kind::kindToString(newKind
);
817 if((pos
= sgt
.d_name
.find(oldName
, pos
)) != std::string::npos
){
818 sgt
.d_name
.replace(pos
, oldName
.length(), newName
);
821 ops
[index
].push_back( sgt
.d_expr
);
822 cnames
[index
].push_back( sgt
.d_name
);
823 cargs
[index
].push_back( std::vector
< CVC4::Type
>() );
824 for( unsigned i
=0; i
<sgt
.d_children
.size(); i
++ ){
825 std::stringstream ss
;
826 ss
<< datatypes
[index
].getName() << "_" << ops
[index
].size() << "_arg_" << i
;
827 std::string sub_dname
= ss
.str();
828 //add datatype for child
830 pushSygusDatatypeDef( null_type
, sub_dname
, datatypes
, sorts
, ops
, cnames
, cargs
, allow_const
, unresolved_gterm_sym
);
831 int sub_dt_index
= datatypes
.size()-1;
834 processSygusGTerm( sgt
.d_children
[i
], sub_dt_index
, datatypes
, sorts
, ops
, cnames
, cargs
, allow_const
, unresolved_gterm_sym
,
835 sygus_vars
, sygus_to_builtin
, sygus_to_builtin_expr
, sub_ret
, true );
836 //process the nested gterm (either pop the last datatype, or flatten the argument)
837 Type tt
= processSygusNestedGTerm( sub_dt_index
, sub_dname
, datatypes
, sorts
, ops
, cnames
, cargs
, allow_const
, unresolved_gterm_sym
,
838 sygus_to_builtin
, sygus_to_builtin_expr
, sub_ret
);
839 cargs
[index
].back().push_back(tt
);
841 //if let, must create operator
842 if( sgt
.d_gterm_type
==SygusGTerm::gterm_let
){
843 processSygusLetConstructor( sgt
.d_let_vars
, index
, datatypes
, sorts
, ops
, cnames
, cargs
,
844 sygus_vars
, sygus_to_builtin
, sygus_to_builtin_expr
);
846 }else if( sgt
.d_gterm_type
==SygusGTerm::gterm_constant
){
847 if( sgt
.getNumChildren()!=0 ){
848 parseError("Bad syntax for Sygus Constant.");
850 std::vector
< Expr
> consts
;
851 mkSygusConstantsForType( sgt
.d_type
, consts
);
852 Debug("parser-sygus") << "...made " << consts
.size() << " constants." << std::endl
;
853 for( unsigned i
=0; i
<consts
.size(); i
++ ){
854 std::stringstream ss
;
856 Debug("parser-sygus") << "...add for constant " << ss
.str() << std::endl
;
857 ops
[index
].push_back( consts
[i
] );
858 cnames
[index
].push_back( ss
.str() );
859 cargs
[index
].push_back( std::vector
< CVC4::Type
>() );
861 allow_const
[index
] = true;
862 }else if( sgt
.d_gterm_type
==SygusGTerm::gterm_variable
|| sgt
.d_gterm_type
==SygusGTerm::gterm_input_variable
){
863 if( sgt
.getNumChildren()!=0 ){
864 parseError("Bad syntax for Sygus Variable.");
866 Debug("parser-sygus") << "...process " << sygus_vars
.size() << " variables." << std::endl
;
867 for( unsigned i
=0; i
<sygus_vars
.size(); i
++ ){
868 if( sygus_vars
[i
].getType()==sgt
.d_type
){
869 std::stringstream ss
;
871 Debug("parser-sygus") << "...add for variable " << ss
.str() << std::endl
;
872 ops
[index
].push_back( sygus_vars
[i
] );
873 cnames
[index
].push_back( ss
.str() );
874 cargs
[index
].push_back( std::vector
< CVC4::Type
>() );
877 }else if( sgt
.d_gterm_type
==SygusGTerm::gterm_nested_sort
){
879 }else if( sgt
.d_gterm_type
==SygusGTerm::gterm_unresolved
){
881 if( isUnresolvedType(sgt
.d_name
) ){
882 ret
= getSort(sgt
.d_name
);
884 //nested, unresolved symbol...fail
885 std::stringstream ss
;
886 ss
<< "Cannot handle nested unresolved symbol " << sgt
.d_name
<< std::endl
;
887 parseError(ss
.str());
890 //will resolve when adding constructors
891 unresolved_gterm_sym
[index
].push_back(sgt
.d_name
);
893 }else if( sgt
.d_gterm_type
==SygusGTerm::gterm_ignore
){
898 bool Smt2::pushSygusDatatypeDef( Type t
, std::string
& dname
,
899 std::vector
< CVC4::Datatype
>& datatypes
,
900 std::vector
< CVC4::Type
>& sorts
,
901 std::vector
< std::vector
<CVC4::Expr
> >& ops
,
902 std::vector
< std::vector
<std::string
> >& cnames
,
903 std::vector
< std::vector
< std::vector
< CVC4::Type
> > >& cargs
,
904 std::vector
< bool >& allow_const
,
905 std::vector
< std::vector
< std::string
> >& unresolved_gterm_sym
){
907 datatypes
.push_back(Datatype(dname
));
908 ops
.push_back(std::vector
<Expr
>());
909 cnames
.push_back(std::vector
<std::string
>());
910 cargs
.push_back(std::vector
<std::vector
<CVC4::Type
> >());
911 allow_const
.push_back(false);
912 unresolved_gterm_sym
.push_back(std::vector
< std::string
>());
916 bool Smt2::popSygusDatatypeDef( std::vector
< CVC4::Datatype
>& datatypes
,
917 std::vector
< CVC4::Type
>& sorts
,
918 std::vector
< std::vector
<CVC4::Expr
> >& ops
,
919 std::vector
< std::vector
<std::string
> >& cnames
,
920 std::vector
< std::vector
< std::vector
< CVC4::Type
> > >& cargs
,
921 std::vector
< bool >& allow_const
,
922 std::vector
< std::vector
< std::string
> >& unresolved_gterm_sym
){
924 datatypes
.pop_back();
928 allow_const
.pop_back();
929 unresolved_gterm_sym
.pop_back();
933 Type
Smt2::processSygusNestedGTerm( int sub_dt_index
, std::string
& sub_dname
, std::vector
< CVC4::Datatype
>& datatypes
,
934 std::vector
< CVC4::Type
>& sorts
,
935 std::vector
< std::vector
<CVC4::Expr
> >& ops
,
936 std::vector
< std::vector
<std::string
> >& cnames
,
937 std::vector
< std::vector
< std::vector
< CVC4::Type
> > >& cargs
,
938 std::vector
< bool >& allow_const
,
939 std::vector
< std::vector
< std::string
> >& unresolved_gterm_sym
,
940 std::map
< CVC4::Type
, CVC4::Type
>& sygus_to_builtin
,
941 std::map
< CVC4::Type
, CVC4::Expr
>& sygus_to_builtin_expr
, Type sub_ret
) {
943 Debug("parser-sygus") << "Argument is ";
945 //then, it is the datatype we constructed, which should have a single constructor
946 t
= mkUnresolvedType(sub_dname
);
947 Debug("parser-sygus") << "inline flattening of (auxiliary, local) datatype " << t
<< std::endl
;
948 Debug("parser-sygus") << ": to compute type, construct ground term witnessing the grammar, #cons=" << cargs
[sub_dt_index
].size() << std::endl
;
949 if( cargs
[sub_dt_index
].empty() ){
950 parseError(std::string("Internal error : datatype for nested gterm does not have a constructor."));
952 Expr sop
= ops
[sub_dt_index
][0];
954 if( sop
.getKind() != kind::BUILTIN
&& ( sop
.isConst() || cargs
[sub_dt_index
][0].empty() ) ){
955 curr_t
= sop
.getType();
956 Debug("parser-sygus") << ": it is constant/0-arg cons " << sop
<< " with type " << sop
.getType() << ", debug=" << sop
.isConst() << " " << cargs
[sub_dt_index
][0].size() << std::endl
;
957 sygus_to_builtin_expr
[t
] = sop
;
958 //store that term sop has dedicated sygus type t
959 if( d_sygus_bound_var_type
.find( sop
)==d_sygus_bound_var_type
.end() ){
960 d_sygus_bound_var_type
[sop
] = t
;
963 std::vector
< Expr
> children
;
964 if( sop
.getKind() != kind::BUILTIN
){
965 children
.push_back( sop
);
967 for( unsigned i
=0; i
<cargs
[sub_dt_index
][0].size(); i
++ ){
968 std::map
< CVC4::Type
, CVC4::Expr
>::iterator it
= sygus_to_builtin_expr
.find( cargs
[sub_dt_index
][0][i
] );
969 if( it
==sygus_to_builtin_expr
.end() ){
970 if( sygus_to_builtin
.find( cargs
[sub_dt_index
][0][i
] )==sygus_to_builtin
.end() ){
971 std::stringstream ss
;
972 ss
<< "Missing builtin type for type " << cargs
[sub_dt_index
][0][i
] << "!" << std::endl
;
973 ss
<< "Builtin types are currently : " << std::endl
;
974 for( std::map
< CVC4::Type
, CVC4::Type
>::iterator itb
= sygus_to_builtin
.begin(); itb
!= sygus_to_builtin
.end(); ++itb
){
975 ss
<< " " << itb
->first
<< " -> " << itb
->second
<< std::endl
;
977 parseError(ss
.str());
979 Type bt
= sygus_to_builtin
[cargs
[sub_dt_index
][0][i
]];
980 Debug("parser-sygus") << ": child " << i
<< " introduce type elem for " << cargs
[sub_dt_index
][0][i
] << " " << bt
<< std::endl
;
981 std::stringstream ss
;
982 ss
<< t
<< "_x_" << i
;
983 Expr bv
= mkBoundVar(ss
.str(), bt
);
984 children
.push_back( bv
);
985 d_sygus_bound_var_type
[bv
] = cargs
[sub_dt_index
][0][i
];
987 Debug("parser-sygus") << ": child " << i
<< " existing sygus to builtin expr : " << it
->second
<< std::endl
;
988 children
.push_back( it
->second
);
991 Kind sk
= sop
.getKind() != kind::BUILTIN
? kind::APPLY
: getExprManager()->operatorToKind(sop
);
992 Debug("parser-sygus") << ": operator " << sop
<< " with " << sop
.getKind() << " " << sk
<< std::endl
;
993 Expr e
= getExprManager()->mkExpr( sk
, children
);
994 Debug("parser-sygus") << ": constructed " << e
<< ", which has type " << e
.getType() << std::endl
;
995 curr_t
= e
.getType();
996 sygus_to_builtin_expr
[t
] = e
;
998 sorts
[sub_dt_index
] = curr_t
;
999 sygus_to_builtin
[t
] = curr_t
;
1001 Debug("parser-sygus") << "simple argument " << t
<< std::endl
;
1002 Debug("parser-sygus") << "...removing " << datatypes
.back().getName() << std::endl
;
1003 //otherwise, datatype was unecessary
1004 //pop argument datatype definition
1005 popSygusDatatypeDef( datatypes
, sorts
, ops
, cnames
, cargs
, allow_const
, unresolved_gterm_sym
);
1010 void Smt2::processSygusLetConstructor( std::vector
< CVC4::Expr
>& let_vars
,
1012 std::vector
< CVC4::Datatype
>& datatypes
,
1013 std::vector
< CVC4::Type
>& sorts
,
1014 std::vector
< std::vector
<CVC4::Expr
> >& ops
,
1015 std::vector
< std::vector
<std::string
> >& cnames
,
1016 std::vector
< std::vector
< std::vector
< CVC4::Type
> > >& cargs
,
1017 std::vector
<CVC4::Expr
>& sygus_vars
,
1018 std::map
< CVC4::Type
, CVC4::Type
>& sygus_to_builtin
,
1019 std::map
< CVC4::Type
, CVC4::Expr
>& sygus_to_builtin_expr
) {
1020 std::vector
< CVC4::Expr
> let_define_args
;
1022 int dindex
= cargs
[index
].size()-1;
1023 Debug("parser-sygus") << "Process let constructor for datatype " << datatypes
[index
].getName() << ", #subtypes = " << cargs
[index
][dindex
].size() << std::endl
;
1024 for( unsigned i
=0; i
<cargs
[index
][dindex
].size(); i
++ ){
1025 Debug("parser-sygus") << " " << i
<< " : " << cargs
[index
][dindex
][i
] << std::endl
;
1026 if( i
+1==cargs
[index
][dindex
].size() ){
1027 std::map
< CVC4::Type
, CVC4::Expr
>::iterator it
= sygus_to_builtin_expr
.find( cargs
[index
][dindex
][i
] );
1028 if( it
!=sygus_to_builtin_expr
.end() ){
1029 let_body
= it
->second
;
1031 std::stringstream ss
;
1032 ss
<< datatypes
[index
].getName() << "_body";
1033 let_body
= mkBoundVar(ss
.str(), sygus_to_builtin
[cargs
[index
][dindex
][i
]]);
1034 d_sygus_bound_var_type
[let_body
] = cargs
[index
][dindex
][i
];
1038 Debug("parser-sygus") << std::endl
;
1039 Debug("parser-sygus") << "Body is " << let_body
<< std::endl
;
1040 Debug("parser-sygus") << "# let vars = " << let_vars
.size() << std::endl
;
1041 for( unsigned i
=0; i
<let_vars
.size(); i
++ ){
1042 Debug("parser-sygus") << " let var " << i
<< " : " << let_vars
[i
] << " " << let_vars
[i
].getType() << std::endl
;
1043 let_define_args
.push_back( let_vars
[i
] );
1046 Debug("parser-sygus") << "index = " << index << ", start index = " << start_index << ", #Current datatypes = " << datatypes.size() << std::endl;
1047 for( unsigned i=start_index; i<datatypes.size(); i++ ){
1048 Debug("parser-sygus") << " datatype " << i << " : " << datatypes[i].getName() << ", #cons = " << cargs[i].size() << std::endl;
1049 if( !cargs[i].empty() ){
1050 Debug("parser-sygus") << " operator 0 is " << ops[i][0] << std::endl;
1051 Debug("parser-sygus") << " cons 0 has " << cargs[i][0].size() << " sub fields." << std::endl;
1052 for( unsigned j=0; j<cargs[i][0].size(); j++ ){
1053 Type bt = sygus_to_builtin[cargs[i][0][j]];
1054 Debug("parser-sygus") << " cons 0, selector " << j << " : " << cargs[i][0][j] << " " << bt << std::endl;
1059 //last argument is the return, pop
1060 cargs
[index
][dindex
].pop_back();
1061 collectSygusLetArgs( let_body
, cargs
[index
][dindex
], let_define_args
);
1063 Debug("parser-sygus") << "Make define-fun with " << cargs
[index
][dindex
].size() << " arguments..." << std::endl
;
1064 std::vector
<CVC4::Type
> fsorts
;
1065 for( unsigned i
=0; i
<cargs
[index
][dindex
].size(); i
++ ){
1066 Debug("parser-sygus") << " " << i
<< " : " << let_define_args
[i
] << " " << let_define_args
[i
].getType() << " " << cargs
[index
][dindex
][i
] << std::endl
;
1067 fsorts
.push_back(let_define_args
[i
].getType());
1070 Type ft
= getExprManager()->mkFunctionType(fsorts
, let_body
.getType());
1071 std::stringstream ss
;
1072 ss
<< datatypes
[index
].getName() << "_let";
1073 Expr let_func
= mkFunction(ss
.str(), ft
, ExprManager::VAR_FLAG_DEFINED
);
1074 d_sygus_defined_funs
.push_back( let_func
);
1075 preemptCommand( new DefineFunctionCommand(ss
.str(), let_func
, let_define_args
, let_body
) );
1077 ops
[index
].pop_back();
1078 ops
[index
].push_back( let_func
);
1079 cnames
[index
].pop_back();
1080 cnames
[index
].push_back(ss
.str());
1082 //mark function as let constructor
1083 d_sygus_let_func_to_vars
[let_func
].insert( d_sygus_let_func_to_vars
[let_func
].end(), let_define_args
.begin(), let_define_args
.end() );
1084 d_sygus_let_func_to_body
[let_func
] = let_body
;
1085 d_sygus_let_func_to_num_input_vars
[let_func
] = let_vars
.size();
1089 void Smt2::collectSygusLetArgs( CVC4::Expr e
, std::vector
< CVC4::Type
>& sygusArgs
, std::vector
< CVC4::Expr
>& builtinArgs
) {
1090 if( e
.getKind()==kind::BOUND_VARIABLE
){
1091 if( std::find( builtinArgs
.begin(), builtinArgs
.end(), e
)==builtinArgs
.end() ){
1092 builtinArgs
.push_back( e
);
1093 sygusArgs
.push_back( d_sygus_bound_var_type
[e
] );
1094 if( d_sygus_bound_var_type
[e
].isNull() ){
1095 std::stringstream ss
;
1096 ss
<< "While constructing body of let gterm, can't map " << e
<< " to sygus type." << std::endl
;
1097 parseError(ss
.str());
1101 for( unsigned i
=0; i
<e
.getNumChildren(); i
++ ){
1102 collectSygusLetArgs( e
[i
], sygusArgs
, builtinArgs
);
1107 void Smt2::setSygusStartIndex( std::string
& fun
, int startIndex
,
1108 std::vector
< CVC4::Datatype
>& datatypes
,
1109 std::vector
< CVC4::Type
>& sorts
,
1110 std::vector
< std::vector
<CVC4::Expr
> >& ops
) {
1112 CVC4::Datatype tmp_dt
= datatypes
[0];
1113 Type tmp_sort
= sorts
[0];
1114 std::vector
< Expr
> tmp_ops
;
1115 tmp_ops
.insert( tmp_ops
.end(), ops
[0].begin(), ops
[0].end() );
1116 datatypes
[0] = datatypes
[startIndex
];
1117 sorts
[0] = sorts
[startIndex
];
1119 ops
[0].insert( ops
[0].end(), ops
[startIndex
].begin(), ops
[startIndex
].end() );
1120 datatypes
[startIndex
] = tmp_dt
;
1121 sorts
[startIndex
] = tmp_sort
;
1122 ops
[startIndex
].clear();
1123 ops
[startIndex
].insert( ops
[startIndex
].begin(), tmp_ops
.begin(), tmp_ops
.end() );
1124 }else if( startIndex
<0 ){
1125 std::stringstream ss
;
1126 ss
<< "warning: no symbol named Start for synth-fun " << fun
<< std::endl
;
1131 void Smt2::defineSygusFuns() {
1132 // only define each one once
1133 while(d_nextSygusFun
< d_sygusFuns
.size()) {
1134 std::pair
<std::string
, Expr
> p
= d_sygusFuns
[d_nextSygusFun
];
1135 std::string fun
= p
.first
;
1136 Debug("parser-sygus") << "Sygus : define fun " << fun
<< std::endl
;
1137 Expr eval
= p
.second
;
1138 FunctionType evalType
= eval
.getType();
1139 std::vector
<Type
> argTypes
= evalType
.getArgTypes();
1140 Type rangeType
= evalType
.getRangeType();
1141 Debug("parser-sygus") << "...eval type : " << evalType
<< ", #args=" << argTypes
.size() << std::endl
;
1143 // first make the function type
1144 std::vector
<Expr
> sygusVars
;
1145 std::vector
<Type
> funType
;
1146 for(size_t j
= 1; j
< argTypes
.size(); ++j
) {
1147 funType
.push_back(argTypes
[j
]);
1148 std::stringstream ss
;
1149 ss
<< fun
<< "_v_" << j
;
1150 sygusVars
.push_back(getExprManager()->mkBoundVar(ss
.str(), argTypes
[j
]));
1153 if( !funType
.empty() ){
1154 funt
= getExprManager()->mkFunctionType(funType
, rangeType
);
1155 Debug("parser-sygus") << "...eval function type : " << funt
<< std::endl
;
1157 // copy the bound vars
1159 std::vector<Expr> sygusVars;
1160 //std::vector<Type> types;
1161 for(size_t i = 0; i < d_sygusVars.size(); ++i) {
1162 std::stringstream ss;
1163 ss << d_sygusVars[i];
1164 Type type = d_sygusVars[i].getType();
1165 sygusVars.push_back(getExprManager()->mkBoundVar(ss.str(), type));
1166 //types.push_back(type);
1168 Debug("parser-sygus") << "...made vars, #vars=" << sygusVars.size() << std::endl;
1171 //Type t = getExprManager()->mkFunctionType(types, rangeType);
1172 //Debug("parser-sygus") << "...function type : " << t << std::endl;
1176 Expr lambda
= mkFunction(fun
, funt
, ExprManager::VAR_FLAG_DEFINED
);
1177 Debug("parser-sygus") << "...made function : " << lambda
<< std::endl
;
1178 std::vector
<Expr
> applyv
;
1179 Expr funbv
= getExprManager()->mkBoundVar(std::string("f") + fun
, argTypes
[0]);
1180 d_sygusFunSymbols
.push_back(funbv
);
1181 applyv
.push_back(eval
);
1182 applyv
.push_back(funbv
);
1183 for(size_t i
= 0; i
< sygusVars
.size(); ++i
) {
1184 applyv
.push_back(sygusVars
[i
]);
1186 Expr apply
= getExprManager()->mkExpr(kind::APPLY_UF
, applyv
);
1187 Debug("parser-sygus") << "...made apply " << apply
<< std::endl
;
1188 Debug("parser-sygus") << "--> Define " << fun
<< " as " << lambda
<< " " << apply
<< std::endl
;
1189 Command
* cmd
= new DefineFunctionCommand(fun
, lambda
, sygusVars
, apply
);
1190 preemptCommand(cmd
);
1196 void Smt2::mkSygusDatatype( CVC4::Datatype
& dt
, std::vector
<CVC4::Expr
>& ops
,
1197 std::vector
<std::string
>& cnames
, std::vector
< std::vector
< CVC4::Type
> >& cargs
,
1198 std::vector
<std::string
>& unresolved_gterm_sym
,
1199 std::map
< CVC4::Type
, CVC4::Type
>& sygus_to_builtin
) {
1200 Debug("parser-sygus") << "Making sygus datatype " << dt
.getName() << std::endl
;
1201 Debug("parser-sygus") << " add constructors..." << std::endl
;
1202 for( int i
=0; i
<(int)cnames
.size(); i
++ ){
1203 bool is_dup
= false;
1204 bool is_dup_op
= false;
1206 std::vector
< Expr
> let_args
;
1207 unsigned let_num_input_args
= 0;
1208 for( int j
=0; j
<i
; j
++ ){
1209 if( ops
[i
]==ops
[j
] ){
1211 if( cargs
[i
].size()==cargs
[j
].size() ){
1213 for( unsigned k
=0; k
<cargs
[i
].size(); k
++ ){
1214 if( cargs
[i
][k
]!=cargs
[j
][k
] ){
1226 Debug("parser-sygus") << "--> Duplicate gterm : " << ops
[i
] << " at " << i
<< std::endl
;
1227 ops
.erase( ops
.begin() + i
, ops
.begin() + i
+ 1 );
1228 cnames
.erase( cnames
.begin() + i
, cnames
.begin() + i
+ 1 );
1229 cargs
.erase( cargs
.begin() + i
, cargs
.begin() + i
+ 1 );
1231 }else if( is_dup_op
){
1232 Debug("parser-sygus") << "--> Duplicate gterm operator : " << ops
[i
] << " at " << i
<< std::endl
;
1233 //make into define-fun
1234 std::vector
<CVC4::Type
> fsorts
;
1235 for( unsigned j
=0; j
<cargs
[i
].size(); j
++ ){
1236 Type bt
= sygus_to_builtin
[cargs
[i
][j
]];
1237 std::stringstream ss
;
1238 ss
<< dt
.getName() << "_x_" << i
<< "_" << j
;
1239 Expr v
= mkBoundVar(ss
.str(), bt
);
1240 let_args
.push_back( v
);
1241 fsorts
.push_back( bt
);
1242 Debug("parser-sygus") << ": var " << i
<< " " << v
<< " with type " << bt
<< " from " << cargs
[i
][j
] << std::endl
;
1245 std::vector
< Expr
> children
;
1246 if( ops
[i
].getKind() != kind::BUILTIN
){
1247 children
.push_back( ops
[i
] );
1249 children
.insert( children
.end(), let_args
.begin(), let_args
.end() );
1250 Kind sk
= ops
[i
].getKind() != kind::BUILTIN
? kind::APPLY
: getExprManager()->operatorToKind(ops
[i
]);
1251 Debug("parser-sygus") << ": replace " << ops
[i
] << " " << ops
[i
].getKind() << " " << sk
<< std::endl
;
1252 let_body
= getExprManager()->mkExpr( sk
, children
);
1253 Debug("parser-sygus") << ": new body of function is " << let_body
<< std::endl
;
1255 Type ft
= getExprManager()->mkFunctionType(fsorts
, let_body
.getType());
1256 Debug("parser-sygus") << ": function type is " << ft
<< std::endl
;
1257 std::stringstream ss
;
1258 ss
<< dt
.getName() << "_df_" << i
;
1259 //replace operator and name
1260 ops
[i
] = mkFunction(ss
.str(), ft
, ExprManager::VAR_FLAG_DEFINED
);
1261 cnames
[i
] = ss
.str();
1262 d_sygus_defined_funs
.push_back( ops
[i
] );
1263 preemptCommand( new DefineFunctionCommand(ss
.str(), ops
[i
], let_args
, let_body
) );
1264 addSygusDatatypeConstructor( dt
, ops
[i
], cnames
[i
], cargs
[i
], let_body
, let_args
, 0 );
1266 std::map
< CVC4::Expr
, CVC4::Expr
>::iterator it
= d_sygus_let_func_to_body
.find( ops
[i
] );
1267 if( it
!=d_sygus_let_func_to_body
.end() ){
1268 let_body
= it
->second
;
1269 let_args
.insert( let_args
.end(), d_sygus_let_func_to_vars
[ops
[i
]].begin(), d_sygus_let_func_to_vars
[ops
[i
]].end() );
1270 let_num_input_args
= d_sygus_let_func_to_num_input_vars
[ops
[i
]];
1272 addSygusDatatypeConstructor( dt
, ops
[i
], cnames
[i
], cargs
[i
], let_body
, let_args
, let_num_input_args
);
1275 Debug("parser-sygus") << " add constructors for unresolved symbols..." << std::endl
;
1276 if( !unresolved_gterm_sym
.empty() ){
1277 std::vector
< Type
> types
;
1278 Debug("parser-sygus") << "...resolve " << unresolved_gterm_sym
.size() << " symbols..." << std::endl
;
1279 for( unsigned i
=0; i
<unresolved_gterm_sym
.size(); i
++ ){
1280 Debug("parser-sygus") << " resolve : " << unresolved_gterm_sym
[i
] << std::endl
;
1281 if( isUnresolvedType(unresolved_gterm_sym
[i
]) ){
1282 Debug("parser-sygus") << " it is an unresolved type." << std::endl
;
1283 Type t
= getSort(unresolved_gterm_sym
[i
]);
1284 if( std::find( types
.begin(), types
.end(), t
)==types
.end() ){
1285 types
.push_back( t
);
1287 Type bt
= dt
.getSygusType();
1288 Debug("parser-sygus") << ": make identity function for " << bt
<< ", argument type " << t
<< std::endl
;
1289 std::stringstream ss
;
1291 Expr let_body
= mkBoundVar(ss
.str(), bt
);
1292 std::vector
< Expr
> let_args
;
1293 let_args
.push_back( let_body
);
1294 //make the identity function
1295 Type ft
= getExprManager()->mkFunctionType(bt
, bt
);
1296 std::stringstream ssid
;
1297 ssid
<< unresolved_gterm_sym
[i
] << "_id";
1298 Expr id_op
= mkFunction(ss
.str(), ft
, ExprManager::VAR_FLAG_DEFINED
);
1299 d_sygus_defined_funs
.push_back( id_op
);
1300 preemptCommand( new DefineFunctionCommand(ssid
.str(), id_op
, let_args
, let_body
) );
1301 //make the sygus argument list
1302 std::vector
< Type
> id_carg
;
1303 id_carg
.push_back( t
);
1304 addSygusDatatypeConstructor( dt
, id_op
, unresolved_gterm_sym
[i
], id_carg
, let_body
, let_args
, 0 );
1306 ops
.push_back( id_op
);
1309 Debug("parser-sygus") << " ignore. (likely a free let variable)" << std::endl
;
1316 void Smt2::addSygusDatatypeConstructor( CVC4::Datatype
& dt
, CVC4::Expr op
, std::string
& cname
, std::vector
< CVC4::Type
>& cargs
,
1317 CVC4::Expr
& let_body
, std::vector
< CVC4::Expr
>& let_args
, unsigned let_num_input_args
) {
1318 Debug("parser-sygus") << "--> Add constructor " << cname
<< " to " << dt
.getName() << std::endl
;
1319 if( !let_body
.isNull() ){
1320 Debug("parser-sygus") << " let body = " << let_body
<< ", args = " << let_args
.size() << "," << let_num_input_args
<< std::endl
;
1321 //TODO : remove arguments not occurring in body
1322 //if this is a self identity function, ignore
1323 if( let_args
.size()==0 && let_args
[0]==let_body
){
1324 Debug("parser-sygus") << " identity function " << cargs
[0] << " to " << dt
.getName() << std::endl
;
1328 std::string name
= dt
.getName() + "_" + cname
;
1329 std::string
testerId("is-");
1330 testerId
.append(name
);
1331 checkDeclaration(name
, CHECK_UNDECLARED
, SYM_VARIABLE
);
1332 checkDeclaration(testerId
, CHECK_UNDECLARED
, SYM_VARIABLE
);
1333 CVC4::DatatypeConstructor
c(name
, testerId
);
1334 c
.setSygus( op
, let_body
, let_args
, let_num_input_args
);
1335 for( unsigned j
=0; j
<cargs
.size(); j
++ ){
1336 Debug("parser-sygus-debug") << " arg " << j
<< " : " << cargs
[j
] << std::endl
;
1337 std::stringstream sname
;
1338 sname
<< name
<< "_" << j
;
1339 c
.addArg(sname
.str(), cargs
[j
]);
1341 dt
.addConstructor(c
);
1345 // i is index in datatypes/ops
1346 // j is index is datatype
1347 Expr
Smt2::getSygusAssertion( std::vector
<DatatypeType
>& datatypeTypes
, std::vector
< std::vector
<Expr
> >& ops
,
1348 std::map
<DatatypeType
, Expr
>& evals
, std::vector
<Expr
>& terms
,
1349 Expr eval
, const Datatype
& dt
, size_t i
, size_t j
) {
1350 const DatatypeConstructor
& ctor
= dt
[j
];
1351 Debug("parser-sygus") << "Sygus : process constructor " << j
<< " : " << dt
[j
] << std::endl
;
1352 std::vector
<Expr
> bvs
, extraArgs
;
1353 for(size_t k
= 0; k
< ctor
.getNumArgs(); ++k
) {
1354 std::string vname
= "v_" + ctor
[k
].getName();
1355 Expr bv
= getExprManager()->mkBoundVar(vname
, SelectorType(ctor
[k
].getType()).getRangeType());
1357 extraArgs
.push_back(bv
);
1359 if( !terms
[0].isNull() ){
1360 bvs
.insert(bvs
.end(), terms
[0].begin(), terms
[0].end());
1364 bvl
= getExprManager()->mkExpr(kind::BOUND_VAR_LIST
, bvs
);
1366 Debug("parser-sygus") << "...made bv list " << bvl
<< std::endl
;
1367 std::vector
<Expr
> patv
;
1368 patv
.push_back(eval
);
1369 std::vector
<Expr
> applyv
;
1370 applyv
.push_back(ctor
.getConstructor());
1371 applyv
.insert(applyv
.end(), extraArgs
.begin(), extraArgs
.end());
1372 for(size_t k
= 0; k
< applyv
.size(); ++k
) {
1374 Expr cpatv
= getExprManager()->mkExpr(kind::APPLY_CONSTRUCTOR
, applyv
);
1375 Debug("parser-sygus") << "...made eval ctor apply " << cpatv
<< std::endl
;
1376 patv
.push_back(cpatv
);
1377 if( !terms
[0].isNull() ){
1378 patv
.insert(patv
.end(), terms
[0].begin(), terms
[0].end());
1380 Expr evalApply
= getExprManager()->mkExpr(kind::APPLY_UF
, patv
);
1381 Debug("parser-sygus") << "...made eval apply " << evalApply
<< std::endl
;
1382 std::vector
<Expr
> builtApply
;
1383 for(size_t k
= 0; k
< extraArgs
.size(); ++k
) {
1384 std::vector
<Expr
> patvb
;
1385 patvb
.push_back(evals
[DatatypeType(extraArgs
[k
].getType())]);
1386 patvb
.push_back(extraArgs
[k
]);
1387 if( !terms
[0].isNull() ){
1388 patvb
.insert(patvb
.end(), terms
[0].begin(), terms
[0].end());
1390 Debug("parser-sygus-debug") << "...add to built apply " << evals
[DatatypeType(extraArgs
[k
].getType())] << " " << extraArgs
[k
] << " " << extraArgs
[k
].getType() << std::endl
;
1391 builtApply
.push_back(getExprManager()->mkExpr(kind::APPLY_UF
, patvb
));
1392 Debug("parser-sygus-debug") << "...added " << builtApply
.back() << std::endl
;
1394 for(size_t k
= 0; k
< builtApply
.size(); ++k
) {
1397 Debug("parser-sygus") << "...operator is : " << ops
[i
][j
] << ", type = " << ops
[i
][j
].getType() << ", kind = " << ops
[i
][j
].getKind() << ", is defined = " << isDefinedFunction( ops
[i
][j
] ) << std::endl
;
1398 if( ops
[i
][j
].getKind() != kind::BUILTIN
){
1399 Kind ok
= kind::UNDEFINED_KIND
;
1400 if( isDefinedFunction( ops
[i
][j
] ) || std::find( d_sygus_defined_funs
.begin(), d_sygus_defined_funs
.end(), ops
[i
][j
] )!=d_sygus_defined_funs
.end() ){
1403 Type t
= ops
[i
][j
].getType();
1404 if( t
.isConstructor() ){
1405 ok
= kind::APPLY_CONSTRUCTOR
;
1406 }else if( t
.isSelector() ){
1407 ok
= kind::APPLY_SELECTOR
;
1408 }else if( t
.isTester() ){
1409 ok
= kind::APPLY_TESTER
;
1411 ok
= getExprManager()->operatorToKind( ops
[i
][j
] );
1414 Debug("parser-sygus") << "...processed operator kind : " << ok
<< std::endl
;
1415 if( ok
!=kind::UNDEFINED_KIND
){
1416 builtTerm
= getExprManager()->mkExpr(ok
, ops
[i
][j
], builtApply
);
1418 builtTerm
= ops
[i
][j
];
1421 if( !builtApply
.empty() ){
1422 builtTerm
= getExprManager()->mkExpr(ops
[i
][j
], builtApply
);
1424 builtTerm
= ops
[i
][j
];
1427 Debug("parser-sygus") << "...made built term " << builtTerm
<< std::endl
;
1428 Expr assertion
= getExprManager()->mkExpr(evalApply
.getType().isBoolean() ? kind::IFF
: kind::EQUAL
, evalApply
, builtTerm
);
1429 if( !bvl
.isNull() ){
1430 Expr pattern
= getExprManager()->mkExpr(kind::INST_PATTERN
, evalApply
);
1431 pattern
= getExprManager()->mkExpr(kind::INST_PATTERN_LIST
, pattern
);
1432 assertion
= getExprManager()->mkExpr(kind::FORALL
, bvl
, assertion
, pattern
);
1434 Debug("parser-sygus") << "...made assertion " << assertion
<< std::endl
;
1436 //linearize multiplication if possible
1437 if( builtTerm
.getKind()==kind::MULT
){
1438 for(size_t k
= 0; k
< ctor
.getNumArgs(); ++k
) {
1439 Type at
= SelectorType(ctor
[k
].getType()).getRangeType();
1440 if( at
.isDatatype() ){
1441 DatatypeType atd
= (DatatypeType
)SelectorType(ctor
[k
].getType()).getRangeType();
1442 Debug("parser-sygus") << "Argument " << k
<< " " << atd
<< std::endl
;
1443 std::vector
<DatatypeType
>::iterator itd
= std::find( datatypeTypes
.begin(), datatypeTypes
.end(), atd
);
1444 if( itd
!=datatypeTypes
.end() ){
1445 Debug("parser-sygus2") << "Exists in datatypeTypes." << std::endl
;
1446 unsigned index
= itd
-datatypeTypes
.begin();
1447 Debug("parser-sygus2") << "index = " << index
<< std::endl
;
1448 bool isConst
= true;
1449 for( unsigned cc
= 0; cc
< ops
[index
].size(); cc
++ ){
1450 Debug("parser-sygus2") << "ops[" << cc
<< "]=" << ops
[index
][cc
] << std::endl
;
1451 if( ops
[index
][cc
].getKind() != kind::CONST_RATIONAL
){
1457 Debug("parser-sygus") << "Linearize multiplication " << ctor
<< " based on argument " << k
<< std::endl
;
1458 const Datatype
& atdd
= atd
.getDatatype();
1459 std::vector
<Expr
> assertions
;
1460 std::vector
<Expr
> nbvs
;
1461 for( unsigned a
=0; a
<bvl
.getNumChildren(); a
++ ){
1463 nbvs
.push_back( bvl
[a
] );
1466 Expr nbvl
= getExprManager()->mkExpr( kind::BOUND_VAR_LIST
, nbvs
);
1467 for( unsigned cc
= 0; cc
< ops
[index
].size(); cc
++ ){
1468 //Make new assertion based on partially instantiating existing
1469 applyv
[k
+1] = getExprManager()->mkExpr(kind::APPLY_CONSTRUCTOR
, atdd
[cc
].getConstructor());
1470 Debug("parser-sygus") << "applyv " << applyv
[k
+1] << std::endl
;
1471 cpatv
= getExprManager()->mkExpr(kind::APPLY_CONSTRUCTOR
, applyv
);
1472 Debug("parser-sygus") << "cpatv " << cpatv
<< std::endl
;
1474 evalApply
= getExprManager()->mkExpr(kind::APPLY_UF
, patv
);
1475 Debug("parser-sygus") << "evalApply " << evalApply
<< std::endl
;
1476 builtApply
[k
] = ops
[index
][cc
];
1477 Debug("parser-sygus") << "builtApply " << builtApply
[k
] << std::endl
;
1478 builtTerm
= getExprManager()->mkExpr(ops
[i
][j
], builtApply
);
1479 Debug("parser-sygus") << "builtTerm " << builtTerm
<< std::endl
;
1480 Expr eassertion
= getExprManager()->mkExpr(evalApply
.getType().isBoolean() ? kind::IFF
: kind::EQUAL
, evalApply
, builtTerm
);
1481 Expr epattern
= getExprManager()->mkExpr(kind::INST_PATTERN
, evalApply
);
1482 epattern
= getExprManager()->mkExpr(kind::INST_PATTERN_LIST
, epattern
);
1483 eassertion
= getExprManager()->mkExpr(kind::FORALL
, nbvl
, eassertion
, epattern
);
1484 assertions
.push_back( eassertion
);
1486 assertion
= assertions
.size()==1 ? assertions
[0] : getExprManager()->mkExpr( kind::AND
, assertions
);
1487 Debug("parser-sygus") << "...(linearized) assertion is: " << assertion
<< std::endl
;
1496 const void Smt2::getSygusPrimedVars( std::vector
<Expr
>& vars
, bool isPrimed
) {
1497 for( unsigned i
=0; i
<d_sygusVars
.size(); i
++ ){
1498 Expr v
= d_sygusVars
[i
];
1499 std::map
< Expr
, bool >::iterator it
= d_sygusVarPrimed
.find( v
);
1500 if( it
!=d_sygusVarPrimed
.end() ){
1501 if( it
->second
==isPrimed
){
1502 vars
.push_back( v
);
1505 //should never happen
1510 }/* CVC4::parser namespace */
1511 }/* CVC4 namespace */