Dear Yoel Kim,
Am 22.09.23 um 07:50 schrieb Yoel Kim:
As you have noticed, the -svcomp22 configuration is a complex
configuration that consists of many different analyses combined using
strategy selection, sequential combinations, and parallel combinations.
Due to the sequential combination, a simple extension of the time limit
is not really meaningful, as it would only extend the time available for
the last of these analyses. This is why CPAchecker refuses to run this
configuration with a different time limit than 900s by default.
Of course you are free to create your own configuration for CPAchecker
and you can base this on the existing configs by adapting their time
limits to the values you prefer. But the CPAchecker team has no
experience with running something like -svcomp22 for a longer time, so
we cannot advise on which values would be most appropriate.
In general, a configuration like -svcomp22 is really most suited for use
cases where you want to verify lots of different programs and have only
limited resources. For use cases with a specific kind of program or with
more resources I would recommend to experiment with the individual
analyses on their own. This way you can learn what works well for your
programs.
Besides -predicateAnalysis I can recommend trying out -kInduction, which
is also part of -svcomp22 and the default analysis of CPAchecker for
reachability properties.
-predicateAnalysis-ImpactRefiner-ABEl would also be an option.
If you are only interested in finding bugs and not in proofs,
then -bmc-incremental is a good choice (but it will typically not know
when to terminate and thus run as long as you let it).
Greetings
Philipp
--
Philipp Wendler
Software and Computational Systems Lab
LMU Munich, Germany
Oettingenstr. 67 Raum F008 - Tel.: 089/2180-9181