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
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2023 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.
* ****************************************************************************
*
* Test for project issue #666
*
*/
#include <cvc5/cvc5.h>
using namespace cvc5;
int main(void)
{
Solver solver;
solver.setOption("incremental", "false");
solver.setOption("produce-models", "true");
solver.setOption("incremental", "true");
Sort s0 = solver.getBooleanSort();
Sort s1 = solver.mkSequenceSort(s0);
Sort s2 = solver.getRealSort();
Term t3 = solver.mkConst(s2, "_x35");
Term t4 = solver.mkVar(s1, "_x37");
Term t5 = solver.mkConst(s1, "_x38");
Term t6 = solver.mkReal(5899572550, 9187);
Term t7 = solver.mkTerm(Kind::DISTINCT, {t3, t6});
Term t8 = solver.mkTerm(Kind::SEQ_SUFFIX, {t4, t5});
Term t9 = solver.mkTerm(Kind::SEQ_PREFIX, {t4, t5});
Op o10 = solver.mkOp(Kind::SEQ_REV);
Term t11 = solver.mkTerm(o10, {t5});
Term t12 = solver.mkTerm(Kind::EQUAL, {t9, t8});
Term t13 = solver.mkTerm(Kind::SET_SINGLETON, {t5});
Sort s14 = t13.getSort();
Term t15 = t12.xorTerm(t7);
Term t16 = solver.mkTerm(Kind::VARIABLE_LIST, {t4});
Sort s17 = t16.getSort();
Term t18 = solver.mkTerm(Kind::EXISTS, {t16, t15});
solver.checkSatAssuming({t18, t18, t7, t7});
solver.blockModelValues({t11, t13});
solver.checkSatAssuming({t18, t7, t18, t18, t7});
return 0;
}
|
