Benchmark
incremental/UFLRA/asasp/hierarchy_implicit/bench_1_1_4_random5.smt2
Generated with ASASP.
ASASP (http://st.fbk.eu/technologies/asasp) implements a symbolic reachability procedure
for the analysis of administrative access control policies. A more detailed description
of the benchmarks can be found in the following paper: Efficient Symbolic Automated Analysis
of Administrative Attribute-based RBAC-Policies, by F. Alberti, A. Armando, and S. Ranise, in
ASIACCS 2011. For info contact Francesco Alberti <francesco.alberti@usi.ch>
| Status | sat |
| Inferred Status | None |
| Size | 4597 |
| Compressed Size | 1084 |
| Max. Term Depth | 5 |
| Asserts | 71 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 3 |
or | 4 |
and | 4 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4598 |
| Compressed Size | 1086 |
| Max. Term Depth | 5 |
| Asserts | 71 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 3 |
or | 4 |
and | 4 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4599 |
| Compressed Size | 1087 |
| Max. Term Depth | 5 |
| Asserts | 71 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 3 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4678 |
| Compressed Size | 1110 |
| Max. Term Depth | 5 |
| Asserts | 72 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 4 |
or | 4 |
and | 5 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | unsat |
| Inferred Status | None |
| Size | 4656 |
| Compressed Size | 1106 |
| Max. Term Depth | 5 |
| Asserts | 72 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 4 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 7 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4602 |
| Compressed Size | 1090 |
| Max. Term Depth | 5 |
| Asserts | 71 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 3 |
or | 4 |
and | 4 |
= | 35 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4714 |
| Compressed Size | 1110 |
| Max. Term Depth | 5 |
| Asserts | 72 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 4 |
or | 4 |
and | 5 |
= | 36 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4626 |
| Compressed Size | 1099 |
| Max. Term Depth | 5 |
| Asserts | 71 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 3 |
or | 4 |
and | 4 |
= | 37 |
distinct | 1 |
forall | 6 |
exists | 1 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4705 |
| Compressed Size | 1117 |
| Max. Term Depth | 5 |
| Asserts | 72 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 4 |
or | 4 |
and | 5 |
= | 37 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4706 |
| Compressed Size | 1123 |
| Max. Term Depth | 5 |
| Asserts | 72 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 4 |
or | 4 |
and | 5 |
= | 38 |
distinct | 1 |
forall | 6 |
exists | 2 |
Real | 2 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 4681 |
| Compressed Size | 1117 |
| Max. Term Depth | 5 |
| Asserts | 72 |
| Declared Functions | 5 |
| Declared Constants | 33 |
| Declared Sorts | 3 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
not | 4 |
or | 4 |
and | 4 |
= | 37 |
distinct | 1 |
forall | 7 |
exists | 1 |
Real | 2 |
| | | | | |