-
Notifications
You must be signed in to change notification settings - Fork 43
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
853eeaa
commit fdce131
Showing
10 changed files
with
211 additions
and
75 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -59,7 +59,8 @@ enum class InputType { | |
|
||
enum class Backend { | ||
CEGAR, | ||
BMC, | ||
KIND, | ||
IMC, | ||
LAZY | ||
} | ||
|
||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
50 changes: 50 additions & 0 deletions
50
subprojects/xcfa/xcfa-cli/src/main/java/hu/bme/mit/theta/xcfa/cli/XcfaImcConfig.kt
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,50 @@ | ||
/* | ||
* Copyright 2023 Budapest University of Technology and Economics | ||
* | ||
* Licensed under the Apache License, Version 2.0 (the "License"); | ||
* you may not use this file except in compliance with the License. | ||
* You may obtain a copy of the License at | ||
* | ||
* http://www.apache.org/licenses/LICENSE-2.0 | ||
* | ||
* Unless required by applicable law or agreed to in writing, software | ||
* distributed under the License is distributed on an "AS IS" BASIS, | ||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
* See the License for the specific language governing permissions and | ||
* limitations under the License. | ||
*/ | ||
|
||
package hu.bme.mit.theta.xcfa.cli | ||
|
||
import com.beust.jcommander.Parameter | ||
import hu.bme.mit.theta.analysis.algorithm.imc.ImcChecker | ||
import hu.bme.mit.theta.analysis.expl.ExplState | ||
import hu.bme.mit.theta.analysis.expr.ExprState | ||
import hu.bme.mit.theta.analysis.expr.StmtAction | ||
import hu.bme.mit.theta.core.utils.ExprUtils | ||
import hu.bme.mit.theta.xcfa.analysis.XcfaMonolithicTransFunc | ||
import hu.bme.mit.theta.xcfa.model.XCFA | ||
|
||
data class XcfaImcConfig( | ||
@Parameter(names = ["--imc-solver"], description = "BMC solver name") | ||
var imcSolver: String = "Z3", | ||
@Parameter(names = ["--validate-imc-solver"], | ||
description = "Activates a wrapper, which validates the assertions in the solver in each (SAT) check. Filters some solver issues.") | ||
var validateIMCSolver: Boolean = false, | ||
@Parameter(names = ["--max-bound"], | ||
description = "How many successors to enumerate in a transition. Only relevant to the explicit domain. Use 0 for no limit.") | ||
var maxBound: Int = Int.MAX_VALUE, | ||
) { | ||
|
||
fun getIMCChecker(xcfa: XCFA): ImcChecker<ExprState, StmtAction> { | ||
val transFunc = XcfaMonolithicTransFunc.create(xcfa) | ||
return ImcChecker<ExprState, StmtAction>( | ||
transFunc, | ||
maxBound, | ||
getSolver(imcSolver, validateIMCSolver).createItpSolver(), | ||
ExplState::of, | ||
ExprUtils.getVars(transFunc.transExpr), | ||
true) | ||
} | ||
|
||
} |
Oops, something went wrong.