Skip to content

Commit dca4e0b

Browse files
committed
Deploy to GitHub Pages
0 parents  commit dca4e0b

File tree

219 files changed

+118579
-0
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

219 files changed

+118579
-0
lines changed

ConfigurationOptions.txt

+146
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,146 @@
1+
# SPDX-FileCopyrightText: 2020 Dirk Beyer <https://www.sosy-lab.org>
2+
# SPDX-FileCopyrightText: 2022 Dirk Beyer <https://www.sosy-lab.org>
3+
# SPDX-FileCopyrightText: 2023 Dirk Beyer <https://www.sosy-lab.org>
4+
# SPDX-FileCopyrightText: 2024 Dirk Beyer <https://www.sosy-lab.org>
5+
#
6+
# SPDX-License-Identifier: Apache-2.0
7+
8+
# Further options for Bitwuzla in addition to the default options. Format:
9+
# "option_name=value" with ’,’ to separate options. Option names and values
10+
# can be found in the Bitwuzla documentation
11+
# online:https://bitwuzla.github.io/docs/cpp/enums/option.html#_CPPv4N8bitwuzla6OptionEExample:
12+
# "PRODUCE_MODELS=2,SAT_SOLVER=kissat".
13+
solver.bitwuzla.furtherOptions = ""
14+
15+
# The SAT solver used by Bitwuzla.
16+
solver.bitwuzla.satSolver = CADICAL
17+
enum: [LINGELING, CMS, CADICAL, KISSAT]
18+
19+
# Further options for Boolector in addition to the default options. Format:
20+
# "Optionname=value" with ’,’ to seperate options. Optionname and value can
21+
# be found in BtorOption or Boolector C Api.Example:
22+
# "BTOR_OPT_MODEL_GEN=2,BTOR_OPT_INCREMENTAL=1".
23+
solver.boolector.furtherOptions = ""
24+
25+
# The SAT solver used by Boolector.
26+
solver.boolector.satSolver = CADICAL
27+
enum: [LINGELING, PICOSAT, MINISAT, CMS, CADICAL]
28+
29+
# Counts all operations and interactions towards the SMT solver.
30+
solver.collectStatistics = false
31+
32+
# apply additional validation checks for interpolation results
33+
solver.cvc5.validateInterpolants = false
34+
35+
# Enable assertions that make sure that functions are only used in the
36+
# context that declared them.
37+
solver.debugMode.noSharedDeclarations = false
38+
39+
# Enable assertions that make sure formula terms are only used in the context
40+
# that created them.
41+
solver.debugMode.noSharedFormulas = false
42+
43+
# Enable assertions that make sure that solver instances are only used on the
44+
# thread that created them.
45+
solver.debugMode.threadLocal = false
46+
47+
# Default rounding mode for floating point operations.
48+
solver.floatingPointRoundingMode = NEAREST_TIES_TO_EVEN
49+
enum: [NEAREST_TIES_TO_EVEN, NEAREST_TIES_AWAY, TOWARD_POSITIVE, TOWARD_NEGATIVE,
50+
TOWARD_ZERO]
51+
52+
# Export solver queries in SmtLib format into a file.
53+
solver.logAllQueries = false
54+
solver.logfile = no default value
55+
56+
# Further options that will be passed to Mathsat in addition to the default
57+
# options. Format is 'key1=value1,key2=value2'
58+
solver.mathsat5.furtherOptions = ""
59+
60+
# Load less stable optimizing version of mathsat5 solver.
61+
solver.mathsat5.loadOptimathsat5 = false
62+
63+
# Use non-linear arithmetic of the solver if supported and throw exception
64+
# otherwise, approximate non-linear arithmetic with UFs if unsupported, or
65+
# always approximate non-linear arithmetic. This affects only the theories of
66+
# integer and rational arithmetic.
67+
solver.nonLinearArithmetic = USE
68+
enum: [USE, APPROXIMATE_FALLBACK, APPROXIMATE_ALWAYS]
69+
70+
# Algorithm for boolean interpolation
71+
solver.opensmt.algBool = 0
72+
73+
# Algorithm for LRA interpolation
74+
solver.opensmt.algLra = 0
75+
76+
# Algorithm for UF interpolation
77+
solver.opensmt.algUf = 0
78+
79+
# SMT-LIB2 name of the logic to be used by the solver.
80+
solver.opensmt.logic = QF_AUFLIRA
81+
enum: [CORE, QF_AX, QF_UF, QF_IDL, QF_RDL, QF_LIA, QF_LRA, QF_ALIA, QF_ALRA,
82+
QF_UFLIA, QF_UFLRA, QF_AUFLIA, QF_AUFLRA, QF_AUFLIRA]
83+
84+
# Enable additional assertion checks within Princess. The main usage is
85+
# debugging. This option can cause a performance overhead.
86+
solver.princess.enableAssertions = false
87+
88+
# log all queries as Princess-specific Scala code
89+
solver.princess.logAllQueriesAsScala = false
90+
91+
# file for Princess-specific dump of queries as Scala code
92+
solver.princess.logAllQueriesAsScalaFile = "princess-query-%03d-"
93+
94+
# The number of atoms a term has to have before it gets abbreviated if there
95+
# are more identical terms.
96+
solver.princess.minAtomsForAbbreviation = 100
97+
98+
# Random seed for SMT solver.
99+
solver.randomSeed = 42
100+
101+
# If logging from the same application, avoid conflicting logfile names.
102+
solver.renameLogfileToAvoidConflicts = true
103+
104+
# Double check generated results like interpolants and models whether they
105+
# are correct
106+
solver.smtinterpol.checkResults = false
107+
108+
# Further options that will be set to true for SMTInterpol in addition to the
109+
# default options. Format is 'option1,option2,option3'
110+
solver.smtinterpol.furtherOptions = []
111+
112+
# Which SMT solver to use.
113+
solver.solver = SMTINTERPOL
114+
enum: [OPENSMT, MATHSAT5, SMTINTERPOL, Z3, PRINCESS, BOOLECTOR, CVC4, CVC5,
115+
YICES2, BITWUZLA]
116+
117+
# Sequentialize all solver actions to allow concurrent access!
118+
solver.synchronize = false
119+
120+
# Use provers from a seperate context to solve queries. This allows more
121+
# parallelity when solving larger queries.
122+
solver.synchronized.useSeperateProvers = false
123+
124+
# Apply additional checks to catch common user errors.
125+
solver.useDebugMode = false
126+
127+
# Log solver actions, this may be slow!
128+
solver.useLogger = false
129+
130+
# Activate replayable logging in Z3. The log can be given as an input to the
131+
# solver and replayed.
132+
solver.z3.log = no default value
133+
134+
# Ordering for objectives in the optimization context
135+
solver.z3.objectivePrioritizationMode = "box"
136+
allowed values: [lex, pareto, box]
137+
138+
# Engine to use for the optimization
139+
solver.z3.optimizationEngine = "basic"
140+
allowed values: [basic, farkas, symba]
141+
142+
# Require proofs from SMT solver
143+
solver.z3.requireProofs = false
144+
145+
# Whether to use PhantomReferences for discarding Z3 AST
146+
solver.z3.usePhantomReferences = false

0 commit comments

Comments
 (0)