From 444a2f493e7b5d7b7d0d39bb9a5991654056bf8f Mon Sep 17 00:00:00 2001
From: Andrew Reynolds <andrew.j.reynolds@gmail.com>
Date: Mon, 7 Mar 2022 20:53:18 -0600
Subject: [PATCH] Add unit for fixed project issue (#8253)

Fixes cvc5/cvc5-projects#377.

Was not able to reproduce this on master.
---
 test/api/cpp/CMakeLists.txt    |  1 +
 test/api/cpp/proj-issue377.cpp | 46 ++++++++++++++++++++++++++++++++++
 2 files changed, 47 insertions(+)
 create mode 100644 test/api/cpp/proj-issue377.cpp

diff --git a/test/api/cpp/CMakeLists.txt b/test/api/cpp/CMakeLists.txt
index c82b8974c..e110ec075 100644
--- a/test/api/cpp/CMakeLists.txt
+++ b/test/api/cpp/CMakeLists.txt
@@ -56,6 +56,7 @@ cvc5_add_api_test(proj-issue306)
 cvc5_add_api_test(proj-issue334)
 cvc5_add_api_test(proj-issue344)
 cvc5_add_api_test(proj-issue345)
+cvc5_add_api_test(proj-issue377)
 cvc5_add_api_test(proj-issue395)
 cvc5_add_api_test(proj-issue399)
 cvc5_add_api_test(proj-issue445)
diff --git a/test/api/cpp/proj-issue377.cpp b/test/api/cpp/proj-issue377.cpp
new file mode 100644
index 000000000..c92f7b94f
--- /dev/null
+++ b/test/api/cpp/proj-issue377.cpp
@@ -0,0 +1,46 @@
+/******************************************************************************
+ * Top contributors (to current version):
+ *   Yoni Zohar
+ *
+ * This file is part of the cvc5 project.
+ *
+ * Copyright (c) 2009-2021 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 #377
+ *
+ */
+
+
+#include "api/cpp/cvc5.h"
+#include <cassert>
+
+using namespace cvc5::api;
+
+int main(void)
+{
+  Solver slv;
+  slv.setOption("incremental", "true");
+  slv.setOption("check-proofs", "true");
+  Sort s1 = slv.getBooleanSort();
+  Sort s2 = slv.getIntegerSort();
+  Sort s3 = slv.mkBitVectorSort(81);
+  Term t5 = slv.mkConst(s2, "_x4");
+  Term t27 = slv.mkBoolean(false);
+  Term t35 = slv.mkBitVector(81, "011111011100100100101101001101010001001010011010000111011010001110001111010101100", 2);
+  Term t37 = slv.mkTerm(Kind::BITVECTOR_TO_NAT, {t35});
+  Term t40 = slv.mkTerm(Kind::PI);
+  Term t43 = slv.mkTerm(Kind::ADD, {t40, t40});
+  Term t45 = slv.mkTerm(slv.mkOp(Kind::IAND, 31), {t37, t5});
+  Term t66 = slv.mkTerm(Kind::EQUAL, {t43, t40});
+  Term t101 = slv.mkTerm(Kind::LT, {t37, t45});
+  slv.assertFormula({t66});
+  Term t102 = slv.mkTerm(Kind::AND, {t101, t27, t101, t101});
+  Term t103 = slv.mkTerm(Kind::NOT, {t102});
+  slv.checkSatAssuming({t103});
+  Term t104 = slv.mkTerm(Kind::NOT, {t101});
+  slv.checkSatAssuming({t104});
+}
-- 
2.30.2