Non-terminating simplifications

[PetarMax]

WIth the activation of syntactic checks post-simplification (which I think are important), the booster simplifications appear to no longer be terminating, or at least completing in tractable times. I'm attaching a bug report and an output transcript for a proof run with

--kore-rpc-command='kore-rpc-booster -l Aborts --equation-max-recursion 1 --no-post-exec-simplify --solver-transcript new-solver --log-context "*booster*simplify*'

just to provide the backend team with a request to start from. I will try to investigate now what happens when the maximal recursion depth is set to 2 and report here.

new-report.tar.gz
new-transcript.txt

[PetarMax]

Here are also bug reports for a crashing implication check (with #3870) and the same check passing with current Kontrol booster.

report-crash.tar.gz
report-success.tar.gz