LCOV - code coverage report
Current view: top level - buildbot/coverage/build/test/api/cpp/issues - proj-issue538.cpp (source / functions) Hit Total Coverage
Test: coverage.info Lines: 18 18 100.0 %
Date: 2026-04-16 10:42:20 Functions: 1 1 100.0 %
Branches: 2 4 50.0 %

           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 #538
      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 :   Sort s0 = tm.mkBitVectorSort(128);
      22                 :          1 :   Term t1 = tm.mkConst(s0, "_x2");
      23                 :          1 :   Op o2 = tm.mkOp(Kind::BITVECTOR_UBV_TO_INT);
      24                 :          3 :   Term t3 = tm.mkTerm(o2, {t1});
      25                 :          1 :   Sort s4 = t3.getSort();
      26                 :          1 :   Op o5 = tm.mkOp(Kind::INT_TO_BITVECTOR, {27});
      27                 :          3 :   Term t6 = tm.mkTerm(o5, {t3});
      28                 :          1 :   Sort s7 = t6.getSort();
      29                 :          1 :   Op o8 = tm.mkOp(Kind::BITVECTOR_SGE);
      30                 :          4 :   Term t9 = tm.mkTerm(o8, {t6, t6});
      31                 :          1 :   Sort s10 = t9.getSort();
      32 [ +  + ][ -  - ]:          3 :   solver.checkSatAssuming({t9, t9});
      33                 :          1 :   return 0;
      34                 :          1 : }

Generated by: LCOV version 1.14