/* * Print the term map for every uinterpreted term present in ctx->intern_tbl * then print the core */ void dimacs_print_bvcontext(FILE *f, context_t *ctx) { term_table_t *terms; intern_tbl_t *intern; uint32_t i, n; term_t t; assert(ctx->core != NULL); fputs("c Autogenerated by Yices\n", f); fputs("c\n", f); terms = ctx->terms; intern = &ctx->intern; n = intern->map.top; for (i=0; i<n; i++) { t = pos_term(i); if (good_term(terms, t) && term_kind(terms, t) == UNINTERPRETED_TERM) { dimacs_print_term_map(f, ctx, t); } } fputs("c\n", f); dimacs_print_core(f, ctx->core); fflush(f); }
/* * Add t to buffer b * - t must be defined in table and be a bitvector term of same bitsize as b * - b->ptbl must be the same as table->pprods */ void bvarith_buffer_add_term(bvarith_buffer_t *b, term_table_t *table, term_t t) { pprod_t **v; bvpoly_t *p; int32_t i; assert(b->ptbl == table->pprods); assert(pos_term(t) && good_term(table, t) && is_bitvector_term(table, t) && term_bitsize(table, t) == b->bitsize); i = index_of(t); switch (table->kind[i]) { case POWER_PRODUCT: bvarith_buffer_add_pp(b, pprod_for_idx(table, i)); break; case BV_CONSTANT: bvarith_buffer_add_const(b, bvconst_for_idx(table, i)->data); break; case BV_POLY: p = bvpoly_for_idx(table, i); v = pprods_for_bvpoly(table, p); bvarith_buffer_add_bvpoly(b, p, v); term_table_reset_pbuffer(table); break; default: bvarith_buffer_add_var(b, t); break; } }
/* * We visit terms breadth-first to check for cycles. * The index of all visited terms are stored in subst->cache. * The terms to process are stored in subst->queue. */ static void bfs_visit_index(intern_tbl_t *tbl, int32_t i) { if (kind_for_idx(tbl->terms, i) == UNINTERPRETED_TERM) { // replace i by its root i = index_of(intern_tbl_get_root(tbl, pos_term(i))); } if (int_hset_add(tbl->cache, i)) { // i has not been seen before int_queue_push(tbl->queue, i); } }
/* * Multiply b by t^d * - t must be an arithmetic term * - p->ptbl and table->pprods must be equal */ void bvarith_buffer_mul_term_power(bvarith_buffer_t *b, term_table_t *table, term_t t, uint32_t d) { bvarith_buffer_t aux; bvconstant_t c; bvpoly_t *p; pprod_t **v; pprod_t *r; int32_t i; assert(b->ptbl == table->pprods); assert(pos_term(t) && good_term(table, t) && is_bitvector_term(table, t) && term_bitsize(table, t) == b->bitsize); i = index_of(t); switch (table->kind[i]) { case POWER_PRODUCT: r = pprod_exp(b->ptbl, pprod_for_idx(table, i), d); // r = t^d bvarith_buffer_mul_pp(b, r); break; case BV_CONSTANT: init_bvconstant(&c); bvconstant_copy64(&c, b->bitsize, 1); // c := 1 bvconst_mulpower(c.data, b->width, bvconst_for_idx(table, i)->data, d); // c := t^d bvarith_buffer_mul_const(b, c.data); delete_bvconstant(&c); break; case BV_POLY: p = bvpoly_for_idx(table, i); v = pprods_for_bvpoly(table, p); init_bvarith_buffer(&aux, b->ptbl, b->store); bvarith_buffer_mul_bvpoly_power(b, p, v, d, &aux); delete_bvarith_buffer(&aux); term_table_reset_pbuffer(table); break; default: r = pprod_varexp(b->ptbl, t, d); bvarith_buffer_mul_pp(b, r); break; } }
/* * Add a * t to b * - t must be defined in table and be a bitvector term of same bitsize as b * - a must be have the same bitsize as b (as many words a b->width) * - b->ptbl must be the same as table->pprods */ void bvarith_buffer_add_const_times_term(bvarith_buffer_t *b, term_table_t *table, uint32_t *a, term_t t) { bvconstant_t c; pprod_t **v; bvpoly_t *p; int32_t i; assert(b->ptbl == table->pprods); assert(pos_term(t) && good_term(table, t) && is_bitvector_term(table, t) && term_bitsize(table, t) == b->bitsize); i = index_of(t); switch (table->kind[i]) { case POWER_PRODUCT: bvarith_buffer_add_mono(b, a, pprod_for_idx(table, i)); break; case BV_CONSTANT: init_bvconstant(&c); bvconstant_copy(&c, b->bitsize, bvconst_for_idx(table, i)->data); bvconst_mul(c.data, b->width, a); bvarith_buffer_add_const(b, c.data); delete_bvconstant(&c); break; case BV_POLY: p = bvpoly_for_idx(table, i); v = pprods_for_bvpoly(table, p); bvarith_buffer_add_const_times_bvpoly(b, p, v, a); term_table_reset_pbuffer(table); break; default: bvarith_buffer_add_varmono(b, a, t); break; } }