Benchmark
non-incremental/QF_BV/20230224-grsbits-truby/grs-96-128.smt2
Publications: Upcoming bachelor thesis, tentatively called _Generating word-level floating-point benchmarks_ by Robin Trüby
Verification of integer multiplication is known to be a hard problem when working on bits.
In this work we consider the multiplication of doubles/floating point/bfloat8/...
as implemented in hardware. The idea is to use only three extra bits (calles GRS) and
their value decide how rounding is done. We simply check that a+b = b+a.
We use a word-level representation of the number, i.e., we represent the exponent
and mantissa as bitvectors instead of bit-level.
The naming convention of the benchmarks is 'grs-<exponent-size>-<mantissa-size>.smt2'.
For reference, a float64 would be grs-11-52.smt2.
| Benchmark |
|---|
| Size | 141646 |
| Compressed Size | 9837 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2023-07-06 |
| Generated By | Robin Trüby, Mathias Fleury, and Armin Biere |
| Generated On | 2023-02-24 00:00:00 |
| Generator | custom C code |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unsat |
| Inferred Status | None |
| Size | 141638 |
| Compressed Size | 10215 |
| Max. Term Depth | 7 |
| Asserts | 885 |
| Declared Functions | 0 |
| Declared Constants | 902 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
ite | 584 |
not | 2 |
or | 16 |
and | 1110 |
xor | 4 |
= | 3158 |
distinct | 1 |
concat | 18 |
extract | 312 |
bvadd | 12 |
bvsub | 268 |
bvuge | 24 |
bvshl | 260 |
bvlshr | 6 |
| | | |