mirror of
https://github.com/AdaCore/cvc5.git
synced 2026-02-12 12:32:16 -08:00
ed10fc9175
The latest SMT-LIB release has standardized arithmetic/bitvector conversions (https://smt-lib.org/theories-FixedSizeBitVectors.shtml). This adds support for them. In particular, the kind Kind::INT_TO_BITVECTOR now has recommended syntax int_to_bv, while int2bv is supported (deprecated) in non-strict mode for now for backwards compatibility. The kind Kind::BITVECTOR_TO_NAT and the smt2 syntax bv2nat for now is maintained but should be deprecated. In particular, Kind::BITVECTOR_TO_NAT is silently converted to Kind::BITVECTOR_UBV_TO_INT in the API. We add Kind::BITVECTOR_UBV_TO_INT and Kind::BITVECTOR_SBV_TO_INT in the API. The internal kind BITVECTOR_TO_NAT is renamed BITVECTOR_UBV_TO_INT, and add internal kind BITVECTOR_SBV_TO_INT. Updates the proof infrastructure to use the new naming scheme.
38 lines
1.1 KiB
C++
38 lines
1.1 KiB
C++
/******************************************************************************
|
|
* Top contributors (to current version):
|
|
* Andrew Reynolds, 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 project issue #538
|
|
*
|
|
*/
|
|
#include <cvc5/cvc5.h>
|
|
|
|
using namespace cvc5;
|
|
int main(void)
|
|
{
|
|
TermManager tm;
|
|
Solver solver(tm);
|
|
solver.setOption("incremental", "false");
|
|
Sort s0 = tm.mkBitVectorSort(128);
|
|
Term t1 = tm.mkConst(s0, "_x2");
|
|
Op o2 = tm.mkOp(Kind::BITVECTOR_UBV_TO_INT);
|
|
Term t3 = tm.mkTerm(o2, {t1});
|
|
Sort s4 = t3.getSort();
|
|
Op o5 = tm.mkOp(Kind::INT_TO_BITVECTOR, {27});
|
|
Term t6 = tm.mkTerm(o5, {t3});
|
|
Sort s7 = t6.getSort();
|
|
Op o8 = tm.mkOp(Kind::BITVECTOR_SGE);
|
|
Term t9 = tm.mkTerm(o8, {t6, t6});
|
|
Sort s10 = t9.getSort();
|
|
solver.checkSatAssuming({t9, t9});
|
|
return 0;
|
|
}
|