./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe016_power.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe016_power.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 02:01:26,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 02:01:26,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 02:01:26,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 02:01:26,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 02:01:26,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 02:01:26,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 02:01:26,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 02:01:26,473 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 02:01:26,476 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 02:01:26,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 02:01:26,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 02:01:26,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 02:01:26,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 02:01:26,478 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 02:01:26,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 02:01:26,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 02:01:26,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 02:01:26,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 02:01:26,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 02:01:26,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 02:01:26,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 02:01:26,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 02:01:26,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 02:01:26,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 02:01:26,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 02:01:26,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 02:01:26,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 02:01:26,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 02:01:26,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 02:01:26,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 02:01:26,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 02:01:26,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:01:26,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 02:01:26,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 02:01:26,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 02:01:26,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 02:01:26,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 02:01:26,483 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 02:01:26,483 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 02:01:26,483 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 02:01:26,483 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 02:01:26,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 02:01:26,484 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-28 02:01:26,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 02:01:26,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 02:01:26,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 02:01:26,726 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 02:01:26,726 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 02:01:26,727 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/safe016_power.oepc.yml/witness.yml [2024-06-28 02:01:26,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 02:01:26,968 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 02:01:26,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2024-06-28 02:01:27,924 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 02:01:28,133 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 02:01:28,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i [2024-06-28 02:01:28,146 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3171590/c7306ea7f812409b85c228e357e5f89d/FLAG8be975d31 [2024-06-28 02:01:28,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c3171590/c7306ea7f812409b85c228e357e5f89d [2024-06-28 02:01:28,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 02:01:28,159 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 02:01:28,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 02:01:28,161 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 02:01:28,167 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 02:01:28,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:01:26" (1/2) ... [2024-06-28 02:01:28,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85e1d34 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:01:28, skipping insertion in model container [2024-06-28 02:01:28,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:01:26" (1/2) ... [2024-06-28 02:01:28,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@29f7c960 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 02:01:28, skipping insertion in model container [2024-06-28 02:01:28,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:01:28" (2/2) ... [2024-06-28 02:01:28,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@85e1d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28, skipping insertion in model container [2024-06-28 02:01:28,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 02:01:28" (2/2) ... [2024-06-28 02:01:28,173 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 02:01:28,310 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 02:01:28,311 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] (((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0) [2024-06-28 02:01:28,311 INFO L97 edCorrectnessWitness]: Location invariant before [L857-L857] (((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0) [2024-06-28 02:01:28,311 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] (((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0) [2024-06-28 02:01:28,311 INFO L97 edCorrectnessWitness]: Location invariant before [L860-L860] (((((((((((((((((((((((((((((((((((((((! multithreaded || y$w_buff1_used == (_Bool)0) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || y$w_buff1 == 0)) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$w_buff0 == 0)) && (! multithreaded || y$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2))))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && __unbuffered_p0_EAX$flush_delayed == (_Bool)0) && __unbuffered_p0_EAX$mem_tmp == 0) && __unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff0_thd4 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0) && __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0) && __unbuffered_p0_EAX$w_buff0 == 0) && __unbuffered_p0_EAX$w_buff0_used == (_Bool)0) && __unbuffered_p0_EAX$w_buff1 == 0) && __unbuffered_p0_EAX$w_buff1_used == (_Bool)0) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff0_thd4 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$r_buff1_thd4 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 == 0) && y$w_buff0_used == (_Bool)0) && y$w_buff1 == 0) && y$w_buff1_used == (_Bool)0) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && ((*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1) || *__unbuffered_p0_EAX$read_delayed_var == 2)))) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1 == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$mem_tmp == 0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff1_thd4 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || __unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || __unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (! multithreaded || ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2))) && (! multithreaded || ((y == 0 || y == 1) || y == 2))) && (! multithreaded || __unbuffered_p0_EAX$w_buff0 == 0)) && (! multithreaded || ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2))) && (! multithreaded || y$r_buff0_thd4 == (_Bool)0)) && (! multithreaded || y$w_buff0_used == (_Bool)0) [2024-06-28 02:01:28,312 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 02:01:28,312 INFO L106 edCorrectnessWitness]: ghost_update [L853-L853] multithreaded = 1; [2024-06-28 02:01:28,354 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 02:01:28,505 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i[995,1008] [2024-06-28 02:01:28,665 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:01:28,672 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-28 02:01:28,712 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.oepc.i[995,1008] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 02:01:28,842 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 02:01:28,880 INFO L206 MainTranslator]: Completed translation [2024-06-28 02:01:28,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28 WrapperNode [2024-06-28 02:01:28,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 02:01:28,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 02:01:28,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 02:01:28,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 02:01:28,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:28,918 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:28,947 INFO L138 Inliner]: procedures = 176, calls = 119, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 329 [2024-06-28 02:01:28,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 02:01:28,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 02:01:28,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 02:01:28,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 02:01:28,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:28,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:28,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:29,000 INFO L175 MemorySlicer]: Split 74 memory accesses to 2 slices as follows [2, 72]. 97 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-06-28 02:01:29,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:29,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:29,018 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:29,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:29,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:29,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:29,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 02:01:29,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 02:01:29,052 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 02:01:29,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 02:01:29,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (1/1) ... [2024-06-28 02:01:29,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 02:01:29,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 02:01:29,077 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) [2024-06-28 02:01:29,100 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 [2024-06-28 02:01:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 02:01:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 02:01:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 02:01:29,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 02:01:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 02:01:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 02:01:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-28 02:01:29,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-28 02:01:29,112 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-28 02:01:29,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-28 02:01:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-28 02:01:29,113 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-28 02:01:29,113 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-28 02:01:29,114 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-28 02:01:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 02:01:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 02:01:29,114 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 02:01:29,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 02:01:29,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 02:01:29,116 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 02:01:29,274 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 02:01:29,276 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 02:01:29,818 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 02:01:29,818 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 02:01:30,291 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 02:01:30,292 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-28 02:01:30,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:01:30 BoogieIcfgContainer [2024-06-28 02:01:30,292 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 02:01:30,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 02:01:30,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 02:01:30,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 02:01:30,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 02:01:26" (1/4) ... [2024-06-28 02:01:30,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3632d008 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 02:01:30, skipping insertion in model container [2024-06-28 02:01:30,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 02:01:28" (2/4) ... [2024-06-28 02:01:30,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3632d008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:01:30, skipping insertion in model container [2024-06-28 02:01:30,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 02:01:28" (3/4) ... [2024-06-28 02:01:30,301 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3632d008 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 02:01:30, skipping insertion in model container [2024-06-28 02:01:30,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 02:01:30" (4/4) ... [2024-06-28 02:01:30,302 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.oepc.i [2024-06-28 02:01:30,316 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 02:01:30,316 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-28 02:01:30,316 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 02:01:30,407 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 02:01:30,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 57 transitions, 130 flow [2024-06-28 02:01:30,469 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2024-06-28 02:01:30,469 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:01:30,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 53 events. 1/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2024-06-28 02:01:30,472 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 57 transitions, 130 flow [2024-06-28 02:01:30,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 50 transitions, 112 flow [2024-06-28 02:01:30,485 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 02:01:30,492 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=false, 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;@4a3d8a85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 02:01:30,492 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-28 02:01:30,496 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 02:01:30,496 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 02:01:30,497 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 02:01:30,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:01:30,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 02:01:30,498 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:01:30,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:01:30,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1002784504, now seen corresponding path program 1 times [2024-06-28 02:01:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:01:30,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939588287] [2024-06-28 02:01:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:01:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:01:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:01:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:01:32,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:01:32,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939588287] [2024-06-28 02:01:32,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939588287] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:01:32,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:01:32,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 02:01:32,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640147435] [2024-06-28 02:01:32,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:01:32,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 02:01:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:01:32,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 02:01:32,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 02:01:32,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-28 02:01:32,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-06-28 02:01:32,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:01:32,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-28 02:01:32,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:01:35,958 INFO L124 PetriNetUnfolderBase]: 15016/21237 cut-off events. [2024-06-28 02:01:35,958 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-06-28 02:01:35,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41633 conditions, 21237 events. 15016/21237 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 848. Compared 129114 event pairs, 10750 based on Foata normal form. 0/20609 useless extension candidates. Maximal degree in co-relation 41620. Up to 20120 conditions per place. [2024-06-28 02:01:36,077 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 56 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2024-06-28 02:01:36,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 289 flow [2024-06-28 02:01:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 02:01:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 02:01:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2024-06-28 02:01:36,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2024-06-28 02:01:36,087 INFO L175 Difference]: Start difference. First operand has 63 places, 50 transitions, 112 flow. Second operand 3 states and 111 transitions. [2024-06-28 02:01:36,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 289 flow [2024-06-28 02:01:36,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 72 transitions, 282 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 02:01:36,092 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 154 flow [2024-06-28 02:01:36,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2024-06-28 02:01:36,096 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, -1 predicate places. [2024-06-28 02:01:36,096 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 154 flow [2024-06-28 02:01:36,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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) [2024-06-28 02:01:36,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:01:36,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:01:36,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 02:01:36,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:01:36,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:01:36,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1603312663, now seen corresponding path program 1 times [2024-06-28 02:01:36,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:01:36,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807524670] [2024-06-28 02:01:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:01:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:01:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:01:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:01:38,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:01:38,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807524670] [2024-06-28 02:01:38,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807524670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:01:38,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:01:38,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 02:01:38,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767855401] [2024-06-28 02:01:38,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:01:38,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 02:01:38,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:01:38,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 02:01:38,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 02:01:38,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 57 [2024-06-28 02:01:38,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-06-28 02:01:38,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:01:38,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 57 [2024-06-28 02:01:38,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:01:42,084 INFO L124 PetriNetUnfolderBase]: 15006/20430 cut-off events. [2024-06-28 02:01:42,084 INFO L125 PetriNetUnfolderBase]: For 3705/3715 co-relation queries the response was YES. [2024-06-28 02:01:42,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46161 conditions, 20430 events. 15006/20430 cut-off events. For 3705/3715 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 115757 event pairs, 8671 based on Foata normal form. 7/20432 useless extension candidates. Maximal degree in co-relation 46149. Up to 20065 conditions per place. [2024-06-28 02:01:42,200 INFO L140 encePairwiseOnDemand]: 47/57 looper letters, 77 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2024-06-28 02:01:42,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 100 transitions, 452 flow [2024-06-28 02:01:42,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 02:01:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 02:01:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2024-06-28 02:01:42,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6578947368421053 [2024-06-28 02:01:42,208 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 154 flow. Second operand 4 states and 150 transitions. [2024-06-28 02:01:42,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 100 transitions, 452 flow [2024-06-28 02:01:42,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 100 transitions, 446 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 02:01:42,212 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 237 flow [2024-06-28 02:01:42,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-06-28 02:01:42,213 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 3 predicate places. [2024-06-28 02:01:42,213 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 237 flow [2024-06-28 02:01:42,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) [2024-06-28 02:01:42,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:01:42,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:01:42,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 02:01:42,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:01:42,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:01:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1836912481, now seen corresponding path program 1 times [2024-06-28 02:01:42,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:01:42,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682985333] [2024-06-28 02:01:42,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:01:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:01:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:01:44,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:01:44,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:01:44,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682985333] [2024-06-28 02:01:44,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682985333] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:01:44,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:01:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 02:01:44,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85181121] [2024-06-28 02:01:44,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:01:44,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 02:01:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:01:44,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 02:01:44,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 02:01:44,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2024-06-28 02:01:44,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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) [2024-06-28 02:01:44,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:01:44,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2024-06-28 02:01:44,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:01:48,509 INFO L124 PetriNetUnfolderBase]: 18209/24511 cut-off events. [2024-06-28 02:01:48,509 INFO L125 PetriNetUnfolderBase]: For 14144/14144 co-relation queries the response was YES. [2024-06-28 02:01:48,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62229 conditions, 24511 events. 18209/24511 cut-off events. For 14144/14144 co-relation queries the response was YES. Maximal size of possible extension queue 887. Compared 137017 event pairs, 7737 based on Foata normal form. 7/24511 useless extension candidates. Maximal degree in co-relation 62214. Up to 24085 conditions per place. [2024-06-28 02:01:48,636 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 120 selfloop transitions, 21 changer transitions 0/150 dead transitions. [2024-06-28 02:01:48,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 150 transitions, 810 flow [2024-06-28 02:01:48,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:01:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:01:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 194 transitions. [2024-06-28 02:01:48,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6807017543859649 [2024-06-28 02:01:48,639 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 237 flow. Second operand 5 states and 194 transitions. [2024-06-28 02:01:48,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 150 transitions, 810 flow [2024-06-28 02:01:48,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 150 transitions, 810 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-28 02:01:48,667 INFO L231 Difference]: Finished difference. Result has 73 places, 83 transitions, 432 flow [2024-06-28 02:01:48,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=73, PETRI_TRANSITIONS=83} [2024-06-28 02:01:48,668 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 10 predicate places. [2024-06-28 02:01:48,668 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 83 transitions, 432 flow [2024-06-28 02:01:48,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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) [2024-06-28 02:01:48,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:01:48,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:01:48,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 02:01:48,669 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:01:48,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:01:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash -41253986, now seen corresponding path program 1 times [2024-06-28 02:01:48,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:01:48,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132933460] [2024-06-28 02:01:48,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:01:48,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:01:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:01:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:01:51,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:01:51,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132933460] [2024-06-28 02:01:51,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132933460] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:01:51,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:01:51,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:01:51,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162737879] [2024-06-28 02:01:51,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:01:51,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:01:51,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:01:51,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:01:51,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:01:51,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2024-06-28 02:01:51,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 83 transitions, 432 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2024-06-28 02:01:51,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:01:51,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2024-06-28 02:01:51,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:01:55,692 INFO L124 PetriNetUnfolderBase]: 18535/24981 cut-off events. [2024-06-28 02:01:55,692 INFO L125 PetriNetUnfolderBase]: For 30856/30856 co-relation queries the response was YES. [2024-06-28 02:01:55,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73445 conditions, 24981 events. 18535/24981 cut-off events. For 30856/30856 co-relation queries the response was YES. Maximal size of possible extension queue 898. Compared 140711 event pairs, 5896 based on Foata normal form. 32/25006 useless extension candidates. Maximal degree in co-relation 73425. Up to 24129 conditions per place. [2024-06-28 02:01:55,802 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 138 selfloop transitions, 24 changer transitions 0/171 dead transitions. [2024-06-28 02:01:55,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 171 transitions, 1027 flow [2024-06-28 02:01:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:01:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:01:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 229 transitions. [2024-06-28 02:01:55,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6695906432748538 [2024-06-28 02:01:55,804 INFO L175 Difference]: Start difference. First operand has 73 places, 83 transitions, 432 flow. Second operand 6 states and 229 transitions. [2024-06-28 02:01:55,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 171 transitions, 1027 flow [2024-06-28 02:01:55,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 171 transitions, 1023 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-28 02:01:55,824 INFO L231 Difference]: Finished difference. Result has 78 places, 85 transitions, 505 flow [2024-06-28 02:01:55,824 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=505, PETRI_PLACES=78, PETRI_TRANSITIONS=85} [2024-06-28 02:01:55,825 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 15 predicate places. [2024-06-28 02:01:55,825 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 85 transitions, 505 flow [2024-06-28 02:01:55,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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) [2024-06-28 02:01:55,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:01:55,825 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:01:55,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 02:01:55,826 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:01:55,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:01:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash -618056913, now seen corresponding path program 1 times [2024-06-28 02:01:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:01:55,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800641822] [2024-06-28 02:01:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:01:55,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:01:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:01:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:01:57,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:01:57,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800641822] [2024-06-28 02:01:57,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800641822] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:01:57,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:01:57,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 02:01:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516969347] [2024-06-28 02:01:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:01:57,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 02:01:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:01:57,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 02:01:57,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-28 02:01:57,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:01:57,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 85 transitions, 505 flow. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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) [2024-06-28 02:01:57,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:01:57,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:01:57,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:01,459 INFO L124 PetriNetUnfolderBase]: 18526/26124 cut-off events. [2024-06-28 02:02:01,459 INFO L125 PetriNetUnfolderBase]: For 42450/42450 co-relation queries the response was YES. [2024-06-28 02:02:01,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79393 conditions, 26124 events. 18526/26124 cut-off events. For 42450/42450 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 159564 event pairs, 8356 based on Foata normal form. 3/26123 useless extension candidates. Maximal degree in co-relation 79369. Up to 24751 conditions per place. [2024-06-28 02:02:01,600 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 103 selfloop transitions, 12 changer transitions 0/123 dead transitions. [2024-06-28 02:02:01,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 123 transitions, 864 flow [2024-06-28 02:02:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:02:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:02:01,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 149 transitions. [2024-06-28 02:02:01,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5228070175438596 [2024-06-28 02:02:01,603 INFO L175 Difference]: Start difference. First operand has 78 places, 85 transitions, 505 flow. Second operand 5 states and 149 transitions. [2024-06-28 02:02:01,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 123 transitions, 864 flow [2024-06-28 02:02:01,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 123 transitions, 805 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-28 02:02:01,622 INFO L231 Difference]: Finished difference. Result has 80 places, 93 transitions, 561 flow [2024-06-28 02:02:01,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=561, PETRI_PLACES=80, PETRI_TRANSITIONS=93} [2024-06-28 02:02:01,623 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 17 predicate places. [2024-06-28 02:02:01,623 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 93 transitions, 561 flow [2024-06-28 02:02:01,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 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) [2024-06-28 02:02:01,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:01,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:01,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 02:02:01,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:01,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:01,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1594013098, now seen corresponding path program 1 times [2024-06-28 02:02:01,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:01,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587071098] [2024-06-28 02:02:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:01,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:04,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:04,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587071098] [2024-06-28 02:02:04,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587071098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:04,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:04,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:02:04,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277462083] [2024-06-28 02:02:04,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:04,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:02:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:04,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:02:04,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:02:04,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:02:04,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 93 transitions, 561 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:04,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:04,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:02:04,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:08,517 INFO L124 PetriNetUnfolderBase]: 18568/25206 cut-off events. [2024-06-28 02:02:08,517 INFO L125 PetriNetUnfolderBase]: For 45930/45930 co-relation queries the response was YES. [2024-06-28 02:02:08,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79452 conditions, 25206 events. 18568/25206 cut-off events. For 45930/45930 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 143898 event pairs, 7373 based on Foata normal form. 6/25205 useless extension candidates. Maximal degree in co-relation 79425. Up to 24576 conditions per place. [2024-06-28 02:02:08,641 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 116 selfloop transitions, 30 changer transitions 0/154 dead transitions. [2024-06-28 02:02:08,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 154 transitions, 1058 flow [2024-06-28 02:02:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:02:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:02:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 194 transitions. [2024-06-28 02:02:08,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5672514619883041 [2024-06-28 02:02:08,643 INFO L175 Difference]: Start difference. First operand has 80 places, 93 transitions, 561 flow. Second operand 6 states and 194 transitions. [2024-06-28 02:02:08,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 154 transitions, 1058 flow [2024-06-28 02:02:08,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 154 transitions, 1046 flow, removed 5 selfloop flow, removed 1 redundant places. [2024-06-28 02:02:08,686 INFO L231 Difference]: Finished difference. Result has 86 places, 98 transitions, 675 flow [2024-06-28 02:02:08,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=675, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2024-06-28 02:02:08,688 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 23 predicate places. [2024-06-28 02:02:08,688 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 675 flow [2024-06-28 02:02:08,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:08,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:08,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:08,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 02:02:08,689 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:08,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:08,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1246284142, now seen corresponding path program 2 times [2024-06-28 02:02:08,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:08,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849984217] [2024-06-28 02:02:08,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:08,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:08,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:11,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:11,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849984217] [2024-06-28 02:02:11,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849984217] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:11,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:11,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:02:11,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660942574] [2024-06-28 02:02:11,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:11,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:02:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:11,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:02:11,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:02:11,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:02:11,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 675 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:11,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:11,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:02:11,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:14,988 INFO L124 PetriNetUnfolderBase]: 18523/25120 cut-off events. [2024-06-28 02:02:14,988 INFO L125 PetriNetUnfolderBase]: For 51107/51107 co-relation queries the response was YES. [2024-06-28 02:02:15,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80523 conditions, 25120 events. 18523/25120 cut-off events. For 51107/51107 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 143002 event pairs, 7401 based on Foata normal form. 3/25110 useless extension candidates. Maximal degree in co-relation 80492. Up to 24507 conditions per place. [2024-06-28 02:02:15,183 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 109 selfloop transitions, 33 changer transitions 0/150 dead transitions. [2024-06-28 02:02:15,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 150 transitions, 1107 flow [2024-06-28 02:02:15,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:02:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:02:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions. [2024-06-28 02:02:15,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5497076023391813 [2024-06-28 02:02:15,185 INFO L175 Difference]: Start difference. First operand has 86 places, 98 transitions, 675 flow. Second operand 6 states and 188 transitions. [2024-06-28 02:02:15,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 150 transitions, 1107 flow [2024-06-28 02:02:15,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 150 transitions, 1062 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-28 02:02:15,225 INFO L231 Difference]: Finished difference. Result has 90 places, 101 transitions, 751 flow [2024-06-28 02:02:15,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=751, PETRI_PLACES=90, PETRI_TRANSITIONS=101} [2024-06-28 02:02:15,227 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 27 predicate places. [2024-06-28 02:02:15,227 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 101 transitions, 751 flow [2024-06-28 02:02:15,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:15,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:15,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:15,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 02:02:15,227 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:15,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2017355500, now seen corresponding path program 1 times [2024-06-28 02:02:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:15,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310179976] [2024-06-28 02:02:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:15,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:17,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310179976] [2024-06-28 02:02:17,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310179976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:17,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:17,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:02:17,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53901734] [2024-06-28 02:02:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:17,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:02:17,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:17,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:02:17,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:02:17,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:02:17,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 101 transitions, 751 flow. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:17,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:17,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:02:17,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:21,005 INFO L124 PetriNetUnfolderBase]: 18508/26082 cut-off events. [2024-06-28 02:02:21,005 INFO L125 PetriNetUnfolderBase]: For 55426/55426 co-relation queries the response was YES. [2024-06-28 02:02:21,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82400 conditions, 26082 events. 18508/26082 cut-off events. For 55426/55426 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 158752 event pairs, 7963 based on Foata normal form. 6/26084 useless extension candidates. Maximal degree in co-relation 82367. Up to 24656 conditions per place. [2024-06-28 02:02:21,213 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 125 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2024-06-28 02:02:21,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 149 transitions, 1165 flow [2024-06-28 02:02:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:02:21,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:02:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-28 02:02:21,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2024-06-28 02:02:21,216 INFO L175 Difference]: Start difference. First operand has 90 places, 101 transitions, 751 flow. Second operand 6 states and 180 transitions. [2024-06-28 02:02:21,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 149 transitions, 1165 flow [2024-06-28 02:02:21,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 149 transitions, 1129 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-06-28 02:02:21,265 INFO L231 Difference]: Finished difference. Result has 94 places, 105 transitions, 796 flow [2024-06-28 02:02:21,266 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=796, PETRI_PLACES=94, PETRI_TRANSITIONS=105} [2024-06-28 02:02:21,268 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 31 predicate places. [2024-06-28 02:02:21,268 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 105 transitions, 796 flow [2024-06-28 02:02:21,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:02:21,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:21,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:21,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 02:02:21,269 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:21,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:21,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1456672055, now seen corresponding path program 1 times [2024-06-28 02:02:21,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:21,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971529937] [2024-06-28 02:02:21,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:21,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:24,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:24,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971529937] [2024-06-28 02:02:24,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971529937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:24,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:24,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:02:24,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97354297] [2024-06-28 02:02:24,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:24,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:02:24,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:24,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:02:24,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:02:24,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:02:24,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 105 transitions, 796 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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) [2024-06-28 02:02:24,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:24,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:02:24,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:28,825 INFO L124 PetriNetUnfolderBase]: 18906/25681 cut-off events. [2024-06-28 02:02:28,825 INFO L125 PetriNetUnfolderBase]: For 73140/73140 co-relation queries the response was YES. [2024-06-28 02:02:28,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87684 conditions, 25681 events. 18906/25681 cut-off events. For 73140/73140 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 146742 event pairs, 7128 based on Foata normal form. 30/25704 useless extension candidates. Maximal degree in co-relation 87649. Up to 24670 conditions per place. [2024-06-28 02:02:28,976 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 136 selfloop transitions, 35 changer transitions 0/179 dead transitions. [2024-06-28 02:02:28,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 179 transitions, 1348 flow [2024-06-28 02:02:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:02:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:02:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 226 transitions. [2024-06-28 02:02:28,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5664160401002506 [2024-06-28 02:02:28,981 INFO L175 Difference]: Start difference. First operand has 94 places, 105 transitions, 796 flow. Second operand 7 states and 226 transitions. [2024-06-28 02:02:28,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 179 transitions, 1348 flow [2024-06-28 02:02:29,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 179 transitions, 1299 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-28 02:02:29,042 INFO L231 Difference]: Finished difference. Result has 97 places, 108 transitions, 860 flow [2024-06-28 02:02:29,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=860, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2024-06-28 02:02:29,042 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 34 predicate places. [2024-06-28 02:02:29,043 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 860 flow [2024-06-28 02:02:29,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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) [2024-06-28 02:02:29,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:29,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:29,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-28 02:02:29,043 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:29,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:29,044 INFO L85 PathProgramCache]: Analyzing trace with hash 616880561, now seen corresponding path program 2 times [2024-06-28 02:02:29,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:29,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819524511] [2024-06-28 02:02:29,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:29,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:32,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:32,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:32,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819524511] [2024-06-28 02:02:32,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819524511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:32,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:32,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:02:32,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71859459] [2024-06-28 02:02:32,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:32,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:02:32,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:32,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:02:32,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:02:32,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:02:32,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 860 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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) [2024-06-28 02:02:32,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:32,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:02:32,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:36,700 INFO L124 PetriNetUnfolderBase]: 18992/25811 cut-off events. [2024-06-28 02:02:36,700 INFO L125 PetriNetUnfolderBase]: For 88880/88880 co-relation queries the response was YES. [2024-06-28 02:02:36,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92471 conditions, 25811 events. 18992/25811 cut-off events. For 88880/88880 co-relation queries the response was YES. Maximal size of possible extension queue 920. Compared 147256 event pairs, 7234 based on Foata normal form. 6/25804 useless extension candidates. Maximal degree in co-relation 92435. Up to 25100 conditions per place. [2024-06-28 02:02:36,849 INFO L140 encePairwiseOnDemand]: 45/57 looper letters, 132 selfloop transitions, 36 changer transitions 0/176 dead transitions. [2024-06-28 02:02:36,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 176 transitions, 1400 flow [2024-06-28 02:02:36,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:02:36,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:02:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 220 transitions. [2024-06-28 02:02:36,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5513784461152882 [2024-06-28 02:02:36,851 INFO L175 Difference]: Start difference. First operand has 97 places, 108 transitions, 860 flow. Second operand 7 states and 220 transitions. [2024-06-28 02:02:36,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 176 transitions, 1400 flow [2024-06-28 02:02:36,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 176 transitions, 1325 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-28 02:02:36,907 INFO L231 Difference]: Finished difference. Result has 99 places, 111 transitions, 905 flow [2024-06-28 02:02:36,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=785, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=905, PETRI_PLACES=99, PETRI_TRANSITIONS=111} [2024-06-28 02:02:36,908 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 36 predicate places. [2024-06-28 02:02:36,908 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 111 transitions, 905 flow [2024-06-28 02:02:36,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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) [2024-06-28 02:02:36,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:36,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:36,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-28 02:02:36,908 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:36,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:36,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1648442507, now seen corresponding path program 3 times [2024-06-28 02:02:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:36,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513161555] [2024-06-28 02:02:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:39,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:39,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513161555] [2024-06-28 02:02:39,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513161555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:39,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:39,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:02:39,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698154044] [2024-06-28 02:02:39,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:39,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:02:39,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:39,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:02:39,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:02:39,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:02:39,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 111 transitions, 905 flow. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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) [2024-06-28 02:02:39,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:39,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:02:39,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:44,096 INFO L124 PetriNetUnfolderBase]: 19634/26752 cut-off events. [2024-06-28 02:02:44,096 INFO L125 PetriNetUnfolderBase]: For 111177/111183 co-relation queries the response was YES. [2024-06-28 02:02:44,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99882 conditions, 26752 events. 19634/26752 cut-off events. For 111177/111183 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 153393 event pairs, 6583 based on Foata normal form. 7/26745 useless extension candidates. Maximal degree in co-relation 99845. Up to 25474 conditions per place. [2024-06-28 02:02:44,305 INFO L140 encePairwiseOnDemand]: 44/57 looper letters, 148 selfloop transitions, 48 changer transitions 0/204 dead transitions. [2024-06-28 02:02:44,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 204 transitions, 1776 flow [2024-06-28 02:02:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 02:02:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 02:02:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 238 transitions. [2024-06-28 02:02:44,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5219298245614035 [2024-06-28 02:02:44,309 INFO L175 Difference]: Start difference. First operand has 99 places, 111 transitions, 905 flow. Second operand 8 states and 238 transitions. [2024-06-28 02:02:44,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 204 transitions, 1776 flow [2024-06-28 02:02:44,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 204 transitions, 1662 flow, removed 10 selfloop flow, removed 5 redundant places. [2024-06-28 02:02:44,417 INFO L231 Difference]: Finished difference. Result has 106 places, 135 transitions, 1286 flow [2024-06-28 02:02:44,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1286, PETRI_PLACES=106, PETRI_TRANSITIONS=135} [2024-06-28 02:02:44,418 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 43 predicate places. [2024-06-28 02:02:44,418 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 135 transitions, 1286 flow [2024-06-28 02:02:44,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 8 states have internal predecessors, (116), 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) [2024-06-28 02:02:44,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:44,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:44,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-28 02:02:44,419 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:44,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1670844541, now seen corresponding path program 1 times [2024-06-28 02:02:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:44,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533182649] [2024-06-28 02:02:44,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:47,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:47,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:47,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533182649] [2024-06-28 02:02:47,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533182649] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:47,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:47,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:02:47,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912046395] [2024-06-28 02:02:47,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:47,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:02:47,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:47,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:02:47,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:02:47,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:02:47,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 135 transitions, 1286 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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) [2024-06-28 02:02:47,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:47,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:02:47,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:02:52,182 INFO L124 PetriNetUnfolderBase]: 20024/27329 cut-off events. [2024-06-28 02:02:52,183 INFO L125 PetriNetUnfolderBase]: For 147282/147282 co-relation queries the response was YES. [2024-06-28 02:02:52,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108666 conditions, 27329 events. 20024/27329 cut-off events. For 147282/147282 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 159226 event pairs, 5278 based on Foata normal form. 18/27337 useless extension candidates. Maximal degree in co-relation 108624. Up to 24638 conditions per place. [2024-06-28 02:02:52,421 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 154 selfloop transitions, 53 changer transitions 0/215 dead transitions. [2024-06-28 02:02:52,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 215 transitions, 2028 flow [2024-06-28 02:02:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:02:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:02:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2024-06-28 02:02:52,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5764411027568922 [2024-06-28 02:02:52,423 INFO L175 Difference]: Start difference. First operand has 106 places, 135 transitions, 1286 flow. Second operand 7 states and 230 transitions. [2024-06-28 02:02:52,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 215 transitions, 2028 flow [2024-06-28 02:02:52,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 215 transitions, 1990 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-28 02:02:52,652 INFO L231 Difference]: Finished difference. Result has 112 places, 139 transitions, 1431 flow [2024-06-28 02:02:52,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1431, PETRI_PLACES=112, PETRI_TRANSITIONS=139} [2024-06-28 02:02:53,058 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 49 predicate places. [2024-06-28 02:02:53,058 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 139 transitions, 1431 flow [2024-06-28 02:02:53,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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) [2024-06-28 02:02:53,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:02:53,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:02:53,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-28 02:02:53,059 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:02:53,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:02:53,059 INFO L85 PathProgramCache]: Analyzing trace with hash 901237783, now seen corresponding path program 1 times [2024-06-28 02:02:53,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:02:53,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961270244] [2024-06-28 02:02:53,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:02:53,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:02:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:02:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:02:55,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:02:55,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961270244] [2024-06-28 02:02:55,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961270244] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:02:55,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:02:55,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:02:55,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133664879] [2024-06-28 02:02:55,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:02:55,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:02:55,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:02:55,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:02:55,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:02:55,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:02:55,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 139 transitions, 1431 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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) [2024-06-28 02:02:55,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:02:55,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:02:55,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:00,398 INFO L124 PetriNetUnfolderBase]: 19985/27272 cut-off events. [2024-06-28 02:03:00,399 INFO L125 PetriNetUnfolderBase]: For 170621/170621 co-relation queries the response was YES. [2024-06-28 02:03:00,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111899 conditions, 27272 events. 19985/27272 cut-off events. For 170621/170621 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 158682 event pairs, 5257 based on Foata normal form. 18/27280 useless extension candidates. Maximal degree in co-relation 111854. Up to 24620 conditions per place. [2024-06-28 02:03:00,650 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 149 selfloop transitions, 55 changer transitions 0/212 dead transitions. [2024-06-28 02:03:00,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 212 transitions, 2031 flow [2024-06-28 02:03:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:03:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:03:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 227 transitions. [2024-06-28 02:03:00,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.568922305764411 [2024-06-28 02:03:00,652 INFO L175 Difference]: Start difference. First operand has 112 places, 139 transitions, 1431 flow. Second operand 7 states and 227 transitions. [2024-06-28 02:03:00,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 212 transitions, 2031 flow [2024-06-28 02:03:00,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 212 transitions, 1965 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-28 02:03:00,839 INFO L231 Difference]: Finished difference. Result has 116 places, 139 transitions, 1486 flow [2024-06-28 02:03:00,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1486, PETRI_PLACES=116, PETRI_TRANSITIONS=139} [2024-06-28 02:03:00,839 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 53 predicate places. [2024-06-28 02:03:00,840 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 139 transitions, 1486 flow [2024-06-28 02:03:00,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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) [2024-06-28 02:03:00,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:00,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:00,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-28 02:03:00,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:00,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash -2111793995, now seen corresponding path program 2 times [2024-06-28 02:03:00,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:00,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201231876] [2024-06-28 02:03:00,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:00,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:03,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:03,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201231876] [2024-06-28 02:03:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201231876] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:03,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 02:03:03,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92612877] [2024-06-28 02:03:03,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:03,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 02:03:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 02:03:03,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-28 02:03:03,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:03,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 139 transitions, 1486 flow. Second operand has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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) [2024-06-28 02:03:03,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:03,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:03,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:09,059 INFO L124 PetriNetUnfolderBase]: 19946/27171 cut-off events. [2024-06-28 02:03:09,059 INFO L125 PetriNetUnfolderBase]: For 180571/180595 co-relation queries the response was YES. [2024-06-28 02:03:09,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113069 conditions, 27171 events. 19946/27171 cut-off events. For 180571/180595 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 157190 event pairs, 3942 based on Foata normal form. 23/27157 useless extension candidates. Maximal degree in co-relation 113022. Up to 24189 conditions per place. [2024-06-28 02:03:09,256 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 142 selfloop transitions, 58 changer transitions 0/208 dead transitions. [2024-06-28 02:03:09,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 208 transitions, 2078 flow [2024-06-28 02:03:09,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 02:03:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 02:03:09,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 219 transitions. [2024-06-28 02:03:09,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5488721804511278 [2024-06-28 02:03:09,258 INFO L175 Difference]: Start difference. First operand has 116 places, 139 transitions, 1486 flow. Second operand 7 states and 219 transitions. [2024-06-28 02:03:09,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 208 transitions, 2078 flow [2024-06-28 02:03:09,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 208 transitions, 1937 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-28 02:03:09,418 INFO L231 Difference]: Finished difference. Result has 116 places, 140 transitions, 1480 flow [2024-06-28 02:03:09,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1480, PETRI_PLACES=116, PETRI_TRANSITIONS=140} [2024-06-28 02:03:09,419 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 53 predicate places. [2024-06-28 02:03:09,419 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 140 transitions, 1480 flow [2024-06-28 02:03:09,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.625) internal successors, (117), 8 states have internal predecessors, (117), 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) [2024-06-28 02:03:09,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:09,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:09,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-28 02:03:09,420 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:09,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:09,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1728825908, now seen corresponding path program 1 times [2024-06-28 02:03:09,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:09,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006079574] [2024-06-28 02:03:09,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:09,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:11,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:11,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006079574] [2024-06-28 02:03:11,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006079574] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:11,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:11,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:03:11,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88043925] [2024-06-28 02:03:11,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:11,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:03:11,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:11,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:03:11,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:03:11,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:11,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 140 transitions, 1480 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:11,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:11,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:11,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:16,110 INFO L124 PetriNetUnfolderBase]: 20040/28367 cut-off events. [2024-06-28 02:03:16,111 INFO L125 PetriNetUnfolderBase]: For 193604/193610 co-relation queries the response was YES. [2024-06-28 02:03:16,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116468 conditions, 28367 events. 20040/28367 cut-off events. For 193604/193610 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 173817 event pairs, 8206 based on Foata normal form. 12/28371 useless extension candidates. Maximal degree in co-relation 116420. Up to 26612 conditions per place. [2024-06-28 02:03:16,318 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 153 selfloop transitions, 22 changer transitions 0/183 dead transitions. [2024-06-28 02:03:16,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 183 transitions, 2040 flow [2024-06-28 02:03:16,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 02:03:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 02:03:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2024-06-28 02:03:16,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-06-28 02:03:16,320 INFO L175 Difference]: Start difference. First operand has 116 places, 140 transitions, 1480 flow. Second operand 5 states and 152 transitions. [2024-06-28 02:03:16,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 183 transitions, 2040 flow [2024-06-28 02:03:16,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 183 transitions, 1905 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-28 02:03:16,570 INFO L231 Difference]: Finished difference. Result has 117 places, 152 transitions, 1527 flow [2024-06-28 02:03:16,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1527, PETRI_PLACES=117, PETRI_TRANSITIONS=152} [2024-06-28 02:03:16,571 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 54 predicate places. [2024-06-28 02:03:16,571 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 152 transitions, 1527 flow [2024-06-28 02:03:16,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:16,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:16,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:16,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-28 02:03:16,572 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:16,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2053812802, now seen corresponding path program 1 times [2024-06-28 02:03:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37691254] [2024-06-28 02:03:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:18,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:18,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37691254] [2024-06-28 02:03:18,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37691254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:18,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:18,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:03:18,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356028875] [2024-06-28 02:03:18,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:18,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:03:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:03:18,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:03:18,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:18,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 152 transitions, 1527 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:18,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:18,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:18,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 02:03:23,762 INFO L124 PetriNetUnfolderBase]: 20076/28423 cut-off events. [2024-06-28 02:03:23,763 INFO L125 PetriNetUnfolderBase]: For 215698/215707 co-relation queries the response was YES. [2024-06-28 02:03:23,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122806 conditions, 28423 events. 20076/28423 cut-off events. For 215698/215707 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 175324 event pairs, 8137 based on Foata normal form. 8/28423 useless extension candidates. Maximal degree in co-relation 122756. Up to 26819 conditions per place. [2024-06-28 02:03:23,995 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 167 selfloop transitions, 27 changer transitions 0/202 dead transitions. [2024-06-28 02:03:23,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 202 transitions, 2187 flow [2024-06-28 02:03:23,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 02:03:23,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 02:03:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 178 transitions. [2024-06-28 02:03:23,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.52046783625731 [2024-06-28 02:03:23,999 INFO L175 Difference]: Start difference. First operand has 117 places, 152 transitions, 1527 flow. Second operand 6 states and 178 transitions. [2024-06-28 02:03:23,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 202 transitions, 2187 flow [2024-06-28 02:03:24,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 202 transitions, 2139 flow, removed 23 selfloop flow, removed 1 redundant places. [2024-06-28 02:03:24,296 INFO L231 Difference]: Finished difference. Result has 122 places, 162 transitions, 1673 flow [2024-06-28 02:03:24,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=1479, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1673, PETRI_PLACES=122, PETRI_TRANSITIONS=162} [2024-06-28 02:03:24,297 INFO L281 CegarLoopForPetriNet]: 63 programPoint places, 59 predicate places. [2024-06-28 02:03:24,297 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 162 transitions, 1673 flow [2024-06-28 02:03:24,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:24,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 02:03:24,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 02:03:24,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-28 02:03:24,297 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-06-28 02:03:24,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 02:03:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash -867313854, now seen corresponding path program 2 times [2024-06-28 02:03:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 02:03:24,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136503056] [2024-06-28 02:03:24,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 02:03:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 02:03:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 02:03:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 02:03:26,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 02:03:26,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136503056] [2024-06-28 02:03:26,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136503056] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 02:03:26,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 02:03:26,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 02:03:26,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500150893] [2024-06-28 02:03:26,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 02:03:26,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 02:03:26,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 02:03:26,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 02:03:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-28 02:03:26,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 57 [2024-06-28 02:03:26,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 162 transitions, 1673 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 02:03:26,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 02:03:26,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 57 [2024-06-28 02:03:26,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand