-
Notifications
You must be signed in to change notification settings - Fork 34
SMTInterpol submission 2025 #168
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
Summary of modified submissionsSMTInterpol
|
#189: UltimateEliminator submission 2025 #188: Z3-Siri Submission 2025 #187: OSTRICH version 2 #186: yicesQS submission to the 2025 SMT comp #185: Bitwuzla 2025 submission. #184: Yices2 Submission SMTCOMP 2025 #183: cvc5 for SMT-COMP 2025 #182: Create iProver #181: Z3-Owl Submission 2025 #179: Z3-alpha SMT-COMP 2025 #178: Z3-Noodler-Mocha Submission for SMT-COMP 2025 #177: `bv_decide` submission 2025 #176: OpenSMT (min-ucore) submission 2025 #175: Z3-Noodler submission 2025 #172: SMTS submission 2025 #171: Bitwuzla-MachBV Submission for SMT-COMP 2025 #170: Z3-Parti-Z3++ Submission for SMT-COMP 2025 #169: STP-Parti-Bitwuzla Submission for SMT-COMP 2025 #168: SMTInterpol submission 2025 #167: OpenSMT submission 2025 #165: Amaya 2025 #164: SMT-RAT submission #163: COLIBRI submission #162: [Submission] colibri2 #156: upload z3-inc-z3++
|
@jhoenicke Thanks for submitting SMTInterpol to this year's SMT-COMP! We have executed your solver on a small number of benchmarks from each logic it should compete in. You can find the results here:
We have not seen any incorrect results returned by your solver (compared to the expected status of the benchmarks). We have noticed some errors You can check whether all the results we have obtained are expected. If not, please let us know here. Some notes:
If you upload a new version of the solver and want to have another test run, let me know. We still have some time for that. Happy rest of the competition! |
|
@martinjonas Is it possible to download the log files? Or can you point me to the benchmarks where the proof-check failed happened? |
|
I found some instances in QF_BVLRA. This is a new logic, we didn't test on. Since we use integers to handle bitvectors, we internally use LIRA logic, but the proof checker didn't consider this and rejects the proof when it uses LIRA operators. There also seems to be a problem with my internal model validator; the unknown should all be sat. There may also be type-checking problems as we think that "5" is of type Int, but the standard says it's of type Real, since it's QF_BVLRA. I will try to fix these problems and provide a new version. Is there a way to record output to stderr produced in the competition? It would be good to know after the competition in which benchmarks there were proof/model problems instead of just having |
Thanks for the insight, that makes sense. I tried to improve the result tables so that you can now identify the errors more easily. For example, in The same thing should be present in the other tables that now distinguish between
All output, both stdout and stderr, are recorded (and merged). You can download find it here:
In each of these directories, if you go to the subdirectories corresponding to the division and solver of interest, you can find a |
|
I updated the binary. It fixes the problems with QF_BVLRA, also the models work now. |
|
Thanks! I updated the tables with the new results. If anything is still unexpected, let me know. |
|
@jhoenicke The final versions of solvers should be uploaded to Zenodo. Please, do this as soon as possible and change the archive url. Thanks! |
|
I submitted the zenodo for review. |
|
@jhoenicke Thanks a lot, I have just approved it. When you modify the archive url in this pull request, I will merge it right away. |
Solver submission for SMT-COMP: SMTInterpol