mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-10-29 18:52:29 +00:00
Code Activity

Fix unit tests for infinite base sorts

Browse source 
Updated test to check is_infinite() instead of is_very_big() for FiniteSet(Int) since infinite element sorts now result in infinite FiniteSet sorts (not very_big). Also updated comment to clarify the behavior.

Co-authored-by: NikolajBjorner <3085284+NikolajBjorner@users.noreply.github.com>
This commit is contained in:
copilot-swe-agent[bot] 2025-10-22 12:45:37 +00:00
parent 8b3fd63434
commit 0fcb0b6492
2 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/ast/finite_set_decl_plugin.cpp
View file

@ -101,7 +101,7 @@ sort * finite_set_decl_plugin::mk_sort(decl_kind k, unsigned num_parameters, par
}
}
else {
// If element sort is infinite or very_big, the finite_set is also very_big
// If element sort is infinite or very_big, the finite_set has the same size
sz = elem_sz;
}

4
src/test/finite_set.cpp
View file

@ -255,14 +255,14 @@ static void tst_finite_set_sort_size() {
sort_size const& bv5_set_sz = finite_set_bv5->get_num_elements();
ENSURE(bv5_set_sz.is_very_big());
// Test 4: Int sort (infinite) -> FiniteSet(Int) should be very_big
// Test 4: Int sort (infinite) -> FiniteSet(Int) should be infinite
arith_util arith(m);
sort_ref int_sort(arith.mk_int(), m);
parameter int_param(int_sort.get());
sort_ref finite_set_int(m.mk_sort(fsets.get_family_id(), FINITE_SET_SORT, 1, &int_param), m);
sort_size const& int_set_sz = finite_set_int->get_num_elements();
ENSURE(int_set_sz.is_very_big());
ENSURE(int_set_sz.is_infinite());
// Test 5: BV with size 4 -> BV[4] has 2^4 = 16 elements
// FiniteSet(BV[4]) should have 2^16 = 65536 elements