mirror of
https://github.com/Z3Prover/z3
synced 2025-10-10 17:58:06 +00:00
0a93ff515d
* Introduce X-macro-based trace tag definition - Created trace_tags.def to centralize TRACE tag definitions - Each tag includes a symbolic name and description - Set up enum class TraceTag for type-safe usage in TRACE macros * Add script to generate Markdown documentation from trace_tags.def - Python script parses trace_tags.def and outputs trace_tags.md * Refactor TRACE_NEW to prepend TraceTag and pass enum to is_trace_enabled * trace: improve trace tag handling system with hierarchical tagging - Introduce hierarchical tag-class structure: enabling a tag class activates all child tags - Unify TRACE, STRACE, SCTRACE, and CTRACE under enum TraceTag - Implement initial version of trace_tag.def using X(tag, tag_class, description) (class names and descriptions to be refined in a future update) * trace: replace all string-based TRACE tags with enum TraceTag - Migrated all TRACE, STRACE, SCTRACE, and CTRACE macros to use enum TraceTag values instead of raw string literals * trace : add cstring header * trace : Add Markdown documentation generation from trace_tags.def via mk_api_doc.py * trace : rename macro parameter 'class' to 'tag_class' and remove Unicode comment in trace_tags.h. * trace : Add TODO comment for future implementation of tag_class activation * trace : Disable code related to tag_class until implementation is ready (#7663).
61 lines
1.6 KiB
C++
61 lines
1.6 KiB
C++
/*++
|
|
Copyright (c) 2022 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
card2bv.cpp
|
|
|
|
Abstract:
|
|
|
|
convert cardinality constraints to bit-vectors
|
|
|
|
Author:
|
|
|
|
Nikolaj Bjorner (nbjorner) 2022-11-24
|
|
|
|
--*/
|
|
|
|
|
|
#include "ast/simplifiers/card2bv.h"
|
|
#include "ast/rewriter/th_rewriter.h"
|
|
#include "ast/rewriter/pb2bv_rewriter.h"
|
|
|
|
card2bv::card2bv(ast_manager& m, params_ref const& p, dependent_expr_state& fmls) :
|
|
dependent_expr_simplifier(m, fmls), m_params(p) {}
|
|
|
|
void card2bv::reduce() {
|
|
th_rewriter rw1(m, m_params);
|
|
pb2bv_rewriter rw2(m, m_params);
|
|
|
|
expr_ref new_f1(m), new_f2(m);
|
|
proof_ref new_pr(m);
|
|
for (unsigned idx : indices()) {
|
|
auto [f, p, d] = m_fmls[idx]();
|
|
rw1(f, new_f1);
|
|
rw2(false, new_f1, new_f2, new_pr);
|
|
if (new_f2 != f) {
|
|
TRACE(card2bv, tout << "Rewriting " << new_f1 << "\n" << new_f2 << "\n");
|
|
m_fmls.update(idx, dependent_expr(m, new_f2, mp(p, new_pr), d));
|
|
++m_stats.m_num_rewrites;
|
|
}
|
|
}
|
|
|
|
expr_ref_vector fmls(m);
|
|
rw2.flush_side_constraints(fmls);
|
|
for (expr* e : fmls)
|
|
m_fmls.add(dependent_expr(m, e, nullptr, nullptr));
|
|
|
|
func_decl_ref_vector const& fns = rw2.fresh_constants();
|
|
for (func_decl* f : fns)
|
|
m_fmls.model_trail().hide(f);
|
|
}
|
|
|
|
void card2bv::collect_statistics(statistics& st) const {
|
|
st.update("card2bv-rewrites", m_stats.m_num_rewrites);
|
|
}
|
|
|
|
void card2bv::collect_param_descrs(param_descrs& r) {
|
|
r.insert("keep_cardinality_constraints", CPK_BOOL, "retain cardinality constraints for solver", "true");
|
|
pb2bv_rewriter rw(m, m_params);
|
|
rw.collect_param_descrs(r);
|
|
}
|