Branch data Line data Source code
1 : : /******************************************************************************
2 : : * This file is part of the cvc5 project.
3 : : *
4 : : * Copyright (c) 2009-2026 by the authors listed in the file AUTHORS
5 : : * in the top-level source directory and their institutional affiliations.
6 : : * All rights reserved. See the file COPYING in the top-level source
7 : : * directory for licensing information.
8 : : * ****************************************************************************
9 : : *
10 : : * Test for project issue #574
11 : : *
12 : : */
13 : : #include <cvc5/cvc5.h>
14 : :
15 : : using namespace cvc5;
16 : 1 : int main(void)
17 : : {
18 : 1 : TermManager tm;
19 : 1 : Solver solver(tm);
20 : 1 : solver.setOption("incremental", "false");
21 : 1 : solver.setOption("produce-models", "true");
22 : 1 : Sort s0 = tm.mkUninterpretedSort("_u0");
23 : 1 : Sort s1 = tm.getBooleanSort();
24 : 1 : Sort s2 = tm.getBooleanSort();
25 : 1 : Sort s3 = tm.mkUninterpretedSort("_u1");
26 : 1 : Term t4 = tm.mkConst(s0, "_x2");
27 : 1 : Term t5 = tm.mkConst(s3, "_x3");
28 : 1 : Term t6 = tm.mkConst(s0, "_x4");
29 : 1 : Term t7 = tm.mkConst(s0, "_x5");
30 : 1 : Term t8 = tm.mkConst(s0, "_x6");
31 : 1 : Term t9 = tm.mkVar(s3, "_x7");
32 : 1 : Term t10 = tm.mkConst(s0, "_x8");
33 : 1 : Term t11 = tm.mkConst(s3, "_x9");
34 : 1 : Sort s12 = tm.mkArraySort(s0, s0);
35 : 1 : Term t13 = tm.mkConst(s3, "_x10");
36 : 1 : Term t14 = tm.mkConst(s0, "_x11");
37 : 1 : Term t15 = tm.mkVar(s0, "_x12");
38 : 1 : Term t16 = tm.mkVar(s12, "_x13");
39 : 1 : Term t17 = tm.mkConst(s0, "_x14");
40 : 1 : Term t18 = tm.mkVar(s0, "_x19");
41 : 1 : Term t19 = tm.mkVar(s0, "_x20");
42 : 1 : Term t20 = tm.mkConst(s3, "_x21");
43 : 1 : Term t21 = tm.mkConst(s3, "_x22");
44 : 1 : Term t22 = tm.mkConst(s12, "_x27");
45 : 1 : Term t23 = tm.mkConst(s12, "_x28");
46 : 1 : Term t24 = tm.mkConst(s1, "_x29");
47 : 1 : Term t25 = tm.mkConst(s12, "_x30");
48 : 1 : Term t26 = tm.mkTrue();
49 : 1 : Op o27 = tm.mkOp(Kind::AND);
50 : 4 : Term t28 = tm.mkTerm(o27, {t24, t26});
51 : 4 : Term t29 = tm.mkTerm(Kind::XOR, {t24, t24});
52 : 1 : Term t30 = tm.mkPi();
53 : 1 : Sort s31 = t30.getSort();
54 : 1 : Term t32 = tm.mkPi();
55 : 1 : Op o33 = tm.mkOp(Kind::STORE);
56 : 5 : Term t34 = tm.mkTerm(o33, {t16, t18, t4});
57 : 1 : Op o35 = tm.mkOp(Kind::ARCCOSINE);
58 : 3 : Term t36 = tm.mkTerm(o35, {t30});
59 : 4 : Term t37 = tm.mkTerm(Kind::SELECT, {t22, t4});
60 : 1 : Op o38 = tm.mkOp(Kind::ITE);
61 : 1 : Term t39 = t24.iteTerm(t24, t24);
62 : 1 : Op o40 = tm.mkOp(Kind::COSECANT);
63 : 3 : Term t41 = tm.mkTerm(o40, {t30});
64 : 1 : Op o42 = tm.mkOp(Kind::ARCSECANT);
65 : 3 : Term t43 = tm.mkTerm(o42, {t30});
66 : 1 : Op o44 = tm.mkOp(Kind::GEQ);
67 : 4 : Term t45 = tm.mkTerm(o44, {t43, t30});
68 : 3 : Term t46 = tm.mkTerm(Kind::NEG, {t30});
69 : 1 : Term t47 = t45.eqTerm(t45);
70 : 1 : solver.assertFormula(t47);
71 : 1 : solver.checkSat();
72 : 1 : solver.blockModel(cvc5::modes::BlockModelsMode::LITERALS);
73 : :
74 : 1 : return 0;
75 : 1 : }
|