int
main (void)
{
Btor *btor;
BtorNode *array, *read, *max, *temp, *ugt, *formula, *index;
BtorNode *indices[ARRAY1_EXAMPLE_ARRAY_SIZE];
int i, result;
btor = boolector_new ();
/* We create all possible constants that are used as read indices */
for (i = 0; i < ARRAY1_EXAMPLE_ARRAY_SIZE; i++)
indices[i] = boolector_int (btor, i, ARRAY1_EXAMPLE_INDEX_BW);
array =
boolector_array (btor, ARRAY1_EXAMPLE_VALUE_BW, ARRAY1_EXAMPLE_INDEX_BW,
NULL);
/* Current maximum is first element of array */
max = boolector_read (btor, array, indices[0]);
/* Symbolic loop unrolling */
for (i = 1; i < ARRAY1_EXAMPLE_ARRAY_SIZE; i++)
{
read = boolector_read (btor, array, indices[i]);
ugt = boolector_ugt (btor, read, max);
/* found a new maximum? */
temp = boolector_cond (btor, ugt, read, max);
boolector_release (btor, max);
max = temp;
boolector_release (btor, read);
boolector_release (btor, ugt);
}
/* Now we show that 'max' is indeed a maximum */
/* We read at an arbitrary position */
index = boolector_var (btor, ARRAY1_EXAMPLE_INDEX_BW, NULL);
read = boolector_read (btor, array, index);
/* We assume that it is possible that the read value is greater than 'max' */
formula = boolector_ugt (btor, read, max);
/* We assert the formula and call Boolector */
boolector_assert (btor, formula);
result = boolector_sat (btor);
if (result == BOOLECTOR_UNSAT)
printf ("Formula is unsatisfiable\n");
else
abort ();
/* clean up */
for (i = 0; i < ARRAY1_EXAMPLE_ARRAY_SIZE; i++)
boolector_release (btor, indices[i]);
boolector_release (btor, formula);
boolector_release (btor, read);
boolector_release (btor, index);
boolector_release (btor, max);
boolector_release (btor, array);
assert (boolector_get_refs (btor) == 0);
boolector_delete (btor);
return 0;
}
int
main (void)
{
Btor *btor;
BoolectorNode *array1, *array2, *zero, *one, *val1, *val2;
BoolectorNode *write1, *write2, *formula;
char **indices, **values;
int result, size, i;
btor = boolector_new ();
boolector_set_opt (btor, "model_gen", 1);
zero = boolector_zero (btor, ARRAY2_EXAMPLE_INDEX_BW);
one = boolector_one (btor, ARRAY2_EXAMPLE_INDEX_BW);
val1 = boolector_int (btor, 3, ARRAY2_EXAMPLE_VALUE_BW);
val2 = boolector_int (btor, 5, ARRAY2_EXAMPLE_VALUE_BW);
array1 =
boolector_array (btor, ARRAY2_EXAMPLE_VALUE_BW, ARRAY2_EXAMPLE_INDEX_BW,
NULL);
array2 =
boolector_array (btor, ARRAY2_EXAMPLE_VALUE_BW, ARRAY2_EXAMPLE_INDEX_BW,
NULL);
write1 = boolector_write (btor, array1, zero, val1);
write2 = boolector_write (btor, array2, one, val2);
/* Note: we compare two arrays for equality ---> needs extensional theory */
formula = boolector_eq (btor, write1, write2);
boolector_assert (btor, formula);
result = boolector_sat (btor);
if (result == BOOLECTOR_SAT)
printf ("Formula is satisfiable\n");
else
abort ();
/* Formula is satisfiable, we can obtain array models: */
boolector_array_assignment (btor, array1, &indices, &values, &size);
if (size > 0)
{
printf ("Array1:\n");
for (i = 0; i < size; i++)
printf ("Array1[%s] = %s\n", indices[i], values[i]);
boolector_free_array_assignment (btor, indices, values, size);
}
boolector_array_assignment (btor, array2, &indices, &values, &size);
if (size > 0)
{
printf ("\nArray2:\n");
for (i = 0; i < size; i++)
printf ("Array2[%s] = %s\n", indices[i], values[i]);
boolector_free_array_assignment (btor, indices, values, size);
}
boolector_array_assignment (btor, write1, &indices, &values, &size);
if (size > 0)
{
printf ("\nWrite1:\n");
for (i = 0; i < size; i++)
printf ("Write1[%s] = %s\n", indices[i], values[i]);
boolector_free_array_assignment (btor, indices, values, size);
}
boolector_array_assignment (btor, write2, &indices, &values, &size);
if (size > 0)
{
printf ("\nWrite2:\n");
for (i = 0; i < size; i++)
printf ("Write2[%s] = %s\n", indices[i], values[i]);
boolector_free_array_assignment (btor, indices, values, size);
}
/* clean up */
boolector_release (btor, formula);
boolector_release (btor, write1);
boolector_release (btor, write2);
boolector_release (btor, array1);
boolector_release (btor, array2);
boolector_release (btor, val1);
boolector_release (btor, val2);
boolector_release (btor, zero);
boolector_release (btor, one);
assert (boolector_get_refs (btor) == 0);
boolector_delete (btor);
return 0;
}
