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
|
/******************************************************************************
* Top contributors (to current version):
* Mathias Preiner, Aina Niemetz
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2025 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 issue #6111
*
*/
#include <cvc5/cvc5.h>
#include <iostream>
#include <vector>
using namespace cvc5;
using namespace std;
int main()
{
TermManager tm;
Solver solver(tm);
solver.setLogic("QF_BV");
Sort bvsort12979 = tm.mkBitVectorSort(12979);
Term input2_1 = tm.mkConst(bvsort12979, "intpu2_1");
Term zero = tm.mkBitVector(bvsort12979.getBitVectorSize(), "0", 10);
vector<Term> args1;
args1.push_back(zero);
args1.push_back(input2_1);
Term bvult_res = tm.mkTerm(Kind::BITVECTOR_ULT, {args1});
solver.assertFormula(bvult_res);
Sort bvsort4 = tm.mkBitVectorSort(4);
Term concat_result_42 = tm.mkConst(bvsort4, "concat_result_42");
Sort bvsort8 = tm.mkBitVectorSort(8);
Term concat_result_43 = tm.mkConst(bvsort8, "concat_result_43");
vector<Term> args2;
args2.push_back(concat_result_42);
args2.push_back(
tm.mkTerm(tm.mkOp(Kind::BITVECTOR_EXTRACT, {7, 4}), {concat_result_43}));
solver.assertFormula(tm.mkTerm(Kind::EQUAL, {args2}));
vector<Term> args3;
args3.push_back(concat_result_42);
args3.push_back(
tm.mkTerm(tm.mkOp(Kind::BITVECTOR_EXTRACT, {3, 0}), {concat_result_43}));
solver.assertFormula(tm.mkTerm(Kind::EQUAL, {args3}));
cout << solver.checkSat() << endl;
return 0;
}
|
