/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 23:33:09,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 23:33:09,596 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-15 23:33:09,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 23:33:09,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 23:33:09,616 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 23:33:09,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 23:33:09,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 23:33:09,617 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 23:33:09,617 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 23:33:09,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 23:33:09,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 23:33:09,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 23:33:09,618 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 23:33:09,619 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 23:33:09,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 23:33:09,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 23:33:09,619 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 23:33:09,620 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 23:33:09,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 23:33:09,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 23:33:09,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 23:33:09,621 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 23:33:09,621 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 23:33:09,621 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 23:33:09,622 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 23:33:09,622 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 23:33:09,622 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 23:33:09,622 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 23:33:09,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 23:33:09,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 23:33:09,623 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 23:33:09,623 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:33:09,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 23:33:09,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 23:33:09,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 23:33:09,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 23:33:09,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 23:33:09,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 23:33:09,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 23:33:09,625 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 23:33:09,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 23:33:09,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 23:33:09,626 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 -> true [2023-12-15 23:33:09,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 23:33:09,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 23:33:09,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 23:33:09,844 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 23:33:09,844 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 23:33:09,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2023-12-15 23:33:10,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 23:33:11,344 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 23:33:11,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2023-12-15 23:33:11,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36d18c16/6f654ce0f2284d2e90678c5938c31438/FLAG3cb80bbc3 [2023-12-15 23:33:11,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a36d18c16/6f654ce0f2284d2e90678c5938c31438 [2023-12-15 23:33:11,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 23:33:11,409 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 23:33:11,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 23:33:11,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 23:33:11,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 23:33:11,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:33:11" (1/1) ... [2023-12-15 23:33:11,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58815b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:11, skipping insertion in model container [2023-12-15 23:33:11,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 11:33:11" (1/1) ... [2023-12-15 23:33:11,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 23:33:12,324 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82693,82706] [2023-12-15 23:33:12,403 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[113477,113490] [2023-12-15 23:33:12,475 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[165794,165807] [2023-12-15 23:33:12,519 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[197365,197378] [2023-12-15 23:33:12,531 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[205886,205899] [2023-12-15 23:33:12,535 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[207836,207849] [2023-12-15 23:33:12,558 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[224171,224184] [2023-12-15 23:33:12,568 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231245,231258] [2023-12-15 23:33:12,612 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[259571,259584] [2023-12-15 23:33:12,649 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[287337,287350] [2023-12-15 23:33:12,754 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[370939,370952] [2023-12-15 23:33:12,780 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[389606,389619] [2023-12-15 23:33:12,807 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[408649,408662] [2023-12-15 23:33:12,817 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[415665,415678] [2023-12-15 23:33:12,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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[419162,419175] [2023-12-15 23:33:12,895 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[433807,433820] [2023-12-15 23:33:12,914 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[448287,448300] [2023-12-15 23:33:12,952 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[480365,480378] [2023-12-15 23:33:13,056 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[569807,569820] [2023-12-15 23:33:13,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:33:13,205 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 23:33:13,327 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[82693,82706] [2023-12-15 23:33:13,363 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[113477,113490] [2023-12-15 23:33:13,422 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[165794,165807] [2023-12-15 23:33:13,460 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[197365,197378] [2023-12-15 23:33:13,470 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[205886,205899] [2023-12-15 23:33:13,474 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[207836,207849] [2023-12-15 23:33:13,494 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[224171,224184] [2023-12-15 23:33:13,502 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[231245,231258] [2023-12-15 23:33:13,535 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[259571,259584] [2023-12-15 23:33:13,568 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[287337,287350] [2023-12-15 23:33:13,740 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[370939,370952] [2023-12-15 23:33:13,762 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[389606,389619] [2023-12-15 23:33:13,785 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[408649,408662] [2023-12-15 23:33:13,794 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[415665,415678] [2023-12-15 23:33:13,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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[419162,419175] [2023-12-15 23:33:13,818 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[433807,433820] [2023-12-15 23:33:13,838 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[448287,448300] [2023-12-15 23:33:13,873 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[480365,480378] [2023-12-15 23:33:13,969 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-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c[569807,569820] [2023-12-15 23:33:14,080 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 23:33:14,106 INFO L206 MainTranslator]: Completed translation [2023-12-15 23:33:14,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14 WrapperNode [2023-12-15 23:33:14,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 23:33:14,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 23:33:14,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 23:33:14,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 23:33:14,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:14,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:14,810 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30423 [2023-12-15 23:33:14,810 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 23:33:14,811 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 23:33:14,811 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 23:33:14,811 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 23:33:14,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:14,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:14,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:15,054 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-15 23:33:15,054 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:15,054 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:15,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:15,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:15,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:15,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:15,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 23:33:15,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 23:33:15,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 23:33:15,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 23:33:15,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (1/1) ... [2023-12-15 23:33:15,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 23:33:15,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 23:33:15,493 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-15 23:33:15,501 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-15 23:33:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 23:33:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 23:33:15,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 23:33:15,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 23:33:15,942 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 23:33:15,943 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 23:33:23,852 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 23:33:23,971 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 23:33:23,972 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-15 23:33:23,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:33:23 BoogieIcfgContainer [2023-12-15 23:33:23,972 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 23:33:23,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 23:33:23,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 23:33:23,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 23:33:23,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 11:33:11" (1/3) ... [2023-12-15 23:33:23,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecb71df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:33:23, skipping insertion in model container [2023-12-15 23:33:23,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 11:33:14" (2/3) ... [2023-12-15 23:33:23,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecb71df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 11:33:23, skipping insertion in model container [2023-12-15 23:33:23,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 11:33:23" (3/3) ... [2023-12-15 23:33:23,978 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2023-12-15 23:33:23,990 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 23:33:23,991 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2023-12-15 23:33:24,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 23:33:24,108 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;@1b2017cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 23:33:24,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-12-15 23:33:24,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 6181 states, 6161 states have (on average 1.8078234052913489) internal successors, (11138), 6180 states have internal predecessors, (11138), 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-15 23:33:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-15 23:33:24,171 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:24,171 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] [2023-12-15 23:33:24,172 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:24,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1586848728, now seen corresponding path program 1 times [2023-12-15 23:33:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:24,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968739881] [2023-12-15 23:33:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:24,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:24,647 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-15 23:33:24,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:24,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968739881] [2023-12-15 23:33:24,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968739881] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:24,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:24,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:33:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168550297] [2023-12-15 23:33:24,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:24,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:33:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:24,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:33:24,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:33:24,684 INFO L87 Difference]: Start difference. First operand has 6181 states, 6161 states have (on average 1.8078234052913489) internal successors, (11138), 6180 states have internal predecessors, (11138), 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 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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-15 23:33:28,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:28,281 INFO L93 Difference]: Finished difference Result 9218 states and 16397 transitions. [2023-12-15 23:33:28,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:33:28,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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 76 [2023-12-15 23:33:28,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:28,314 INFO L225 Difference]: With dead ends: 9218 [2023-12-15 23:33:28,314 INFO L226 Difference]: Without dead ends: 5814 [2023-12-15 23:33:28,322 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-15 23:33:28,324 INFO L413 NwaCegarLoop]: 4768 mSDtfsCounter, 29233 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 4695 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29233 SdHoareTripleChecker+Valid, 5724 SdHoareTripleChecker+Invalid, 4756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 4695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:28,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29233 Valid, 5724 Invalid, 4756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 4695 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-12-15 23:33:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2023-12-15 23:33:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 5784. [2023-12-15 23:33:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5784 states, 5765 states have (on average 1.3332176929748483) internal successors, (7686), 5783 states have internal predecessors, (7686), 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-15 23:33:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 7686 transitions. [2023-12-15 23:33:28,476 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 7686 transitions. Word has length 76 [2023-12-15 23:33:28,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:28,476 INFO L495 AbstractCegarLoop]: Abstraction has 5784 states and 7686 transitions. [2023-12-15 23:33:28,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 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-15 23:33:28,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 7686 transitions. [2023-12-15 23:33:28,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-15 23:33:28,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:28,488 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] [2023-12-15 23:33:28,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 23:33:28,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:28,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1151184511, now seen corresponding path program 1 times [2023-12-15 23:33:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:28,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277530726] [2023-12-15 23:33:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:28,855 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-15 23:33:28,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:28,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277530726] [2023-12-15 23:33:28,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277530726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:28,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:28,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:33:28,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485402911] [2023-12-15 23:33:28,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:28,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:33:28,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:28,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:33:28,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:33:28,858 INFO L87 Difference]: Start difference. First operand 5784 states and 7686 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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-15 23:33:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:34,361 INFO L93 Difference]: Finished difference Result 6281 states and 8360 transitions. [2023-12-15 23:33:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:33:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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 77 [2023-12-15 23:33:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:34,377 INFO L225 Difference]: With dead ends: 6281 [2023-12-15 23:33:34,377 INFO L226 Difference]: Without dead ends: 6276 [2023-12-15 23:33:34,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2023-12-15 23:33:34,379 INFO L413 NwaCegarLoop]: 3020 mSDtfsCounter, 23355 mSDsluCounter, 9120 mSDsCounter, 0 mSdLazyCounter, 13886 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23355 SdHoareTripleChecker+Valid, 12140 SdHoareTripleChecker+Invalid, 13945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 13886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:34,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23355 Valid, 12140 Invalid, 13945 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 13886 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-15 23:33:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2023-12-15 23:33:34,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 5784. [2023-12-15 23:33:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5784 states, 5765 states have (on average 1.3330442324371206) internal successors, (7685), 5783 states have internal predecessors, (7685), 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-15 23:33:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 7685 transitions. [2023-12-15 23:33:34,461 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 7685 transitions. Word has length 77 [2023-12-15 23:33:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:34,461 INFO L495 AbstractCegarLoop]: Abstraction has 5784 states and 7685 transitions. [2023-12-15 23:33:34,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 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-15 23:33:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 7685 transitions. [2023-12-15 23:33:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-15 23:33:34,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:34,470 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] [2023-12-15 23:33:34,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 23:33:34,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:34,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1331787270, now seen corresponding path program 1 times [2023-12-15 23:33:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:34,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608247009] [2023-12-15 23:33:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:34,577 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-15 23:33:34,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608247009] [2023-12-15 23:33:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608247009] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:34,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:34,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:33:34,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253558435] [2023-12-15 23:33:34,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:34,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:33:34,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:33:34,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:33:34,579 INFO L87 Difference]: Start difference. First operand 5784 states and 7685 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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-15 23:33:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:37,093 INFO L93 Difference]: Finished difference Result 9670 states and 12900 transitions. [2023-12-15 23:33:37,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:33:37,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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 77 [2023-12-15 23:33:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:37,110 INFO L225 Difference]: With dead ends: 9670 [2023-12-15 23:33:37,110 INFO L226 Difference]: Without dead ends: 6120 [2023-12-15 23:33:37,116 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-15 23:33:37,117 INFO L413 NwaCegarLoop]: 2429 mSDtfsCounter, 18090 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 3425 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18090 SdHoareTripleChecker+Valid, 3191 SdHoareTripleChecker+Invalid, 3468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:37,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18090 Valid, 3191 Invalid, 3468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3425 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-15 23:33:37,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6120 states. [2023-12-15 23:33:37,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6120 to 6091. [2023-12-15 23:33:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6091 states, 6072 states have (on average 1.3521080368906455) internal successors, (8210), 6090 states have internal predecessors, (8210), 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-15 23:33:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6091 states to 6091 states and 8210 transitions. [2023-12-15 23:33:37,218 INFO L78 Accepts]: Start accepts. Automaton has 6091 states and 8210 transitions. Word has length 77 [2023-12-15 23:33:37,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:37,219 INFO L495 AbstractCegarLoop]: Abstraction has 6091 states and 8210 transitions. [2023-12-15 23:33:37,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 4 states have internal predecessors, (77), 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-15 23:33:37,219 INFO L276 IsEmpty]: Start isEmpty. Operand 6091 states and 8210 transitions. [2023-12-15 23:33:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-15 23:33:37,227 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:37,227 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] [2023-12-15 23:33:37,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 23:33:37,227 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:37,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1639149933, now seen corresponding path program 1 times [2023-12-15 23:33:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237971992] [2023-12-15 23:33:37,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:37,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:37,335 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-15 23:33:37,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:37,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237971992] [2023-12-15 23:33:37,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237971992] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:37,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:37,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:33:37,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167166702] [2023-12-15 23:33:37,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:37,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:33:37,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:37,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:33:37,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:33:37,337 INFO L87 Difference]: Start difference. First operand 6091 states and 8210 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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-15 23:33:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:39,760 INFO L93 Difference]: Finished difference Result 11970 states and 16291 transitions. [2023-12-15 23:33:39,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:33:39,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2023-12-15 23:33:39,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:39,801 INFO L225 Difference]: With dead ends: 11970 [2023-12-15 23:33:39,801 INFO L226 Difference]: Without dead ends: 8178 [2023-12-15 23:33:39,812 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-15 23:33:39,815 INFO L413 NwaCegarLoop]: 2312 mSDtfsCounter, 17330 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 3312 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17330 SdHoareTripleChecker+Valid, 3078 SdHoareTripleChecker+Invalid, 3442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:39,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17330 Valid, 3078 Invalid, 3442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3312 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-15 23:33:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8178 states. [2023-12-15 23:33:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8178 to 8152. [2023-12-15 23:33:39,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8152 states, 8133 states have (on average 1.3472273453830075) internal successors, (10957), 8151 states have internal predecessors, (10957), 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-15 23:33:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8152 states to 8152 states and 10957 transitions. [2023-12-15 23:33:39,956 INFO L78 Accepts]: Start accepts. Automaton has 8152 states and 10957 transitions. Word has length 78 [2023-12-15 23:33:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:39,957 INFO L495 AbstractCegarLoop]: Abstraction has 8152 states and 10957 transitions. [2023-12-15 23:33:39,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 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-15 23:33:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 8152 states and 10957 transitions. [2023-12-15 23:33:39,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-15 23:33:39,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:39,965 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] [2023-12-15 23:33:39,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 23:33:39,967 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:39,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash 865086873, now seen corresponding path program 1 times [2023-12-15 23:33:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:39,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940958433] [2023-12-15 23:33:39,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:40,564 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-15 23:33:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:40,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940958433] [2023-12-15 23:33:40,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940958433] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:40,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:40,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 23:33:40,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558346681] [2023-12-15 23:33:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:40,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 23:33:40,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:40,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 23:33:40,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:33:40,567 INFO L87 Difference]: Start difference. First operand 8152 states and 10957 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 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-15 23:33:42,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:42,958 INFO L93 Difference]: Finished difference Result 19242 states and 27573 transitions. [2023-12-15 23:33:42,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 23:33:42,958 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 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 78 [2023-12-15 23:33:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:42,987 INFO L225 Difference]: With dead ends: 19242 [2023-12-15 23:33:42,987 INFO L226 Difference]: Without dead ends: 18386 [2023-12-15 23:33:42,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=445, Unknown=0, NotChecked=0, Total=600 [2023-12-15 23:33:42,996 INFO L413 NwaCegarLoop]: 5187 mSDtfsCounter, 24777 mSDsluCounter, 22339 mSDsCounter, 0 mSdLazyCounter, 3854 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24777 SdHoareTripleChecker+Valid, 27526 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:42,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24777 Valid, 27526 Invalid, 3888 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 3854 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-15 23:33:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18386 states. [2023-12-15 23:33:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18386 to 8058. [2023-12-15 23:33:43,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8058 states, 8040 states have (on average 1.3458955223880598) internal successors, (10821), 8057 states have internal predecessors, (10821), 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-15 23:33:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8058 states to 8058 states and 10821 transitions. [2023-12-15 23:33:43,192 INFO L78 Accepts]: Start accepts. Automaton has 8058 states and 10821 transitions. Word has length 78 [2023-12-15 23:33:43,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:43,193 INFO L495 AbstractCegarLoop]: Abstraction has 8058 states and 10821 transitions. [2023-12-15 23:33:43,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 11 states have internal predecessors, (78), 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-15 23:33:43,193 INFO L276 IsEmpty]: Start isEmpty. Operand 8058 states and 10821 transitions. [2023-12-15 23:33:43,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-15 23:33:43,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:43,202 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] [2023-12-15 23:33:43,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 23:33:43,202 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:43,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1161754745, now seen corresponding path program 1 times [2023-12-15 23:33:43,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:43,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803952185] [2023-12-15 23:33:43,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:43,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:43,556 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-15 23:33:43,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:43,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803952185] [2023-12-15 23:33:43,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803952185] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:43,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:43,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 23:33:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120928568] [2023-12-15 23:33:43,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:43,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 23:33:43,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 23:33:43,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:33:43,558 INFO L87 Difference]: Start difference. First operand 8058 states and 10821 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 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-15 23:33:49,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:49,882 INFO L93 Difference]: Finished difference Result 13348 states and 18671 transitions. [2023-12-15 23:33:49,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 23:33:49,883 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 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 79 [2023-12-15 23:33:49,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:49,901 INFO L225 Difference]: With dead ends: 13348 [2023-12-15 23:33:49,902 INFO L226 Difference]: Without dead ends: 12389 [2023-12-15 23:33:49,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=513, Unknown=0, NotChecked=0, Total=702 [2023-12-15 23:33:49,907 INFO L413 NwaCegarLoop]: 2494 mSDtfsCounter, 18702 mSDsluCounter, 10603 mSDsCounter, 0 mSdLazyCounter, 14999 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18702 SdHoareTripleChecker+Valid, 13097 SdHoareTripleChecker+Invalid, 15007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:49,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18702 Valid, 13097 Invalid, 15007 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 14999 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-15 23:33:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12389 states. [2023-12-15 23:33:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12389 to 8065. [2023-12-15 23:33:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8065 states, 8047 states have (on average 1.3455946315397043) internal successors, (10828), 8064 states have internal predecessors, (10828), 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-15 23:33:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8065 states to 8065 states and 10828 transitions. [2023-12-15 23:33:50,044 INFO L78 Accepts]: Start accepts. Automaton has 8065 states and 10828 transitions. Word has length 79 [2023-12-15 23:33:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:50,045 INFO L495 AbstractCegarLoop]: Abstraction has 8065 states and 10828 transitions. [2023-12-15 23:33:50,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 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-15 23:33:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 8065 states and 10828 transitions. [2023-12-15 23:33:50,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-15 23:33:50,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:50,052 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] [2023-12-15 23:33:50,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 23:33:50,052 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:50,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:50,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1561427822, now seen corresponding path program 1 times [2023-12-15 23:33:50,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:50,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482178010] [2023-12-15 23:33:50,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:50,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:50,151 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-15 23:33:50,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482178010] [2023-12-15 23:33:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482178010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:50,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:50,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:33:50,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087887746] [2023-12-15 23:33:50,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:50,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:33:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:50,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:33:50,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:33:50,153 INFO L87 Difference]: Start difference. First operand 8065 states and 10828 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-15 23:33:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:52,059 INFO L93 Difference]: Finished difference Result 15658 states and 21137 transitions. [2023-12-15 23:33:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:33:52,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2023-12-15 23:33:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:52,072 INFO L225 Difference]: With dead ends: 15658 [2023-12-15 23:33:52,072 INFO L226 Difference]: Without dead ends: 10632 [2023-12-15 23:33:52,079 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-15 23:33:52,079 INFO L413 NwaCegarLoop]: 2066 mSDtfsCounter, 15522 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2959 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15522 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:52,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15522 Valid, 2788 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2959 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-15 23:33:52,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2023-12-15 23:33:52,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10612. [2023-12-15 23:33:52,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10612 states, 10594 states have (on average 1.349631867094582) internal successors, (14298), 10611 states have internal predecessors, (14298), 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-15 23:33:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10612 states to 10612 states and 14298 transitions. [2023-12-15 23:33:52,244 INFO L78 Accepts]: Start accepts. Automaton has 10612 states and 14298 transitions. Word has length 79 [2023-12-15 23:33:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:52,244 INFO L495 AbstractCegarLoop]: Abstraction has 10612 states and 14298 transitions. [2023-12-15 23:33:52,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-15 23:33:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 10612 states and 14298 transitions. [2023-12-15 23:33:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-15 23:33:52,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:52,252 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] [2023-12-15 23:33:52,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 23:33:52,253 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:52,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:52,253 INFO L85 PathProgramCache]: Analyzing trace with hash -615366141, now seen corresponding path program 1 times [2023-12-15 23:33:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:52,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607491630] [2023-12-15 23:33:52,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:52,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:52,343 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-15 23:33:52,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:52,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607491630] [2023-12-15 23:33:52,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607491630] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:52,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:52,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 23:33:52,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048089105] [2023-12-15 23:33:52,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:52,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 23:33:52,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:52,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 23:33:52,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 23:33:52,345 INFO L87 Difference]: Start difference. First operand 10612 states and 14298 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-15 23:33:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:54,284 INFO L93 Difference]: Finished difference Result 23852 states and 32588 transitions. [2023-12-15 23:33:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 23:33:54,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2023-12-15 23:33:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:54,301 INFO L225 Difference]: With dead ends: 23852 [2023-12-15 23:33:54,301 INFO L226 Difference]: Without dead ends: 15757 [2023-12-15 23:33:54,311 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-15 23:33:54,312 INFO L413 NwaCegarLoop]: 2091 mSDtfsCounter, 15839 mSDsluCounter, 852 mSDsCounter, 0 mSdLazyCounter, 2981 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15839 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:54,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15839 Valid, 2943 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2981 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-15 23:33:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15757 states. [2023-12-15 23:33:54,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15757 to 15733. [2023-12-15 23:33:54,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15733 states, 15715 states have (on average 1.3548202354438434) internal successors, (21291), 15732 states have internal predecessors, (21291), 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-15 23:33:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15733 states to 15733 states and 21291 transitions. [2023-12-15 23:33:54,508 INFO L78 Accepts]: Start accepts. Automaton has 15733 states and 21291 transitions. Word has length 79 [2023-12-15 23:33:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:54,510 INFO L495 AbstractCegarLoop]: Abstraction has 15733 states and 21291 transitions. [2023-12-15 23:33:54,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 4 states have internal predecessors, (79), 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-15 23:33:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 15733 states and 21291 transitions. [2023-12-15 23:33:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-15 23:33:54,524 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:54,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] [2023-12-15 23:33:54,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 23:33:54,525 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:54,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1945118073, now seen corresponding path program 1 times [2023-12-15 23:33:54,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:54,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095030827] [2023-12-15 23:33:54,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:54,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:54,609 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-15 23:33:54,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:54,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095030827] [2023-12-15 23:33:54,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095030827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:54,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:54,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 23:33:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015076774] [2023-12-15 23:33:54,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:54,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 23:33:54,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:54,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 23:33:54,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:33:54,612 INFO L87 Difference]: Start difference. First operand 15733 states and 21291 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-15 23:33:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:54,920 INFO L93 Difference]: Finished difference Result 31658 states and 43304 transitions. [2023-12-15 23:33:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 23:33:54,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2023-12-15 23:33:54,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:54,940 INFO L225 Difference]: With dead ends: 31658 [2023-12-15 23:33:54,940 INFO L226 Difference]: Without dead ends: 19418 [2023-12-15 23:33:54,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 23:33:54,956 INFO L413 NwaCegarLoop]: 3909 mSDtfsCounter, 3953 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3953 SdHoareTripleChecker+Valid, 5079 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:54,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3953 Valid, 5079 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 23:33:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19418 states. [2023-12-15 23:33:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19418 to 19391. [2023-12-15 23:33:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19391 states, 19373 states have (on average 1.3547204872761058) internal successors, (26245), 19390 states have internal predecessors, (26245), 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-15 23:33:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19391 states to 19391 states and 26245 transitions. [2023-12-15 23:33:55,157 INFO L78 Accepts]: Start accepts. Automaton has 19391 states and 26245 transitions. Word has length 80 [2023-12-15 23:33:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:55,157 INFO L495 AbstractCegarLoop]: Abstraction has 19391 states and 26245 transitions. [2023-12-15 23:33:55,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-15 23:33:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 19391 states and 26245 transitions. [2023-12-15 23:33:55,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-15 23:33:55,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:55,166 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] [2023-12-15 23:33:55,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 23:33:55,167 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:55,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:55,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1507795412, now seen corresponding path program 1 times [2023-12-15 23:33:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334898801] [2023-12-15 23:33:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:55,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:55,643 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-15 23:33:55,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334898801] [2023-12-15 23:33:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334898801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:55,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:55,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 23:33:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596783863] [2023-12-15 23:33:55,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:55,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 23:33:55,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:55,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 23:33:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:33:55,645 INFO L87 Difference]: Start difference. First operand 19391 states and 26245 transitions. Second operand has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 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-15 23:33:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:33:58,032 INFO L93 Difference]: Finished difference Result 43679 states and 63295 transitions. [2023-12-15 23:33:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 23:33:58,032 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 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 80 [2023-12-15 23:33:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:33:58,078 INFO L225 Difference]: With dead ends: 43679 [2023-12-15 23:33:58,078 INFO L226 Difference]: Without dead ends: 43675 [2023-12-15 23:33:58,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2023-12-15 23:33:58,090 INFO L413 NwaCegarLoop]: 4025 mSDtfsCounter, 24091 mSDsluCounter, 20868 mSDsCounter, 0 mSdLazyCounter, 3755 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24091 SdHoareTripleChecker+Valid, 24893 SdHoareTripleChecker+Invalid, 3778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 3755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-15 23:33:58,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24091 Valid, 24893 Invalid, 3778 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 3755 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-15 23:33:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43675 states. [2023-12-15 23:33:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43675 to 19387. [2023-12-15 23:33:58,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19387 states, 19370 states have (on average 1.3547237996902426) internal successors, (26241), 19386 states have internal predecessors, (26241), 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-15 23:33:58,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19387 states to 19387 states and 26241 transitions. [2023-12-15 23:33:58,434 INFO L78 Accepts]: Start accepts. Automaton has 19387 states and 26241 transitions. Word has length 80 [2023-12-15 23:33:58,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:33:58,434 INFO L495 AbstractCegarLoop]: Abstraction has 19387 states and 26241 transitions. [2023-12-15 23:33:58,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.666666666666667) internal successors, (80), 11 states have internal predecessors, (80), 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-15 23:33:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 19387 states and 26241 transitions. [2023-12-15 23:33:58,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-15 23:33:58,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:33:58,444 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] [2023-12-15 23:33:58,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 23:33:58,445 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:33:58,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:33:58,445 INFO L85 PathProgramCache]: Analyzing trace with hash 465400969, now seen corresponding path program 1 times [2023-12-15 23:33:58,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:33:58,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796857385] [2023-12-15 23:33:58,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:33:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:33:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:33:58,687 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-15 23:33:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:33:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796857385] [2023-12-15 23:33:58,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796857385] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:33:58,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:33:58,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 23:33:58,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861177365] [2023-12-15 23:33:58,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:33:58,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 23:33:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:33:58,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 23:33:58,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 23:33:58,689 INFO L87 Difference]: Start difference. First operand 19387 states and 26241 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 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-15 23:34:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:34:02,115 INFO L93 Difference]: Finished difference Result 24695 states and 33635 transitions. [2023-12-15 23:34:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:34:02,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 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 80 [2023-12-15 23:34:02,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:34:02,146 INFO L225 Difference]: With dead ends: 24695 [2023-12-15 23:34:02,147 INFO L226 Difference]: Without dead ends: 24687 [2023-12-15 23:34:02,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2023-12-15 23:34:02,157 INFO L413 NwaCegarLoop]: 2055 mSDtfsCounter, 15925 mSDsluCounter, 6555 mSDsCounter, 0 mSdLazyCounter, 8670 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15925 SdHoareTripleChecker+Valid, 8610 SdHoareTripleChecker+Invalid, 8709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 8670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-15 23:34:02,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15925 Valid, 8610 Invalid, 8709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 8670 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-15 23:34:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24687 states. [2023-12-15 23:34:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24687 to 19387. [2023-12-15 23:34:02,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19387 states, 19370 states have (on average 1.3546721734641198) internal successors, (26240), 19386 states have internal predecessors, (26240), 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-15 23:34:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19387 states to 19387 states and 26240 transitions. [2023-12-15 23:34:02,411 INFO L78 Accepts]: Start accepts. Automaton has 19387 states and 26240 transitions. Word has length 80 [2023-12-15 23:34:02,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:34:02,411 INFO L495 AbstractCegarLoop]: Abstraction has 19387 states and 26240 transitions. [2023-12-15 23:34:02,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 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-15 23:34:02,411 INFO L276 IsEmpty]: Start isEmpty. Operand 19387 states and 26240 transitions. [2023-12-15 23:34:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-15 23:34:02,420 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:34:02,420 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] [2023-12-15 23:34:02,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 23:34:02,421 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:34:02,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:34:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash -195949566, now seen corresponding path program 1 times [2023-12-15 23:34:02,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:34:02,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828405469] [2023-12-15 23:34:02,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:34:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:34:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:34:02,683 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-15 23:34:02,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:34:02,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828405469] [2023-12-15 23:34:02,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828405469] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:34:02,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:34:02,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 23:34:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376209149] [2023-12-15 23:34:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:34:02,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 23:34:02,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:34:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 23:34:02,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 23:34:02,684 INFO L87 Difference]: Start difference. First operand 19387 states and 26240 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 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-15 23:34:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 23:34:07,970 INFO L93 Difference]: Finished difference Result 28642 states and 40423 transitions. [2023-12-15 23:34:07,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-15 23:34:07,970 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 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 81 [2023-12-15 23:34:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 23:34:07,997 INFO L225 Difference]: With dead ends: 28642 [2023-12-15 23:34:07,998 INFO L226 Difference]: Without dead ends: 23887 [2023-12-15 23:34:08,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2023-12-15 23:34:08,009 INFO L413 NwaCegarLoop]: 2087 mSDtfsCounter, 15344 mSDsluCounter, 8825 mSDsCounter, 0 mSdLazyCounter, 11762 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15344 SdHoareTripleChecker+Valid, 10912 SdHoareTripleChecker+Invalid, 11768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-15 23:34:08,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15344 Valid, 10912 Invalid, 11768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 11762 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-12-15 23:34:08,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23887 states. [2023-12-15 23:34:08,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23887 to 19136. [2023-12-15 23:34:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19136 states, 19119 states have (on average 1.3560332653381453) internal successors, (25926), 19135 states have internal predecessors, (25926), 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-15 23:34:08,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19136 states to 19136 states and 25926 transitions. [2023-12-15 23:34:08,269 INFO L78 Accepts]: Start accepts. Automaton has 19136 states and 25926 transitions. Word has length 81 [2023-12-15 23:34:08,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 23:34:08,270 INFO L495 AbstractCegarLoop]: Abstraction has 19136 states and 25926 transitions. [2023-12-15 23:34:08,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 8 states have internal predecessors, (81), 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-15 23:34:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 19136 states and 25926 transitions. [2023-12-15 23:34:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-15 23:34:08,279 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 23:34:08,279 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] [2023-12-15 23:34:08,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 23:34:08,280 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 16 more)] === [2023-12-15 23:34:08,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 23:34:08,280 INFO L85 PathProgramCache]: Analyzing trace with hash 544903916, now seen corresponding path program 1 times [2023-12-15 23:34:08,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 23:34:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482774004] [2023-12-15 23:34:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 23:34:08,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 23:34:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 23:34:08,733 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-15 23:34:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 23:34:08,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482774004] [2023-12-15 23:34:08,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482774004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 23:34:08,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 23:34:08,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-15 23:34:08,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264186623] [2023-12-15 23:34:08,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 23:34:08,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 23:34:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 23:34:08,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 23:34:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-15 23:34:08,735 INFO L87 Difference]: Start difference. First operand 19136 states and 25926 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 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-15 23:34:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 23:34:09,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-12-15 23:34:09,710 INFO L413 NwaCegarLoop]: 1932 mSDtfsCounter, 11749 mSDsluCounter, 7270 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11749 SdHoareTripleChecker+Valid, 9202 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-15 23:34:09,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11749 Valid, 9202 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-15 23:34:09,711 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (18 of 19 remaining) [2023-12-15 23:34:09,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 23:34:09,712 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). [2023-12-15 23:34:09,713 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 19 remaining) [2023-12-15 23:34:09,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (16 of 19 remaining) [2023-12-15 23:34:09,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (15 of 19 remaining) [2023-12-15 23:34:09,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (14 of 19 remaining) [2023-12-15 23:34:09,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (13 of 19 remaining) [2023-12-15 23:34:09,714 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (12 of 19 remaining) [2023-12-15 23:34:09,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (11 of 19 remaining) [2023-12-15 23:34:09,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (10 of 19 remaining) [2023-12-15 23:34:09,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (9 of 19 remaining) [2023-12-15 23:34:09,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (8 of 19 remaining) [2023-12-15 23:34:09,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (7 of 19 remaining) [2023-12-15 23:34:09,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (6 of 19 remaining) [2023-12-15 23:34:09,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (5 of 19 remaining) [2023-12-15 23:34:09,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (4 of 19 remaining) [2023-12-15 23:34:09,715 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (3 of 19 remaining) [2023-12-15 23:34:09,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (2 of 19 remaining) [2023-12-15 23:34:09,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (1 of 19 remaining) [2023-12-15 23:34:09,716 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (0 of 19 remaining) [2023-12-15 23:34:09,718 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 23:34:09,720 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 23:34:09,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 11:34:09 BoogieIcfgContainer [2023-12-15 23:34:09,721 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 23:34:09,722 INFO L158 Benchmark]: Toolchain (without parser) took 58312.79ms. Allocated memory was 298.8MB in the beginning and 2.8GB in the end (delta: 2.5GB). Free memory was 230.5MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 983.1MB. Max. memory is 8.0GB. [2023-12-15 23:34:09,722 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 172.0MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 23:34:09,722 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2699.22ms. Allocated memory was 298.8MB in the beginning and 498.1MB in the end (delta: 199.2MB). Free memory was 230.5MB in the beginning and 313.8MB in the end (delta: -83.3MB). Peak memory consumption was 157.6MB. Max. memory is 8.0GB. [2023-12-15 23:34:09,722 INFO L158 Benchmark]: Boogie Procedure Inliner took 700.61ms. Allocated memory is still 498.1MB. Free memory was 313.8MB in the beginning and 327.5MB in the end (delta: -13.6MB). Peak memory consumption was 132.6MB. Max. memory is 8.0GB. [2023-12-15 23:34:09,722 INFO L158 Benchmark]: Boogie Preprocessor took 632.37ms. Allocated memory was 498.1MB in the beginning and 1.1GB in the end (delta: 610.3MB). Free memory was 327.5MB in the beginning and 902.6MB in the end (delta: -575.1MB). Peak memory consumption was 84.4MB. Max. memory is 8.0GB. [2023-12-15 23:34:09,722 INFO L158 Benchmark]: RCFGBuilder took 8528.10ms. Allocated memory was 1.1GB in the beginning and 1.7GB in the end (delta: 628.1MB). Free memory was 902.6MB in the beginning and 1.4GB in the end (delta: -472.5MB). Peak memory consumption was 548.8MB. Max. memory is 8.0GB. [2023-12-15 23:34:09,723 INFO L158 Benchmark]: TraceAbstraction took 45747.53ms. Allocated memory was 1.7GB in the beginning and 2.8GB in the end (delta: 1.1GB). Free memory was 1.4GB in the beginning and 1.8GB in the end (delta: -376.0MB). Peak memory consumption was 689.9MB. Max. memory is 8.0GB. [2023-12-15 23:34:09,724 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.43ms. Allocated memory is still 172.0MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 2699.22ms. Allocated memory was 298.8MB in the beginning and 498.1MB in the end (delta: 199.2MB). Free memory was 230.5MB in the beginning and 313.8MB in the end (delta: -83.3MB). Peak memory consumption was 157.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 700.61ms. Allocated memory is still 498.1MB. Free memory was 313.8MB in the beginning and 327.5MB in the end (delta: -13.6MB). Peak memory consumption was 132.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 632.37ms. Allocated memory was 498.1MB in the beginning and 1.1GB in the end (delta: 610.3MB). Free memory was 327.5MB in the beginning and 902.6MB in the end (delta: -575.1MB). Peak memory consumption was 84.4MB. Max. memory is 8.0GB. * RCFGBuilder took 8528.10ms. Allocated memory was 1.1GB in the beginning and 1.7GB in the end (delta: 628.1MB). Free memory was 902.6MB in the beginning and 1.4GB in the end (delta: -472.5MB). Peak memory consumption was 548.8MB. Max. memory is 8.0GB. * TraceAbstraction took 45747.53ms. Allocated memory was 1.7GB in the beginning and 2.8GB in the end (delta: 1.1GB). Free memory was 1.4GB in the beginning and 1.8GB in the end (delta: -376.0MB). Peak memory consumption was 689.9MB. 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: 9221]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 9221). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 6663]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 6663). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 13646]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 13646). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 16280]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16280). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 16980]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16980). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 17140]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17140). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 18475]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 18475). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 19061]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19061). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 21371]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 21371). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 23641]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 23641). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 30509]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 30509). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 32035]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 32035). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 33586]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 33586). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 34171]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 34171). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 34454]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 34454). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 35666]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 35666). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 36851]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 36851). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 39477]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 39477). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 46781]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 46781). Cancelled while NwaCegarLoop was constructing difference of abstraction (19136states) and FLOYD_HOARE automaton (currently 12 states, 12 states before enhancement),while ReachableStatesComputation was computing reachable states (3701 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6181 locations, 19 error locations. Started 1 CEGAR loops. OverallTime: 45.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 233910 SdHoareTripleChecker+Valid, 34.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 233910 mSDsluCounter, 129183 SdHoareTripleChecker+Invalid, 28.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90808 mSDsCounter, 580 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 76178 IncrementalHoareTripleChecker+Invalid, 76758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 580 mSolverCounterUnsat, 38375 mSDtfsCounter, 76178 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19391occurred in iteration=9, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 49639 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1025 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1012 ConstructedInterpolants, 0 QuantifiedInterpolants, 8481 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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