runtimeverification / runtimeverification/haskell-backend
Cannot evaluate simple predicate without SMT solver
Nobody has claimed this yet.
- Dominant language
- Haskell
- Stars
- 224
- Forks
- 43
- PR merge metrics
- No merged PRs in 30d
Description
This file comes from a simple proof on https://github.com/kframework/evm-semantics/pull/912/commits/06c9c8b514b544057e27a81e568acd89eda58654.
The proof is from tests/specs/functional/lemmas-no-smt-spec.k, and looks like this:
claim <k> runLemma ( 1 ==Int bool2Word( B:Bool ) ) => doneLemma ( B ==K true ) ... </k>
The error produced looks like this:
kore-exec: [2886042] Error (ErrorDecidePredicateUnknown):
Failed to decide predicate:
/* Sfa */
\not{R}(
/* Spa */
\equals{SortBool{}, R}(
/* Fl Fn D Sfa */ VarB:SortBool{},
/* Fl Fn D Sfa Cl */ /* builtin: */ \dv{SortBool{}}("false")
)
)
with side condition:
/* D Sfa */ \top{_PREDICATE{}}()
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with tests/specs/functional/lemmas-no-smt-spec.k and reproduce the claim using the attached kevm-bug.tar.gz. Trace the kore-exec ErrorDecidePredicateUnknown output for the simple predicate and compare it with the proof referenced from evm-semantics. Done means the claim can be evaluated without an SMT solver and the regression is covered by the relevant test.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- haskell
- Domain
- backend
- Issue type
- Bug
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100