Branch data     Line data    Source code

       1                 :            : /******************************************************************************
       2                 :            :  * Top contributors (to current version):
       3                 :            :  *   Aina Niemetz, Gereon Kremer, Andrew Reynolds
       4                 :            :  *
       5                 :            :  * This file is part of the cvc5 project.
       6                 :            :  *
       7                 :            :  * Copyright (c) 2009-2025 by the authors listed in the file AUTHORS
       8                 :            :  * in the top-level source directory and their institutional affiliations.
       9                 :            :  * All rights reserved.  See the file COPYING in the top-level source
      10                 :            :  * directory for licensing information.
      11                 :            :  * ****************************************************************************
      12                 :            :  *
      13                 :            :  * Test for project issue #455
      14                 :            :  *
      15                 :            :  */
      16                 :            : 
      17                 :            : #include <cvc5/cvc5.h>
      18                 :            : 
      19                 :            : #include <cassert>
      20                 :            : 
      21                 :            : #include "base/configuration.h"
      22                 :            : 
      23                 :            : using namespace cvc5;
      24                 :            : 
      25                 :          1 : int main(void)
      26                 :            : {
      27         [ -  + ]:          1 :   if (!internal::Configuration::isBuiltWithPoly())
      28                 :            :   {
      29                 :          0 :     return 0;
      30                 :            :   }
      31                 :          2 :   TermManager tm;
      32                 :          2 :   Solver slv(tm);
      33                 :          1 :   slv.setLogic("QF_UFNRA");
      34                 :          1 :   slv.setOption("produce-unsat-assumptions", "true");
      35                 :          1 :   slv.setOption("incremental", "false");
      36                 :          1 :   slv.setOption("produce-models", "true");
      37                 :          2 :   Sort s1 = tm.mkUninterpretedSort("_u0");
      38                 :          2 :   Sort s2 = tm.getRealSort();
      39                 :          2 :   Term t1 = tm.mkConst(s2, "_x4");
      40                 :          2 :   Term t2 = tm.mkConst(s1, "_x5");
      41                 :          2 :   Term t3 = tm.mkConst(s2, "_x7");
      42                 :          3 :   Term t4 = tm.mkReal("2");
      43                 :          2 :   Term t5 = tm.mkConst(s2, "_x10");
      44                 :          2 :   Term t6 = tm.mkConst(s2, "_x11");
      45                 :          3 :   Term t7 = tm.mkReal("3615783917");
      46                 :          2 :   Term t8 = tm.mkConst(s2, "_x14");
      47                 :          2 :   Term t9 = tm.mkConst(s2, "_x15");
      48                 :          5 :   Term t10 = tm.mkTerm(Kind::ADD, {t5, t9});
      49                 :          7 :   Term t11 = tm.mkTerm(Kind::ADD, {t10, t7, t8, t6});
      50                 :          5 :   Term t12 = tm.mkTerm(Kind::LEQ, {t4, t11});
      51                 :          5 :   Term t13 = tm.mkTerm(Kind::SUB, {t11, t6});
      52                 :          5 :   Term t14 = tm.mkTerm(Kind::SUB, {t6, t13});
      53                 :          5 :   Term t15 = tm.mkTerm(Kind::MULT, {t4, t4});
      54                 :          5 :   Term t16 = tm.mkTerm(Kind::GT, {t15, t11});
      55                 :          5 :   Term t17 = tm.mkTerm(Kind::SUB, {t11, t3});
      56                 :          5 :   Term t18 = tm.mkTerm(Kind::LEQ, {t17, t7});
      57                 :          5 :   Term t19 = tm.mkTerm(Kind::IMPLIES, {t18, t12});
      58                 :          5 :   Term t20 = tm.mkTerm(Kind::GEQ, {t1, t3});
      59                 :          5 :   Term t21 = tm.mkTerm(Kind::MULT, {t7, t13});
      60                 :          5 :   Term t22 = tm.mkTerm(Kind::MULT, {t21, t14});
      61                 :          5 :   Term t23 = tm.mkTerm(Kind::SUB, {t14, t3});
      62                 :          2 :   Term t24 = tm.mkVar(s2, "_f19_0");
      63                 :          2 :   Term t25 = tm.mkVar(s2, "_f19_1");
      64                 :          2 :   Term t26 = tm.mkVar(s1, "_f19_2");
      65                 :          2 :   Term t27 = tm.mkVar(s2, "_f19_3");
      66                 :          2 :   Term t28 = tm.mkVar(s1, "_f19_4");
      67                 :            :   Term t29 =
      68                 :          9 :       slv.defineFun("_f19", {t24, t25, t26, t27, t28}, t24.getSort(), t24);
      69                 :          6 :   Term t30 = tm.mkTerm(Kind::DISTINCT, {t19, t20, t16});
      70                 :          6 :   Term t31 = tm.mkTerm(Kind::ITE, {t30, t9, t22});
      71                 :          6 :   Term t32 = tm.mkTerm(Kind::DIVISION, {t11, t6, t10});
      72                 :          5 :   Term t33 = tm.mkTerm(Kind::GEQ, {t32, t3});
      73                 :          9 :   Term t34 = tm.mkTerm(Kind::APPLY_UF, {t29, t31, t3, t2, t3, t2});
      74                 :          5 :   Term t35 = tm.mkTerm(Kind::GEQ, {t34, t23});
      75                 :          3 :   Term t36 = tm.mkTerm(Kind::NOT, {t35});
      76                 :          1 :   slv.assertFormula({t36});
      77                 :          1 :   slv.assertFormula({t33});
      78                 :          1 :   slv.checkSatAssuming({t18.notTerm()});
      79                 :          1 : }