Z3 sources

Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
2025-04-26 10:35:33 +00:00 · 2012-10-02 11:35:25 -07:00 · 2012-10-02 11:35:25 -07:00 · e9eab22e5c
commit e9eab22e5c
parent 3f9edad676
1186 changed files with 381859 additions and 0 deletions
--- a/lib/qi_queue.h
+++ b/lib/qi_queue.h
@ -0,0 +1,105 @@
+/*++
+Copyright (c) 2006 Microsoft Corporation
+
+Module Name:
+
+    qi_queue.h
+
+Abstract:
+
+    <abstract>
+
+Author:
+
+    Leonardo de Moura (leonardo) 2008-06-15.
+
+Revision History:
+
+--*/
+#ifndef _QI_QUEUE_H_
+#define _QI_QUEUE_H_
+
+#include"ast.h"
+#include"smt_quantifier_stat.h"
+#include"smt_checker.h"
+#include"smt_quantifier.h"
+#include"qi_params.h"
+#include"fingerprints.h"
+#include"cost_parser.h"
+#include"cost_evaluator.h"
+#include"cached_var_subst.h"
+#include"statistics.h"
+
+namespace smt {
+    class context;
+
+    struct qi_queue_stats {
+        unsigned m_num_instances, m_num_lazy_instances;
+        void reset() { memset(this, 0, sizeof(qi_queue_stats)); }
+        qi_queue_stats() { reset(); }
+    };
+
+    class qi_queue {
+        quantifier_manager &          m_qm;
+        context &                     m_context;
+        ast_manager &                 m_manager;
+        qi_params &                   m_params;
+        qi_queue_stats                m_stats;
+        checker                       m_checker;
+        expr_ref                      m_cost_function;
+        expr_ref                      m_new_gen_function;
+        cost_parser                   m_parser;
+        cost_evaluator                m_evaluator;
+        cached_var_subst              m_subst;
+        svector<float>                m_vals;
+        double                        m_eager_cost_threshold;
+        std::ostream *                m_trace_stream;
+        struct entry {
+            fingerprint * m_qb;
+            float         m_cost;
+            unsigned      m_generation:31;
+            unsigned      m_instantiated:1;
+            entry(fingerprint * f, float c, unsigned g):m_qb(f), m_cost(c), m_generation(g), m_instantiated(false) {}
+        };
+        svector<entry>                m_new_entries;
+        svector<entry>                m_delayed_entries;
+        expr_ref_vector               m_instances;
+        unsigned_vector               m_instantiated_trail;
+        struct scope {
+            unsigned   m_delayed_entries_lim;
+            unsigned   m_instances_lim;
+            unsigned   m_instantiated_trail_lim;
+        };
+        svector<scope>                m_scopes;
+
+        void init_parser_vars();
+        quantifier_stat * set_values(quantifier * q, app * pat, unsigned generation, unsigned min_top_generation, unsigned max_top_generation, float cost);
+        float get_cost(quantifier * q, app * pat, unsigned generation, unsigned min_top_generation, unsigned max_top_generation);
+        unsigned get_new_gen(quantifier * q, unsigned generation, float cost);
+        void instantiate(entry & ent);
+        void get_min_max_costs(float & min, float & max) const;
+        void display_instance_profile(fingerprint * f, quantifier * q, unsigned num_bindings, enode * const * bindings, unsigned proof_id, unsigned generation);
+
+    public:
+        qi_queue(quantifier_manager & qm, context & ctx, qi_params & params, std::ostream *trace);
+        ~qi_queue();
+        void setup();
+        /**
+           \brief Insert a new quantifier in the queue, f contains the quantifier and bindings.
+           f->get_data() is the quantifier.
+        */
+        void insert(fingerprint * f, app * pat, unsigned generation, unsigned min_top_generation, unsigned max_top_generation);
+        void instantiate();
+        bool has_work() const { return !m_new_entries.empty(); }
+        void init_search_eh();
+        bool final_check_eh();
+        void push_scope();
+        void pop_scope(unsigned num_scopes);
+        void reset();
+        void display_delayed_instances_stats(std::ostream & out) const;
+        void collect_statistics(::statistics & st) const;
+    };
+};
+
+#endif /* _QI_QUEUE_H_ */
+