A list of (other) theories that are implicitly declared as a side-effect of declaring this theory. We assume that theories can implicitly define some of their dependencies, but not vice versa.

Functions and predicates of the theory Assuming Address as address sort name, Heap as heap sort name, and Obj as the selected object sort. Some function / predicate names incorporate the defined / selected names. *************************************************************************** Public functions and predicates *************************************************************************** emptyHeap : () --> Heap alloc : Heap x Obj --> Heap x Address (allocResHeap) read : Heap x Address --> Obj write : Heap x Address x Obj --> Heap valid (isAlloc) : Heap x Address --> Bool deAlloc : Heap --> Heap nthAddress : Nat --> Address

batchAlloc : Heap x Obj x Nat --> Heap x AddressRange (batchAllocResHeap) batchWrite : Heap x AddressRange x Obj --> Heap nth : AddressRange x Nat --> Address within : AddressRange x Address --> Bool

0 1 writeADT : Obj x Obj --> Heap * Updates the ADT's field (described by a read to 0) using value (1) *************************************************************************** Private functions and predicates *************************************************************************** counter : Heap --> Nat

* Below two functions are shorthand functions to get rid of allocRes ADT. * They return a single value instead of the pair <Heap x Addr>. * This also removes some quantifiers related to the ADT in the generated * interpolants. alloc<heapSortName> : Heap x Obj --> Heap alloc<addressSortName> : Heap x Obj --> Address

* Below two functions are shorthand functions to get rid of batchAllocRes ADT. * They return a single value instead of the pair <Heap x AddressRange>. * This also removes some quantifiers related to the ADT in the generated * interpolants. batchAlloc<heapSortName> : Heap x Obj x Nat --> Heap batchAlloc<addressSortName>Range : Heap x Obj x Nat --> AddressRange * ***************************************************************************

Axioms defining the theory; such axioms are simply added as formulae to the problem to be proven, and thus handled using the standard reasoning techniques (including e-matching).

Optionally, other theories that this theory depends on.

Optionally, a function evaluating theory functions applied to concrete arguments, represented as constructor terms.

Optionally, a function evaluating theory predicates applied to concrete arguments, represented as constructor terms.

A simplification function that applies the methods evalFun and evalPred to some given expression (but not recursively). This is used in the Theory.postSimplifiers methods.

Add the symbols defined by this theory to the order

Translate a function belonging to this theory to an SMT-LIB identifier.

Mapping of interpreted functions to interpreted predicates, used translating input ASTs to internal ASTs (the latter only containing predicates).

Information which of the predicates satisfy the functionality axiom; at some internal points, such predicates can be handled more efficiently

Interpreted functions of the theory

If this theory defines any Theory.Decoder, which can translate model data into some theory-specific representation, this function can be overridden to pre-compute required data from a model.

Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be applied to the formula after calling Internal2Inputabsy.

Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover. This method will be applied very early in the translation process.

Check whether we can tell that the given combination of theories is sound for checking satisfiability of a problem, i.e., if proof construction ends up in a dead end, can it be concluded that a problem is satisfiable.

Optionally, a set of predicates used by the theory to tell the PresburgerModelFinder about terms that will be handled exclusively by this theory. If a proof goal in model generation mode contains an atom p(x), for p in this set, then the PresburgerModelFinder will ignore x when assigning concrete values to symbols.

Optionally, a plug-in implementing reasoning in this theory

Optionally, simplifiers that are applied to formulas output by the prover, for instance to interpolants or the result of quantifier. Such simplifiers are invoked by ap.parser.Simplifier. By default, this list will only include the evaluatingSimplifier.

Optionally, a post-processor that is applied to formulas output by the prover, for instance to interpolants or the result of quantifier elimination. This method will be applied to the raw formulas, before calling Internal2Inputabsy.

Translate a predicate belonging to this theory to an SMT-LIB identifier.

Information how interpreted predicates should be handled for e-matching.

Interpreted predicates of the theory

Optionally, a pre-processor that is applied to formulas over this theory, prior to sending the formula to a prover.

Print an SMT-LIB declaration of this theory; do not output anything if the theory does not need to be declared.

Optionally, a plugin for the reducer applied to formulas both before and during proving.

When instantiating existentially quantifier formulas, EX phi, at most one instantiation is necessary provided that all predicates in phi are contained in this set.

Translate a sort belonging to this theory to an SMT type.

Additional axioms that are included if the option +genTotalityAxioms is given to Princess.

Dependencies closed under transitivity, i.e., also including the dependencies of dependencies.

A list of functions that should be considered in automatic trigger generation

Helper function to write to ADT fields.