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
|
/******************************************************************************
* 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 #652
*
*/
#include <cvc5/cvc5.h>
using namespace cvc5;
int main(void)
{
Solver solver;
solver.setOption("incremental", "false");
solver.setOption("sep-pre-skolem-emp", "true");
Sort s0 = solver.getIntegerSort();
Term t1 = solver.mkConst(s0, "_x1");
Term t2 = solver.mkConst(s0, "_x8");
Term t3 = solver.mkConst(s0, "_x10");
Term t4 = solver.mkTerm(Kind::SEQ_UNIT, {t1});
Sort s5 = t4.getSort();
Term t6 = solver.mkVar(s5, "_f13_0");
Term t7 = solver.mkTerm(Kind::SEQ_REPLACE_ALL, {t4, t4, t6});
Term t8 = solver.mkTerm(Kind::SEQ_AT, {t4, t1});
Term t9 = solver.mkTerm(Kind::SEQ_UPDATE, {t8, t1, t8});
Term t10 = solver.mkTerm(Kind::SEQ_EXTRACT, {t4, t1, t2});
Term t11 = solver.mkTerm(Kind::SEQ_REPLACE, {t10, t9, t7});
Sort s12 = solver.mkFunctionSort({s5}, s5);
Term t13 = solver.defineFun("_f13", {t6}, s5, t11, true);
Op o14 = solver.mkOp(Kind::APPLY_UF);
Term t15 = solver.mkTerm(o14, {t13, t4});
Term t16 = solver.mkTerm(Kind::APPLY_UF, {t13, t15});
Op o17 = solver.mkOp(Kind::SEQ_EXTRACT);
Term t18 = solver.mkTerm(o17, {t16, t3, t1});
Op o19 = solver.mkOp(Kind::SEQ_PREFIX);
Term t20 = solver.mkTerm(o19, {t18, t4});
Sort s21 = t20.getSort();
Term t22 = t20.impTerm(t20);
solver.assertFormula(t22);
solver.checkSat();
return 0;
}
|
