/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:30:50,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:30:50,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 06:30:50,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:30:50,876 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:30:50,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:30:50,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:30:50,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:30:50,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:30:50,909 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:30:50,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:30:50,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:30:50,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:30:50,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:30:50,912 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:30:50,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:30:50,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:30:50,913 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:30:50,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 06:30:50,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:30:50,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:30:50,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:30:50,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:30:50,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:30:50,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:30:50,916 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:30:50,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:30:50,916 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:30:50,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:30:50,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:30:50,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:30:50,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:30:50,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:30:50,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:30:50,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:30:50,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:30:50,919 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 06:30:50,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 06:30:50,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:30:50,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:30:50,920 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:30:50,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:30:50,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:30:50,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 06:30:51,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:30:51,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:30:51,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:30:51,203 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:30:51,204 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:30:51,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2023-12-16 06:30:52,447 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:30:52,920 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:30:52,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2023-12-16 06:30:52,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e73ece8/5bda9d670c64448aab9484dcc6255fab/FLAG53fbe01bc [2023-12-16 06:30:52,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/92e73ece8/5bda9d670c64448aab9484dcc6255fab [2023-12-16 06:30:52,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:30:52,980 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:30:52,983 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:30:52,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:30:52,987 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:30:52,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:30:52" (1/1) ... [2023-12-16 06:30:52,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cef95f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:52, skipping insertion in model container [2023-12-16 06:30:52,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:30:52" (1/1) ... [2023-12-16 06:30:53,211 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:30:53,713 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17602,17615] [2023-12-16 06:30:53,737 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22899,22912] [2023-12-16 06:30:53,746 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24256,24269] [2023-12-16 06:30:53,751 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25064,25077] [2023-12-16 06:30:53,760 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26792,26805] [2023-12-16 06:30:53,766 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27600,27613] [2023-12-16 06:30:53,772 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28779,28792] [2023-12-16 06:30:53,786 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31519,31532] [2023-12-16 06:30:53,791 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32330,32343] [2023-12-16 06:30:53,801 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33512,33525] [2023-12-16 06:30:53,811 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35703,35716] [2023-12-16 06:30:53,836 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39963,39976] [2023-12-16 06:30:53,841 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40774,40787] [2023-12-16 06:30:53,846 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41956,41969] [2023-12-16 06:30:53,856 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44147,44160] [2023-12-16 06:30:53,870 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47858,47871] [2023-12-16 06:30:53,894 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54605,54618] [2023-12-16 06:30:53,898 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55416,55429] [2023-12-16 06:30:53,903 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56559,56572] [2023-12-16 06:30:53,920 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58711,58724] [2023-12-16 06:30:53,948 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62628,62641] [2023-12-16 06:30:53,977 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69577,69590] [2023-12-16 06:30:54,042 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82313,82326] [2023-12-16 06:30:54,046 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83124,83137] [2023-12-16 06:30:54,051 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84306,84319] [2023-12-16 06:30:54,060 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86497,86510] [2023-12-16 06:30:54,078 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90208,90221] [2023-12-16 06:30:54,102 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96406,96419] [2023-12-16 06:30:54,140 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[106997,107010] [2023-12-16 06:30:54,662 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:30:54,694 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:30:54,802 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[17602,17615] [2023-12-16 06:30:54,814 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[22899,22912] [2023-12-16 06:30:54,819 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[24256,24269] [2023-12-16 06:30:54,824 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[25064,25077] [2023-12-16 06:30:54,830 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[26792,26805] [2023-12-16 06:30:54,834 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[27600,27613] [2023-12-16 06:30:54,839 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[28779,28792] [2023-12-16 06:30:54,847 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[31519,31532] [2023-12-16 06:30:54,851 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[32330,32343] [2023-12-16 06:30:54,856 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[33512,33525] [2023-12-16 06:30:54,863 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[35703,35716] [2023-12-16 06:30:54,876 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[39963,39976] [2023-12-16 06:30:54,880 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[40774,40787] [2023-12-16 06:30:54,885 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[41956,41969] [2023-12-16 06:30:54,892 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[44147,44160] [2023-12-16 06:30:54,903 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[47858,47871] [2023-12-16 06:30:54,921 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[54605,54618] [2023-12-16 06:30:54,925 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[55416,55429] [2023-12-16 06:30:54,931 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[56559,56572] [2023-12-16 06:30:54,938 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[58711,58724] [2023-12-16 06:30:54,951 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[62628,62641] [2023-12-16 06:30:54,971 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[69577,69590] [2023-12-16 06:30:55,006 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[82313,82326] [2023-12-16 06:30:55,010 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[83124,83137] [2023-12-16 06:30:55,014 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[84306,84319] [2023-12-16 06:30:55,021 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[86497,86510] [2023-12-16 06:30:55,035 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[90208,90221] [2023-12-16 06:30:55,053 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[96406,96419] [2023-12-16 06:30:55,078 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c[106997,107010] [2023-12-16 06:30:55,495 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:30:55,525 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:30:55,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55 WrapperNode [2023-12-16 06:30:55,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:30:55,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:30:55,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:30:55,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:30:55,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:55,596 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:55,814 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13505 [2023-12-16 06:30:55,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:30:55,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:30:55,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:30:55,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:30:55,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:55,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:55,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:56,016 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 06:30:56,016 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:56,016 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:56,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:56,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:56,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:56,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:56,297 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:30:56,299 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:30:56,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:30:56,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:30:56,300 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (1/1) ... [2023-12-16 06:30:56,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:30:56,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:30:56,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 06:30:56,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 06:30:56,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:30:56,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 06:30:56,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:30:56,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:30:56,731 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:30:56,733 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:31:00,947 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:31:01,038 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:31:01,038 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-16 06:31:01,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:31:01 BoogieIcfgContainer [2023-12-16 06:31:01,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:31:01,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:31:01,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:31:01,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:31:01,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:30:52" (1/3) ... [2023-12-16 06:31:01,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c48578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:31:01, skipping insertion in model container [2023-12-16 06:31:01,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:30:55" (2/3) ... [2023-12-16 06:31:01,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c48578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:31:01, skipping insertion in model container [2023-12-16 06:31:01,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:31:01" (3/3) ... [2023-12-16 06:31:01,045 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c.v+lhb-reducer.c [2023-12-16 06:31:01,061 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:31:01,061 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2023-12-16 06:31:01,130 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:31:01,135 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f910fc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:31:01,135 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2023-12-16 06:31:01,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 2080 states, 2050 states have (on average 1.8614634146341464) internal successors, (3816), 2079 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:01,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 06:31:01,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:01,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:01,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:01,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash -393314146, now seen corresponding path program 1 times [2023-12-16 06:31:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:01,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029582977] [2023-12-16 06:31:01,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:01,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:01,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029582977] [2023-12-16 06:31:01,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029582977] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:01,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:01,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:01,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067177703] [2023-12-16 06:31:01,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:01,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:01,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:01,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:01,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:01,867 INFO L87 Difference]: Start difference. First operand has 2080 states, 2050 states have (on average 1.8614634146341464) internal successors, (3816), 2079 states have internal predecessors, (3816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:03,086 INFO L93 Difference]: Finished difference Result 3090 states and 5487 transitions. [2023-12-16 06:31:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:03,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2023-12-16 06:31:03,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:03,107 INFO L225 Difference]: With dead ends: 3090 [2023-12-16 06:31:03,107 INFO L226 Difference]: Without dead ends: 1578 [2023-12-16 06:31:03,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:31:03,118 INFO L413 NwaCegarLoop]: 1850 mSDtfsCounter, 8239 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8239 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:03,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8239 Valid, 1890 Invalid, 950 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 06:31:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2023-12-16 06:31:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2023-12-16 06:31:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1549 states have (on average 1.3247256294383474) internal successors, (2052), 1577 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:03,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2052 transitions. [2023-12-16 06:31:03,207 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2052 transitions. Word has length 100 [2023-12-16 06:31:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:03,208 INFO L495 AbstractCegarLoop]: Abstraction has 1578 states and 2052 transitions. [2023-12-16 06:31:03,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2052 transitions. [2023-12-16 06:31:03,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-16 06:31:03,213 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:03,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:03,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 06:31:03,214 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:03,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:03,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1603541041, now seen corresponding path program 1 times [2023-12-16 06:31:03,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:03,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80769032] [2023-12-16 06:31:03,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:03,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:03,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:03,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80769032] [2023-12-16 06:31:03,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80769032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:03,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:03,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:03,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564077284] [2023-12-16 06:31:03,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:03,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:03,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:03,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:03,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:03,469 INFO L87 Difference]: Start difference. First operand 1578 states and 2052 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:04,229 INFO L93 Difference]: Finished difference Result 2582 states and 3467 transitions. [2023-12-16 06:31:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:04,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2023-12-16 06:31:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:04,235 INFO L225 Difference]: With dead ends: 2582 [2023-12-16 06:31:04,236 INFO L226 Difference]: Without dead ends: 1319 [2023-12-16 06:31:04,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:31:04,239 INFO L413 NwaCegarLoop]: 1011 mSDtfsCounter, 5218 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5218 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:04,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5218 Valid, 1015 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 06:31:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2023-12-16 06:31:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2023-12-16 06:31:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1290 states have (on average 1.3643410852713178) internal successors, (1760), 1318 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1760 transitions. [2023-12-16 06:31:04,269 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1760 transitions. Word has length 101 [2023-12-16 06:31:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:04,271 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1760 transitions. [2023-12-16 06:31:04,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1760 transitions. [2023-12-16 06:31:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-16 06:31:04,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:04,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:04,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 06:31:04,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:04,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:04,277 INFO L85 PathProgramCache]: Analyzing trace with hash 2013226204, now seen corresponding path program 1 times [2023-12-16 06:31:04,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:04,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555076828] [2023-12-16 06:31:04,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:04,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:04,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:04,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555076828] [2023-12-16 06:31:04,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555076828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:04,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:04,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571278279] [2023-12-16 06:31:04,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:04,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:04,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:04,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:04,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:04,513 INFO L87 Difference]: Start difference. First operand 1319 states and 1760 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:05,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:05,299 INFO L93 Difference]: Finished difference Result 2323 states and 3174 transitions. [2023-12-16 06:31:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:05,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2023-12-16 06:31:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:05,304 INFO L225 Difference]: With dead ends: 2323 [2023-12-16 06:31:05,304 INFO L226 Difference]: Without dead ends: 1215 [2023-12-16 06:31:05,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:31:05,307 INFO L413 NwaCegarLoop]: 829 mSDtfsCounter, 4772 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:05,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 873 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 06:31:05,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2023-12-16 06:31:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2023-12-16 06:31:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 1186 states have (on average 1.381956155143339) internal successors, (1639), 1214 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:05,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1639 transitions. [2023-12-16 06:31:05,331 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1639 transitions. Word has length 102 [2023-12-16 06:31:05,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:05,333 INFO L495 AbstractCegarLoop]: Abstraction has 1215 states and 1639 transitions. [2023-12-16 06:31:05,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:05,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1639 transitions. [2023-12-16 06:31:05,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 06:31:05,336 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:05,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:05,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 06:31:05,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:05,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:05,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1623961495, now seen corresponding path program 1 times [2023-12-16 06:31:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:05,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259618013] [2023-12-16 06:31:05,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:05,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:05,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259618013] [2023-12-16 06:31:05,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259618013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:05,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:05,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:05,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70453564] [2023-12-16 06:31:05,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:05,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:05,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:05,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:05,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:05,499 INFO L87 Difference]: Start difference. First operand 1215 states and 1639 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:06,169 INFO L93 Difference]: Finished difference Result 2219 states and 3052 transitions. [2023-12-16 06:31:06,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:06,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2023-12-16 06:31:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:06,174 INFO L225 Difference]: With dead ends: 2219 [2023-12-16 06:31:06,174 INFO L226 Difference]: Without dead ends: 1145 [2023-12-16 06:31:06,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:31:06,177 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 4579 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4579 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:06,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4579 Valid, 880 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 06:31:06,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2023-12-16 06:31:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2023-12-16 06:31:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1116 states have (on average 1.3978494623655915) internal successors, (1560), 1144 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1560 transitions. [2023-12-16 06:31:06,224 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1560 transitions. Word has length 103 [2023-12-16 06:31:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:06,225 INFO L495 AbstractCegarLoop]: Abstraction has 1145 states and 1560 transitions. [2023-12-16 06:31:06,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1560 transitions. [2023-12-16 06:31:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-16 06:31:06,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:06,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:06,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 06:31:06,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:06,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:06,229 INFO L85 PathProgramCache]: Analyzing trace with hash -301054445, now seen corresponding path program 1 times [2023-12-16 06:31:06,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:06,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921958601] [2023-12-16 06:31:06,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:06,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:06,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921958601] [2023-12-16 06:31:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921958601] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:06,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:06,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:06,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712803797] [2023-12-16 06:31:06,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:06,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:06,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:06,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:06,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:06,423 INFO L87 Difference]: Start difference. First operand 1145 states and 1560 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:07,259 INFO L93 Difference]: Finished difference Result 2149 states and 2972 transitions. [2023-12-16 06:31:07,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:07,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2023-12-16 06:31:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:07,264 INFO L225 Difference]: With dead ends: 2149 [2023-12-16 06:31:07,265 INFO L226 Difference]: Without dead ends: 1125 [2023-12-16 06:31:07,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:31:07,267 INFO L413 NwaCegarLoop]: 636 mSDtfsCounter, 4417 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4417 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:07,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4417 Valid, 688 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 06:31:07,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2023-12-16 06:31:07,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2023-12-16 06:31:07,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1096 states have (on average 1.4005474452554745) internal successors, (1535), 1124 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1535 transitions. [2023-12-16 06:31:07,288 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1535 transitions. Word has length 104 [2023-12-16 06:31:07,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:07,289 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1535 transitions. [2023-12-16 06:31:07,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 4 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:07,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1535 transitions. [2023-12-16 06:31:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-16 06:31:07,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:07,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:07,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 06:31:07,292 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:07,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:07,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1267053726, now seen corresponding path program 1 times [2023-12-16 06:31:07,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:07,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491186602] [2023-12-16 06:31:07,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:07,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:07,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:07,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491186602] [2023-12-16 06:31:07,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491186602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:07,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:07,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:07,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804565990] [2023-12-16 06:31:07,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:07,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:07,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:07,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:07,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:07,464 INFO L87 Difference]: Start difference. First operand 1125 states and 1535 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:08,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:08,042 INFO L93 Difference]: Finished difference Result 2129 states and 2946 transitions. [2023-12-16 06:31:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2023-12-16 06:31:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:08,046 INFO L225 Difference]: With dead ends: 2129 [2023-12-16 06:31:08,047 INFO L226 Difference]: Without dead ends: 1094 [2023-12-16 06:31:08,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:31:08,049 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 4429 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4429 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:08,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4429 Valid, 845 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 06:31:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2023-12-16 06:31:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 1094. [2023-12-16 06:31:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1094 states, 1065 states have (on average 1.4093896713615024) internal successors, (1501), 1093 states have internal predecessors, (1501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1501 transitions. [2023-12-16 06:31:08,067 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1501 transitions. Word has length 105 [2023-12-16 06:31:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:08,067 INFO L495 AbstractCegarLoop]: Abstraction has 1094 states and 1501 transitions. [2023-12-16 06:31:08,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1501 transitions. [2023-12-16 06:31:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-16 06:31:08,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:08,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:08,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 06:31:08,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:08,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash -396664639, now seen corresponding path program 1 times [2023-12-16 06:31:08,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:08,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300243500] [2023-12-16 06:31:08,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:08,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:08,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:08,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300243500] [2023-12-16 06:31:08,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300243500] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:08,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:08,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:31:08,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041669397] [2023-12-16 06:31:08,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:08,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:31:08,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:08,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:31:08,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:31:08,228 INFO L87 Difference]: Start difference. First operand 1094 states and 1501 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:08,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:08,909 INFO L93 Difference]: Finished difference Result 2098 states and 2911 transitions. [2023-12-16 06:31:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 06:31:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2023-12-16 06:31:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:08,913 INFO L225 Difference]: With dead ends: 2098 [2023-12-16 06:31:08,913 INFO L226 Difference]: Without dead ends: 1083 [2023-12-16 06:31:08,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:31:08,916 INFO L413 NwaCegarLoop]: 784 mSDtfsCounter, 4343 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4343 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:08,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4343 Valid, 820 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 06:31:08,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2023-12-16 06:31:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2023-12-16 06:31:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.411764705882353) internal successors, (1488), 1082 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1488 transitions. [2023-12-16 06:31:08,934 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1488 transitions. Word has length 106 [2023-12-16 06:31:08,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:08,935 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1488 transitions. [2023-12-16 06:31:08,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1488 transitions. [2023-12-16 06:31:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 06:31:08,937 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:08,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:08,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 06:31:08,938 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:08,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:08,938 INFO L85 PathProgramCache]: Analyzing trace with hash 10049727, now seen corresponding path program 1 times [2023-12-16 06:31:08,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:08,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757972098] [2023-12-16 06:31:08,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:08,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:09,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:09,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757972098] [2023-12-16 06:31:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757972098] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:09,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 06:31:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882057257] [2023-12-16 06:31:09,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:09,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 06:31:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:09,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 06:31:09,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-12-16 06:31:09,541 INFO L87 Difference]: Start difference. First operand 1083 states and 1488 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:11,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:11,773 INFO L93 Difference]: Finished difference Result 1979 states and 2730 transitions. [2023-12-16 06:31:11,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:31:11,774 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-16 06:31:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:11,780 INFO L225 Difference]: With dead ends: 1979 [2023-12-16 06:31:11,780 INFO L226 Difference]: Without dead ends: 1829 [2023-12-16 06:31:11,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2023-12-16 06:31:11,781 INFO L413 NwaCegarLoop]: 876 mSDtfsCounter, 6735 mSDsluCounter, 4501 mSDsCounter, 0 mSdLazyCounter, 4439 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6735 SdHoareTripleChecker+Valid, 5377 SdHoareTripleChecker+Invalid, 4442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:11,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6735 Valid, 5377 Invalid, 4442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4439 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-16 06:31:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2023-12-16 06:31:11,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1083. [2023-12-16 06:31:11,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4108159392789374) internal successors, (1487), 1082 states have internal predecessors, (1487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:11,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1487 transitions. [2023-12-16 06:31:11,804 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1487 transitions. Word has length 107 [2023-12-16 06:31:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:11,804 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1487 transitions. [2023-12-16 06:31:11,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 9 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1487 transitions. [2023-12-16 06:31:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 06:31:11,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:11,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:11,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 06:31:11,807 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:11,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:11,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1889558665, now seen corresponding path program 1 times [2023-12-16 06:31:11,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:11,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348132602] [2023-12-16 06:31:11,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:11,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:12,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:12,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348132602] [2023-12-16 06:31:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348132602] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:12,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 06:31:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105092235] [2023-12-16 06:31:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:12,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 06:31:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:12,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 06:31:12,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:31:12,203 INFO L87 Difference]: Start difference. First operand 1083 states and 1487 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:13,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:13,551 INFO L93 Difference]: Finished difference Result 1995 states and 2645 transitions. [2023-12-16 06:31:13,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 06:31:13,551 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-16 06:31:13,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:13,555 INFO L225 Difference]: With dead ends: 1995 [2023-12-16 06:31:13,556 INFO L226 Difference]: Without dead ends: 1410 [2023-12-16 06:31:13,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-16 06:31:13,557 INFO L413 NwaCegarLoop]: 673 mSDtfsCounter, 6594 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6594 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:13,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6594 Valid, 1664 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 06:31:13,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2023-12-16 06:31:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1083. [2023-12-16 06:31:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4098671726755219) internal successors, (1486), 1082 states have internal predecessors, (1486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:13,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1486 transitions. [2023-12-16 06:31:13,576 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1486 transitions. Word has length 107 [2023-12-16 06:31:13,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:13,576 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1486 transitions. [2023-12-16 06:31:13,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1486 transitions. [2023-12-16 06:31:13,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 06:31:13,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:13,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:13,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 06:31:13,581 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:13,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:13,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1673844547, now seen corresponding path program 1 times [2023-12-16 06:31:13,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:13,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378711157] [2023-12-16 06:31:13,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:13,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:13,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:13,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378711157] [2023-12-16 06:31:13,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378711157] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:13,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:13,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:13,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307545158] [2023-12-16 06:31:13,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:13,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:13,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:13,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:13,906 INFO L87 Difference]: Start difference. First operand 1083 states and 1486 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:15,626 INFO L93 Difference]: Finished difference Result 1969 states and 2720 transitions. [2023-12-16 06:31:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:31:15,626 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-16 06:31:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:15,632 INFO L225 Difference]: With dead ends: 1969 [2023-12-16 06:31:15,632 INFO L226 Difference]: Without dead ends: 1833 [2023-12-16 06:31:15,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:31:15,634 INFO L413 NwaCegarLoop]: 892 mSDtfsCounter, 4371 mSDsluCounter, 2928 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4371 SdHoareTripleChecker+Valid, 3820 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:15,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4371 Valid, 3820 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 06:31:15,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2023-12-16 06:31:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1083. [2023-12-16 06:31:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4089184060721063) internal successors, (1485), 1082 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1485 transitions. [2023-12-16 06:31:15,658 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1485 transitions. Word has length 107 [2023-12-16 06:31:15,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:15,658 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1485 transitions. [2023-12-16 06:31:15,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:15,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1485 transitions. [2023-12-16 06:31:15,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 06:31:15,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:15,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:15,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 06:31:15,661 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:15,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash 124559761, now seen corresponding path program 1 times [2023-12-16 06:31:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:15,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197936980] [2023-12-16 06:31:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:15,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:16,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:16,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:16,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197936980] [2023-12-16 06:31:16,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197936980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:16,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:16,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 06:31:16,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119086520] [2023-12-16 06:31:16,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:16,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 06:31:16,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:16,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 06:31:16,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-16 06:31:16,150 INFO L87 Difference]: Start difference. First operand 1083 states and 1485 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:18,385 INFO L93 Difference]: Finished difference Result 1976 states and 2703 transitions. [2023-12-16 06:31:18,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 06:31:18,385 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-16 06:31:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:18,391 INFO L225 Difference]: With dead ends: 1976 [2023-12-16 06:31:18,391 INFO L226 Difference]: Without dead ends: 1878 [2023-12-16 06:31:18,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-12-16 06:31:18,392 INFO L413 NwaCegarLoop]: 874 mSDtfsCounter, 5909 mSDsluCounter, 3745 mSDsCounter, 0 mSdLazyCounter, 4035 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5909 SdHoareTripleChecker+Valid, 4619 SdHoareTripleChecker+Invalid, 4045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:18,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5909 Valid, 4619 Invalid, 4045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4035 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 06:31:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2023-12-16 06:31:18,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1102. [2023-12-16 06:31:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1073 states have (on average 1.4100652376514446) internal successors, (1513), 1101 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1513 transitions. [2023-12-16 06:31:18,419 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1513 transitions. Word has length 107 [2023-12-16 06:31:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:18,420 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1513 transitions. [2023-12-16 06:31:18,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1513 transitions. [2023-12-16 06:31:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 06:31:18,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:18,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:18,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 06:31:18,423 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:18,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1877771599, now seen corresponding path program 1 times [2023-12-16 06:31:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:18,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962945349] [2023-12-16 06:31:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:18,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:18,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962945349] [2023-12-16 06:31:18,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962945349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:18,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 06:31:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549659487] [2023-12-16 06:31:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:18,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 06:31:18,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:18,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 06:31:18,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-16 06:31:18,898 INFO L87 Difference]: Start difference. First operand 1102 states and 1513 transitions. Second operand has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:20,966 INFO L93 Difference]: Finished difference Result 2142 states and 2942 transitions. [2023-12-16 06:31:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 06:31:20,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-16 06:31:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:20,971 INFO L225 Difference]: With dead ends: 2142 [2023-12-16 06:31:20,971 INFO L226 Difference]: Without dead ends: 1992 [2023-12-16 06:31:20,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2023-12-16 06:31:20,972 INFO L413 NwaCegarLoop]: 891 mSDtfsCounter, 8818 mSDsluCounter, 3821 mSDsCounter, 0 mSdLazyCounter, 3829 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8818 SdHoareTripleChecker+Valid, 4712 SdHoareTripleChecker+Invalid, 3844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:20,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8818 Valid, 4712 Invalid, 3844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3829 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 06:31:20,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2023-12-16 06:31:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1106. [2023-12-16 06:31:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 1077 states have (on average 1.4085422469823583) internal successors, (1517), 1105 states have internal predecessors, (1517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:20,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1517 transitions. [2023-12-16 06:31:20,995 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1517 transitions. Word has length 107 [2023-12-16 06:31:20,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:20,995 INFO L495 AbstractCegarLoop]: Abstraction has 1106 states and 1517 transitions. [2023-12-16 06:31:20,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.727272727272727) internal successors, (107), 10 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1517 transitions. [2023-12-16 06:31:20,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-16 06:31:20,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:20,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:20,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 06:31:20,998 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:20,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:20,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1737339, now seen corresponding path program 1 times [2023-12-16 06:31:20,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:20,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143050028] [2023-12-16 06:31:20,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:20,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:21,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:21,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143050028] [2023-12-16 06:31:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143050028] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:21,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:21,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:21,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094030889] [2023-12-16 06:31:21,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:21,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:21,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:21,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:21,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:21,302 INFO L87 Difference]: Start difference. First operand 1106 states and 1517 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:23,116 INFO L93 Difference]: Finished difference Result 2153 states and 2982 transitions. [2023-12-16 06:31:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 06:31:23,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2023-12-16 06:31:23,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:23,123 INFO L225 Difference]: With dead ends: 2153 [2023-12-16 06:31:23,123 INFO L226 Difference]: Without dead ends: 1845 [2023-12-16 06:31:23,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-16 06:31:23,125 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 4106 mSDsluCounter, 4326 mSDsCounter, 0 mSdLazyCounter, 4082 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4106 SdHoareTripleChecker+Valid, 5827 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:23,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4106 Valid, 5827 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4082 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 06:31:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2023-12-16 06:31:23,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1083. [2023-12-16 06:31:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4079696394686907) internal successors, (1484), 1082 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1484 transitions. [2023-12-16 06:31:23,146 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1484 transitions. Word has length 107 [2023-12-16 06:31:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:23,146 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1484 transitions. [2023-12-16 06:31:23,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1484 transitions. [2023-12-16 06:31:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 06:31:23,149 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:23,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:23,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 06:31:23,149 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:23,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1528536076, now seen corresponding path program 1 times [2023-12-16 06:31:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432928221] [2023-12-16 06:31:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:23,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:23,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432928221] [2023-12-16 06:31:23,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432928221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:23,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:23,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643434978] [2023-12-16 06:31:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:23,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:23,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:23,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:23,472 INFO L87 Difference]: Start difference. First operand 1083 states and 1484 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:25,090 INFO L93 Difference]: Finished difference Result 1883 states and 2580 transitions. [2023-12-16 06:31:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:31:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 06:31:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:25,095 INFO L225 Difference]: With dead ends: 1883 [2023-12-16 06:31:25,095 INFO L226 Difference]: Without dead ends: 1785 [2023-12-16 06:31:25,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:31:25,096 INFO L413 NwaCegarLoop]: 868 mSDtfsCounter, 4231 mSDsluCounter, 2837 mSDsCounter, 0 mSdLazyCounter, 3113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4231 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:25,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4231 Valid, 3705 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3113 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 06:31:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2023-12-16 06:31:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1083. [2023-12-16 06:31:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.407020872865275) internal successors, (1483), 1082 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1483 transitions. [2023-12-16 06:31:25,114 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1483 transitions. Word has length 109 [2023-12-16 06:31:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:25,114 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1483 transitions. [2023-12-16 06:31:25,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1483 transitions. [2023-12-16 06:31:25,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 06:31:25,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:25,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:25,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 06:31:25,117 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:25,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:25,117 INFO L85 PathProgramCache]: Analyzing trace with hash -473795284, now seen corresponding path program 1 times [2023-12-16 06:31:25,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:25,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233695504] [2023-12-16 06:31:25,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:25,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:25,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:25,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233695504] [2023-12-16 06:31:25,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233695504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:25,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:25,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:25,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496850466] [2023-12-16 06:31:25,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:25,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:25,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:25,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:25,374 INFO L87 Difference]: Start difference. First operand 1083 states and 1483 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:26,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:26,887 INFO L93 Difference]: Finished difference Result 1983 states and 2730 transitions. [2023-12-16 06:31:26,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:31:26,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 06:31:26,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:26,894 INFO L225 Difference]: With dead ends: 1983 [2023-12-16 06:31:26,894 INFO L226 Difference]: Without dead ends: 1833 [2023-12-16 06:31:26,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:31:26,895 INFO L413 NwaCegarLoop]: 845 mSDtfsCounter, 7132 mSDsluCounter, 2778 mSDsCounter, 0 mSdLazyCounter, 2898 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7132 SdHoareTripleChecker+Valid, 3623 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:26,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7132 Valid, 3623 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2898 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 06:31:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2023-12-16 06:31:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1083. [2023-12-16 06:31:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4060721062618595) internal successors, (1482), 1082 states have internal predecessors, (1482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1482 transitions. [2023-12-16 06:31:26,914 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1482 transitions. Word has length 109 [2023-12-16 06:31:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:26,915 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1482 transitions. [2023-12-16 06:31:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1482 transitions. [2023-12-16 06:31:26,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 06:31:26,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:26,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:26,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 06:31:26,918 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:26,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:26,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1405713654, now seen corresponding path program 1 times [2023-12-16 06:31:26,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:26,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220897931] [2023-12-16 06:31:26,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:26,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:27,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:27,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:27,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220897931] [2023-12-16 06:31:27,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220897931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:27,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:27,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:27,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759800857] [2023-12-16 06:31:27,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:27,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:27,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:27,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:27,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:27,216 INFO L87 Difference]: Start difference. First operand 1083 states and 1482 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:28,851 INFO L93 Difference]: Finished difference Result 1928 states and 2652 transitions. [2023-12-16 06:31:28,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:31:28,852 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 06:31:28,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:28,857 INFO L225 Difference]: With dead ends: 1928 [2023-12-16 06:31:28,857 INFO L226 Difference]: Without dead ends: 1817 [2023-12-16 06:31:28,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:31:28,858 INFO L413 NwaCegarLoop]: 1014 mSDtfsCounter, 3925 mSDsluCounter, 3321 mSDsCounter, 0 mSdLazyCounter, 3533 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3925 SdHoareTripleChecker+Valid, 4335 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:28,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3925 Valid, 4335 Invalid, 3537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3533 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 06:31:28,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2023-12-16 06:31:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1083. [2023-12-16 06:31:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.405123339658444) internal successors, (1481), 1082 states have internal predecessors, (1481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:28,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1481 transitions. [2023-12-16 06:31:28,878 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1481 transitions. Word has length 109 [2023-12-16 06:31:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:28,878 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1481 transitions. [2023-12-16 06:31:28,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1481 transitions. [2023-12-16 06:31:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 06:31:28,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:28,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:28,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 06:31:28,881 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:28,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1668784820, now seen corresponding path program 1 times [2023-12-16 06:31:28,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:28,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538131098] [2023-12-16 06:31:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:29,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:29,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538131098] [2023-12-16 06:31:29,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538131098] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:29,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:29,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:29,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654973631] [2023-12-16 06:31:29,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:29,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:29,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:29,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:29,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:29,212 INFO L87 Difference]: Start difference. First operand 1083 states and 1481 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:31,054 INFO L93 Difference]: Finished difference Result 1962 states and 2706 transitions. [2023-12-16 06:31:31,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 06:31:31,054 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 06:31:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:31,060 INFO L225 Difference]: With dead ends: 1962 [2023-12-16 06:31:31,060 INFO L226 Difference]: Without dead ends: 1833 [2023-12-16 06:31:31,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-12-16 06:31:31,061 INFO L413 NwaCegarLoop]: 871 mSDtfsCounter, 4958 mSDsluCounter, 3944 mSDsCounter, 0 mSdLazyCounter, 3860 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4958 SdHoareTripleChecker+Valid, 4815 SdHoareTripleChecker+Invalid, 3864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:31,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4958 Valid, 4815 Invalid, 3864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3860 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 06:31:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2023-12-16 06:31:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1083. [2023-12-16 06:31:31,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4041745730550284) internal successors, (1480), 1082 states have internal predecessors, (1480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:31,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1480 transitions. [2023-12-16 06:31:31,079 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1480 transitions. Word has length 109 [2023-12-16 06:31:31,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:31,079 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1480 transitions. [2023-12-16 06:31:31,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:31,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1480 transitions. [2023-12-16 06:31:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 06:31:31,081 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:31,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:31,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 06:31:31,082 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:31,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:31,082 INFO L85 PathProgramCache]: Analyzing trace with hash 148522489, now seen corresponding path program 1 times [2023-12-16 06:31:31,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:31,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215812538] [2023-12-16 06:31:31,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:31,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:31,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:31,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215812538] [2023-12-16 06:31:31,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215812538] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:31,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:31,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:31,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777574208] [2023-12-16 06:31:31,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:31,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:31,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:31,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:31,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:31,380 INFO L87 Difference]: Start difference. First operand 1083 states and 1480 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:33,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:33,096 INFO L93 Difference]: Finished difference Result 2025 states and 2802 transitions. [2023-12-16 06:31:33,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:31:33,096 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 06:31:33,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:33,101 INFO L225 Difference]: With dead ends: 2025 [2023-12-16 06:31:33,101 INFO L226 Difference]: Without dead ends: 1841 [2023-12-16 06:31:33,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-16 06:31:33,102 INFO L413 NwaCegarLoop]: 1049 mSDtfsCounter, 6057 mSDsluCounter, 3392 mSDsCounter, 0 mSdLazyCounter, 3545 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6057 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:33,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6057 Valid, 4441 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3545 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 06:31:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2023-12-16 06:31:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1083. [2023-12-16 06:31:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.403225806451613) internal successors, (1479), 1082 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1479 transitions. [2023-12-16 06:31:33,121 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1479 transitions. Word has length 109 [2023-12-16 06:31:33,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:33,121 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1479 transitions. [2023-12-16 06:31:33,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:33,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1479 transitions. [2023-12-16 06:31:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 06:31:33,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:33,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:33,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 06:31:33,124 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:33,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:33,125 INFO L85 PathProgramCache]: Analyzing trace with hash -2020099149, now seen corresponding path program 1 times [2023-12-16 06:31:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:33,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589329220] [2023-12-16 06:31:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:33,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:33,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589329220] [2023-12-16 06:31:33,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589329220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:33,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:33,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:33,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533484344] [2023-12-16 06:31:33,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:33,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:33,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:33,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:33,449 INFO L87 Difference]: Start difference. First operand 1083 states and 1479 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:35,146 INFO L93 Difference]: Finished difference Result 2046 states and 2818 transitions. [2023-12-16 06:31:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:31:35,147 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 06:31:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:35,151 INFO L225 Difference]: With dead ends: 2046 [2023-12-16 06:31:35,151 INFO L226 Difference]: Without dead ends: 1841 [2023-12-16 06:31:35,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2023-12-16 06:31:35,152 INFO L413 NwaCegarLoop]: 1074 mSDtfsCounter, 5999 mSDsluCounter, 3424 mSDsCounter, 0 mSdLazyCounter, 3547 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5999 SdHoareTripleChecker+Valid, 4498 SdHoareTripleChecker+Invalid, 3551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:35,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5999 Valid, 4498 Invalid, 3551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3547 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 06:31:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2023-12-16 06:31:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1083. [2023-12-16 06:31:35,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4022770398481974) internal successors, (1478), 1082 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1478 transitions. [2023-12-16 06:31:35,170 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1478 transitions. Word has length 109 [2023-12-16 06:31:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:35,171 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1478 transitions. [2023-12-16 06:31:35,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1478 transitions. [2023-12-16 06:31:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 06:31:35,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:35,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:35,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 06:31:35,174 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:35,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1897276727, now seen corresponding path program 1 times [2023-12-16 06:31:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:35,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779925451] [2023-12-16 06:31:35,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:35,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:35,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:35,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779925451] [2023-12-16 06:31:35,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779925451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:35,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:35,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:35,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563677113] [2023-12-16 06:31:35,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:35,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:35,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:35,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:35,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:35,426 INFO L87 Difference]: Start difference. First operand 1083 states and 1478 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:37,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:37,098 INFO L93 Difference]: Finished difference Result 1883 states and 2572 transitions. [2023-12-16 06:31:37,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 06:31:37,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 06:31:37,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:37,101 INFO L225 Difference]: With dead ends: 1883 [2023-12-16 06:31:37,101 INFO L226 Difference]: Without dead ends: 1785 [2023-12-16 06:31:37,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2023-12-16 06:31:37,102 INFO L413 NwaCegarLoop]: 887 mSDtfsCounter, 4176 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4176 SdHoareTripleChecker+Valid, 3783 SdHoareTripleChecker+Invalid, 3155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:37,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4176 Valid, 3783 Invalid, 3155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3151 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 06:31:37,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2023-12-16 06:31:37,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1083. [2023-12-16 06:31:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4013282732447818) internal successors, (1477), 1082 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1477 transitions. [2023-12-16 06:31:37,116 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1477 transitions. Word has length 109 [2023-12-16 06:31:37,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:37,116 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1477 transitions. [2023-12-16 06:31:37,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:37,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1477 transitions. [2023-12-16 06:31:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-16 06:31:37,119 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:37,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:37,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 06:31:37,119 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:37,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:37,120 INFO L85 PathProgramCache]: Analyzing trace with hash -211267848, now seen corresponding path program 1 times [2023-12-16 06:31:37,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:37,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258749760] [2023-12-16 06:31:37,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:37,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:37,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:37,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258749760] [2023-12-16 06:31:37,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258749760] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:37,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:37,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343505955] [2023-12-16 06:31:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:37,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:37,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:37,387 INFO L87 Difference]: Start difference. First operand 1083 states and 1477 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:39,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:39,295 INFO L93 Difference]: Finished difference Result 2203 states and 3020 transitions. [2023-12-16 06:31:39,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 06:31:39,296 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2023-12-16 06:31:39,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:39,299 INFO L225 Difference]: With dead ends: 2203 [2023-12-16 06:31:39,299 INFO L226 Difference]: Without dead ends: 1845 [2023-12-16 06:31:39,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-16 06:31:39,300 INFO L413 NwaCegarLoop]: 1349 mSDtfsCounter, 3792 mSDsluCounter, 4396 mSDsCounter, 0 mSdLazyCounter, 4551 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3792 SdHoareTripleChecker+Valid, 5745 SdHoareTripleChecker+Invalid, 4556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:39,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3792 Valid, 5745 Invalid, 4556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4551 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 06:31:39,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2023-12-16 06:31:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1083. [2023-12-16 06:31:39,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.4003795066413662) internal successors, (1476), 1082 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1476 transitions. [2023-12-16 06:31:39,316 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1476 transitions. Word has length 109 [2023-12-16 06:31:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:39,316 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1476 transitions. [2023-12-16 06:31:39,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 7 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1476 transitions. [2023-12-16 06:31:39,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 06:31:39,318 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:39,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:39,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 06:31:39,319 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:39,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:39,319 INFO L85 PathProgramCache]: Analyzing trace with hash -975546434, now seen corresponding path program 1 times [2023-12-16 06:31:39,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:39,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931477569] [2023-12-16 06:31:39,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931477569] [2023-12-16 06:31:39,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931477569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:39,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:39,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:39,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113463852] [2023-12-16 06:31:39,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:39,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:39,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:39,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:39,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:39,657 INFO L87 Difference]: Start difference. First operand 1083 states and 1476 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:31:41,501 INFO L93 Difference]: Finished difference Result 1969 states and 2707 transitions. [2023-12-16 06:31:41,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 06:31:41,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2023-12-16 06:31:41,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:31:41,505 INFO L225 Difference]: With dead ends: 1969 [2023-12-16 06:31:41,506 INFO L226 Difference]: Without dead ends: 1833 [2023-12-16 06:31:41,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-12-16 06:31:41,507 INFO L413 NwaCegarLoop]: 1136 mSDtfsCounter, 5156 mSDsluCounter, 4352 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5156 SdHoareTripleChecker+Valid, 5488 SdHoareTripleChecker+Invalid, 4144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:41,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5156 Valid, 5488 Invalid, 4144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4139 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-16 06:31:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2023-12-16 06:31:41,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1083. [2023-12-16 06:31:41,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1054 states have (on average 1.3994307400379506) internal successors, (1475), 1082 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1475 transitions. [2023-12-16 06:31:41,522 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1475 transitions. Word has length 111 [2023-12-16 06:31:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:31:41,522 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1475 transitions. [2023-12-16 06:31:41,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:31:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1475 transitions. [2023-12-16 06:31:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-16 06:31:41,525 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:31:41,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:41,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 06:31:41,525 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2023-12-16 06:31:41,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:31:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash -295038365, now seen corresponding path program 1 times [2023-12-16 06:31:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 06:31:41,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261273002] [2023-12-16 06:31:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:31:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 06:31:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:31:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:31:41,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 06:31:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261273002] [2023-12-16 06:31:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261273002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:31:41,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:31:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 06:31:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124396454] [2023-12-16 06:31:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:31:41,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:31:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 06:31:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:31:41,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:31:41,777 INFO L87 Difference]: Start difference. First operand 1083 states and 1475 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 06:31:42,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 06:31:42,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:31:42,276 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 1356 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:31:42,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 419 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:31:42,277 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2023-12-16 06:31:42,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-16 06:31:42,278 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). [2023-12-16 06:31:42,279 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2023-12-16 06:31:42,279 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2023-12-16 06:31:42,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2023-12-16 06:31:42,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2023-12-16 06:31:42,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2023-12-16 06:31:42,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2023-12-16 06:31:42,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2023-12-16 06:31:42,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2023-12-16 06:31:42,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2023-12-16 06:31:42,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2023-12-16 06:31:42,280 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2023-12-16 06:31:42,281 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2023-12-16 06:31:42,281 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2023-12-16 06:31:42,281 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2023-12-16 06:31:42,281 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2023-12-16 06:31:42,281 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2023-12-16 06:31:42,281 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2023-12-16 06:31:42,281 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2023-12-16 06:31:42,281 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2023-12-16 06:31:42,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2023-12-16 06:31:42,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2023-12-16 06:31:42,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2023-12-16 06:31:42,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2023-12-16 06:31:42,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2023-12-16 06:31:42,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2023-12-16 06:31:42,282 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2023-12-16 06:31:42,283 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2023-12-16 06:31:42,283 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2023-12-16 06:31:42,284 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 06:31:42,286 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:31:42,289 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 06:31:42,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:31:42 BoogieIcfgContainer [2023-12-16 06:31:42,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 06:31:42,294 INFO L158 Benchmark]: Toolchain (without parser) took 49311.44ms. Allocated memory was 191.9MB in the beginning and 811.6MB in the end (delta: 619.7MB). Free memory was 130.6MB in the beginning and 237.8MB in the end (delta: -107.2MB). Peak memory consumption was 513.0MB. Max. memory is 8.0GB. [2023-12-16 06:31:42,295 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 191.9MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:31:42,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2543.59ms. Allocated memory was 191.9MB in the beginning and 242.2MB in the end (delta: 50.3MB). Free memory was 130.1MB in the beginning and 101.5MB in the end (delta: 28.7MB). Peak memory consumption was 88.9MB. Max. memory is 8.0GB. [2023-12-16 06:31:42,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 287.59ms. Allocated memory is still 242.2MB. Free memory was 101.5MB in the beginning and 150.8MB in the end (delta: -49.3MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-12-16 06:31:42,296 INFO L158 Benchmark]: Boogie Preprocessor took 482.23ms. Allocated memory is still 242.2MB. Free memory was 150.8MB in the beginning and 147.1MB in the end (delta: 3.7MB). Peak memory consumption was 41.4MB. Max. memory is 8.0GB. [2023-12-16 06:31:42,296 INFO L158 Benchmark]: RCFGBuilder took 4739.67ms. Allocated memory was 242.2MB in the beginning and 458.2MB in the end (delta: 216.0MB). Free memory was 146.6MB in the beginning and 294.7MB in the end (delta: -148.2MB). Peak memory consumption was 192.1MB. Max. memory is 8.0GB. [2023-12-16 06:31:42,298 INFO L158 Benchmark]: TraceAbstraction took 41250.78ms. Allocated memory was 458.2MB in the beginning and 811.6MB in the end (delta: 353.4MB). Free memory was 294.2MB in the beginning and 237.8MB in the end (delta: 56.4MB). Peak memory consumption was 409.8MB. Max. memory is 8.0GB. [2023-12-16 06:31:42,303 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.60ms. Allocated memory is still 191.9MB. Free memory is still 149.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2543.59ms. Allocated memory was 191.9MB in the beginning and 242.2MB in the end (delta: 50.3MB). Free memory was 130.1MB in the beginning and 101.5MB in the end (delta: 28.7MB). Peak memory consumption was 88.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 287.59ms. Allocated memory is still 242.2MB. Free memory was 101.5MB in the beginning and 150.8MB in the end (delta: -49.3MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 482.23ms. Allocated memory is still 242.2MB. Free memory was 150.8MB in the beginning and 147.1MB in the end (delta: 3.7MB). Peak memory consumption was 41.4MB. Max. memory is 8.0GB. * RCFGBuilder took 4739.67ms. Allocated memory was 242.2MB in the beginning and 458.2MB in the end (delta: 216.0MB). Free memory was 146.6MB in the beginning and 294.7MB in the end (delta: -148.2MB). Peak memory consumption was 192.1MB. Max. memory is 8.0GB. * TraceAbstraction took 41250.78ms. Allocated memory was 458.2MB in the beginning and 811.6MB in the end (delta: 353.4MB). Free memory was 294.2MB in the beginning and 237.8MB in the end (delta: 56.4MB). Peak memory consumption was 409.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 924]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 924). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1359]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1359). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1455]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1455). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1510]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1510). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1634]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1634). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1689]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1689). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1772]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1772). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 1965]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1965). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2020]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2020). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2103]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2103). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2255]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2255). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2559]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2559). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2614]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2614). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2697]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2697). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 2849]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2849). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3112]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3112). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3609]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3609). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3664]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3664). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3746]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3746). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 3897]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3897). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4173]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4173). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 4672]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4672). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5613]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5613). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5668]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5668). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5751]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5751). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 5903]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 5903). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6166]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6166). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6622]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6622). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 7433]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 7433). Cancelled while NwaCegarLoop was constructing difference of abstraction (1083states) and FLOYD_HOARE automaton (currently 11 states, 8 states before enhancement),while ReachableStatesComputation was computing reachable states (366 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2080 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 41.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119312 SdHoareTripleChecker+Valid, 29.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119312 mSDsluCounter, 73882 SdHoareTripleChecker+Invalid, 23.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52151 mSDsCounter, 233 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 60064 IncrementalHoareTripleChecker+Invalid, 60297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 233 mSolverCounterUnsat, 21731 mSDtfsCounter, 60064 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 888 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2080occurred in iteration=0, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 10913 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2457 NumberOfCodeBlocks, 2457 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2434 ConstructedInterpolants, 0 QuantifiedInterpolants, 16815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown