./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/thin002_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-rel/thin002_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/thin002_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/thin002_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-27 22:54:41,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:54:41,826 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:54:41,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:54:41,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:54:41,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:54:41,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:54:41,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:54:41,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:54:41,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:54:41,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:54:41,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:54:41,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:54:41,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:54:41,867 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:54:41,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:54:41,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:54:41,867 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:54:41,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:54:41,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:54:41,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:54:41,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:54:41,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:54:41,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:54:41,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:54:41,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:54:41,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:54:41,869 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:54:41,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:54:41,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:54:41,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:54:41,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:54:41,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:54:41,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:54:41,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:54:41,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:54:41,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:54:41,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:54:41,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:54:41,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:54:41,873 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:54:41,873 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:54:41,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:54:41,873 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-27 22:54:42,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:54:42,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:54:42,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:54:42,111 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:54:42,111 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:54:42,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2024-06-27 22:54:43,097 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:54:43,279 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:54:43,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/thin002_power.oepc.i [2024-06-27 22:54:43,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ecd1b42/38c5d4ad897445a08d377e8534eb8de6/FLAG8300bba4e [2024-06-27 22:54:43,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30ecd1b42/38c5d4ad897445a08d377e8534eb8de6 [2024-06-27 22:54:43,306 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:54:43,306 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:54:43,307 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-rel/thin002_power.oepc.yml/witness.yml [2024-06-27 22:54:43,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:54:43,429 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:54:43,431 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:54:43,431 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:54:43,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:54:43,435 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:54:43" (1/2) ... [2024-06-27 22:54:43,436 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc544e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:43, skipping insertion in model container [2024-06-27 22:54:43,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:54:43" (1/2) ... [2024-06-27 22:54:43,438 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@30972906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:54:43, skipping insertion in model container [2024-06-27 22:54:43,439 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:43" (2/2) ... [2024-06-27 22:54:43,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc544e9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:43, skipping insertion in model container [2024-06-27 22:54:43,440 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:43" (2/2) ... [2024-06-27 22:54:43,440 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:54:43,461 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:54:43,463 INFO L97 edCorrectnessWitness]: Location invariant before [L869-L869] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-27 22:54:43,463 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-27 22:54:43,463 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-27 22:54:43,464 INFO L97 edCorrectnessWitness]: Location invariant before [L868-L868] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p2_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )__unbuffered_p3_EAX >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )x >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )y >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )z >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )a$mem_tmp) + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a$mem_tmp >= 0LL) && (1LL + (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd3) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd4) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )a$w_buff1_used >= 0LL) && (1LL - (long long )a$flush_delayed) - (long long )a$mem_tmp >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff0_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd2 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd3 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$r_buff1_thd4 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$read_delayed >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1 >= 0LL) && (1LL - (long long )a$mem_tmp) - (long long )a$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )a$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )x >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice1 >= 0LL) && (2LL - (long long )a$mem_tmp) - (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )a$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) [2024-06-27 22:54:43,464 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:54:43,465 INFO L106 edCorrectnessWitness]: ghost_update [L862-L862] multithreaded = 1; [2024-06-27 22:54:43,519 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:54:43,693 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/thin002_power.oepc.i[995,1008] [2024-06-27 22:54:43,832 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:54:43,845 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:54:43,872 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/thin002_power.oepc.i[995,1008] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:54:44,056 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:54:44,084 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:54:44,085 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44 WrapperNode [2024-06-27 22:54:44,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:54:44,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:54:44,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:54:44,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:54:44,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,136 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,194 INFO L138 Inliner]: procedures = 176, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 174 [2024-06-27 22:54:44,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:54:44,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:54:44,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:54:44,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:54:44,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,261 INFO L175 MemorySlicer]: Split 25 memory accesses to 2 slices as follows [2, 23]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-27 22:54:44,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,291 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,304 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:54:44,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:54:44,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:54:44,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:54:44,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (1/1) ... [2024-06-27 22:54:44,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:54:44,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:54:44,344 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-27 22:54:44,360 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-27 22:54:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 22:54:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 22:54:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 22:54:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 22:54:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:54:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:54:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:54:44,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:54:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:54:44,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:54:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:54:44,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:54:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 22:54:44,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 22:54:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:54:44,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 22:54:44,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:54:44,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:54:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:54:44,374 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:54:44,499 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:54:44,501 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:54:45,202 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:54:45,202 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:54:45,575 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:54:45,576 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:54:45,576 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:54:45 BoogieIcfgContainer [2024-06-27 22:54:45,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:54:45,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:54:45,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:54:45,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:54:45,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:54:43" (1/4) ... [2024-06-27 22:54:45,581 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c658dd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:54:45, skipping insertion in model container [2024-06-27 22:54:45,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:54:43" (2/4) ... [2024-06-27 22:54:45,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c658dd3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:54:45, skipping insertion in model container [2024-06-27 22:54:45,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:54:44" (3/4) ... [2024-06-27 22:54:45,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c658dd3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:54:45, skipping insertion in model container [2024-06-27 22:54:45,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:54:45" (4/4) ... [2024-06-27 22:54:45,592 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.oepc.i [2024-06-27 22:54:45,607 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:54:45,607 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-06-27 22:54:45,607 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:54:45,686 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:54:45,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 59 transitions, 134 flow [2024-06-27 22:54:45,771 INFO L124 PetriNetUnfolderBase]: 1/55 cut-off events. [2024-06-27 22:54:45,772 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:54:45,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 55 events. 1/55 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2024-06-27 22:54:45,776 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 59 transitions, 134 flow [2024-06-27 22:54:45,780 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 52 transitions, 116 flow [2024-06-27 22:54:45,790 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:54:45,833 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;@1ebd6c35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:54:45,834 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-06-27 22:54:45,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:54:45,844 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-27 22:54:45,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:54:45,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:45,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:54:45,846 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-27 22:54:45,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:45,864 INFO L85 PathProgramCache]: Analyzing trace with hash 643709054, now seen corresponding path program 1 times [2024-06-27 22:54:45,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:45,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318168774] [2024-06-27 22:54:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:45,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:49,163 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-27 22:54:49,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:49,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318168774] [2024-06-27 22:54:49,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318168774] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:49,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:49,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:54:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42543573] [2024-06-27 22:54:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:49,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:54:49,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:49,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:54:49,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:54:49,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-27 22:54:49,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-27 22:54:49,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:49,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-27 22:54:49,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:54:52,343 INFO L124 PetriNetUnfolderBase]: 11846/17104 cut-off events. [2024-06-27 22:54:52,344 INFO L125 PetriNetUnfolderBase]: For 103/103 co-relation queries the response was YES. [2024-06-27 22:54:52,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33290 conditions, 17104 events. 11846/17104 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 764. Compared 107553 event pairs, 8420 based on Foata normal form. 0/16574 useless extension candidates. Maximal degree in co-relation 33277. Up to 15950 conditions per place. [2024-06-27 22:54:52,455 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 55 selfloop transitions, 6 changer transitions 0/74 dead transitions. [2024-06-27 22:54:52,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 291 flow [2024-06-27 22:54:52,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:54:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:54:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-06-27 22:54:52,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.672316384180791 [2024-06-27 22:54:52,467 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 116 flow. Second operand 3 states and 119 transitions. [2024-06-27 22:54:52,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 291 flow [2024-06-27 22:54:52,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 74 transitions, 284 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:54:52,476 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 158 flow [2024-06-27 22:54:52,478 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-06-27 22:54:52,481 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -1 predicate places. [2024-06-27 22:54:52,481 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 158 flow [2024-06-27 22:54:52,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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-27 22:54:52,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:54:52,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:54:52,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:54:52,482 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-27 22:54:52,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:54:52,483 INFO L85 PathProgramCache]: Analyzing trace with hash 130015073, now seen corresponding path program 1 times [2024-06-27 22:54:52,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:54:52,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520584223] [2024-06-27 22:54:52,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:54:52,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:54:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:54:56,848 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-27 22:54:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:54:56,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520584223] [2024-06-27 22:54:56,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520584223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:54:56,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:54:56,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:54:56,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432518000] [2024-06-27 22:54:56,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:54:56,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:54:56,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:54:56,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:54:56,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:54:56,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 59 [2024-06-27 22:54:56,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 158 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:54:56,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:54:56,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 59 [2024-06-27 22:54:56,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:00,084 INFO L124 PetriNetUnfolderBase]: 11836/16455 cut-off events. [2024-06-27 22:55:00,084 INFO L125 PetriNetUnfolderBase]: For 2997/3007 co-relation queries the response was YES. [2024-06-27 22:55:00,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37126 conditions, 16455 events. 11836/16455 cut-off events. For 2997/3007 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 96305 event pairs, 6741 based on Foata normal form. 10/16461 useless extension candidates. Maximal degree in co-relation 37114. Up to 15895 conditions per place. [2024-06-27 22:55:00,181 INFO L140 encePairwiseOnDemand]: 49/59 looper letters, 76 selfloop transitions, 13 changer transitions 0/102 dead transitions. [2024-06-27 22:55:00,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 102 transitions, 454 flow [2024-06-27 22:55:00,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:55:00,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:55:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2024-06-27 22:55:00,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6822033898305084 [2024-06-27 22:55:00,197 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 158 flow. Second operand 4 states and 161 transitions. [2024-06-27 22:55:00,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 102 transitions, 454 flow [2024-06-27 22:55:00,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:55:00,204 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 241 flow [2024-06-27 22:55:00,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-06-27 22:55:00,210 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 3 predicate places. [2024-06-27 22:55:00,210 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 241 flow [2024-06-27 22:55:00,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:00,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:00,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:00,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:55:00,211 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-27 22:55:00,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:00,211 INFO L85 PathProgramCache]: Analyzing trace with hash -264498725, now seen corresponding path program 1 times [2024-06-27 22:55:00,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:00,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372297482] [2024-06-27 22:55:00,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:08,027 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-27 22:55:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372297482] [2024-06-27 22:55:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372297482] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:55:08,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46715137] [2024-06-27 22:55:08,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:08,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:55:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:08,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:55:08,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:55:08,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-27 22:55:08,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-27 22:55:08,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:08,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-27 22:55:08,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:11,920 INFO L124 PetriNetUnfolderBase]: 15023/20762 cut-off events. [2024-06-27 22:55:11,920 INFO L125 PetriNetUnfolderBase]: For 11735/11753 co-relation queries the response was YES. [2024-06-27 22:55:11,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52473 conditions, 20762 events. 15023/20762 cut-off events. For 11735/11753 co-relation queries the response was YES. Maximal size of possible extension queue 871. Compared 122248 event pairs, 7095 based on Foata normal form. 16/20775 useless extension candidates. Maximal degree in co-relation 52458. Up to 20058 conditions per place. [2024-06-27 22:55:12,048 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 109 selfloop transitions, 16 changer transitions 0/137 dead transitions. [2024-06-27 22:55:12,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 137 transitions, 712 flow [2024-06-27 22:55:12,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:55:12,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:55:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2024-06-27 22:55:12,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6711864406779661 [2024-06-27 22:55:12,050 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 241 flow. Second operand 5 states and 198 transitions. [2024-06-27 22:55:12,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 137 transitions, 712 flow [2024-06-27 22:55:12,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 712 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:55:12,061 INFO L231 Difference]: Finished difference. Result has 75 places, 80 transitions, 409 flow [2024-06-27 22:55:12,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=409, PETRI_PLACES=75, PETRI_TRANSITIONS=80} [2024-06-27 22:55:12,062 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 10 predicate places. [2024-06-27 22:55:12,062 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 80 transitions, 409 flow [2024-06-27 22:55:12,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-27 22:55:12,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:12,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:12,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:55:12,063 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-27 22:55:12,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:12,063 INFO L85 PathProgramCache]: Analyzing trace with hash -776593506, now seen corresponding path program 1 times [2024-06-27 22:55:12,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:12,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021211256] [2024-06-27 22:55:12,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:12,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:16,570 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-27 22:55:16,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:16,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021211256] [2024-06-27 22:55:16,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021211256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:16,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:16,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:55:16,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870694339] [2024-06-27 22:55:16,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:16,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:55:16,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:16,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:55:16,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:55:16,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 59 [2024-06-27 22:55:16,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 80 transitions, 409 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:16,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:16,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 59 [2024-06-27 22:55:16,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:20,353 INFO L124 PetriNetUnfolderBase]: 15007/20754 cut-off events. [2024-06-27 22:55:20,354 INFO L125 PetriNetUnfolderBase]: For 19147/19210 co-relation queries the response was YES. [2024-06-27 22:55:20,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57427 conditions, 20754 events. 15007/20754 cut-off events. For 19147/19210 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 122616 event pairs, 5647 based on Foata normal form. 38/20789 useless extension candidates. Maximal degree in co-relation 57407. Up to 19956 conditions per place. [2024-06-27 22:55:20,498 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 124 selfloop transitions, 19 changer transitions 0/155 dead transitions. [2024-06-27 22:55:20,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 155 transitions, 883 flow [2024-06-27 22:55:20,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:55:20,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:55:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 233 transitions. [2024-06-27 22:55:20,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6581920903954802 [2024-06-27 22:55:20,500 INFO L175 Difference]: Start difference. First operand has 75 places, 80 transitions, 409 flow. Second operand 6 states and 233 transitions. [2024-06-27 22:55:20,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 155 transitions, 883 flow [2024-06-27 22:55:20,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 155 transitions, 879 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 22:55:20,515 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 471 flow [2024-06-27 22:55:20,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2024-06-27 22:55:20,516 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 15 predicate places. [2024-06-27 22:55:20,516 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 471 flow [2024-06-27 22:55:20,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:20,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:20,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:20,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:55:20,517 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-27 22:55:20,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:20,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1576557762, now seen corresponding path program 1 times [2024-06-27 22:55:20,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:20,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972578709] [2024-06-27 22:55:20,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:20,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:24,667 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-27 22:55:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972578709] [2024-06-27 22:55:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972578709] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:24,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:55:24,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423373328] [2024-06-27 22:55:24,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:24,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:55:24,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:24,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:55:24,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:55:24,720 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-27 22:55:24,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 471 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:24,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:24,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-27 22:55:24,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:29,486 INFO L124 PetriNetUnfolderBase]: 18967/26032 cut-off events. [2024-06-27 22:55:29,486 INFO L125 PetriNetUnfolderBase]: For 34594/34678 co-relation queries the response was YES. [2024-06-27 22:55:29,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75522 conditions, 26032 events. 18967/26032 cut-off events. For 34594/34678 co-relation queries the response was YES. Maximal size of possible extension queue 997. Compared 153776 event pairs, 7995 based on Foata normal form. 22/26043 useless extension candidates. Maximal degree in co-relation 75498. Up to 25107 conditions per place. [2024-06-27 22:55:29,639 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 112 selfloop transitions, 20 changer transitions 0/142 dead transitions. [2024-06-27 22:55:29,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 142 transitions, 1036 flow [2024-06-27 22:55:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:55:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:55:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2024-06-27 22:55:29,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5627118644067797 [2024-06-27 22:55:29,641 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 471 flow. Second operand 5 states and 166 transitions. [2024-06-27 22:55:29,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 142 transitions, 1036 flow [2024-06-27 22:55:29,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 142 transitions, 972 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 22:55:29,660 INFO L231 Difference]: Finished difference. Result has 83 places, 100 transitions, 655 flow [2024-06-27 22:55:29,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=427, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=83, PETRI_TRANSITIONS=100} [2024-06-27 22:55:29,661 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 18 predicate places. [2024-06-27 22:55:29,661 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 100 transitions, 655 flow [2024-06-27 22:55:29,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:55:29,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:29,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:29,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:55:29,662 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-27 22:55:29,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:29,662 INFO L85 PathProgramCache]: Analyzing trace with hash 500559677, now seen corresponding path program 1 times [2024-06-27 22:55:29,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:29,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735169978] [2024-06-27 22:55:29,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:29,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:34,943 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-27 22:55:34,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:34,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735169978] [2024-06-27 22:55:34,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735169978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:34,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:34,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:55:34,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640615829] [2024-06-27 22:55:34,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:34,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:55:34,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:34,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:55:34,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:55:34,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-27 22:55:34,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 100 transitions, 655 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-27 22:55:34,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:34,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-27 22:55:34,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:40,409 INFO L124 PetriNetUnfolderBase]: 19048/26333 cut-off events. [2024-06-27 22:55:40,409 INFO L125 PetriNetUnfolderBase]: For 51182/51482 co-relation queries the response was YES. [2024-06-27 22:55:40,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84488 conditions, 26333 events. 19048/26333 cut-off events. For 51182/51482 co-relation queries the response was YES. Maximal size of possible extension queue 1069. Compared 159532 event pairs, 6839 based on Foata normal form. 141/26396 useless extension candidates. Maximal degree in co-relation 84459. Up to 24717 conditions per place. [2024-06-27 22:55:40,601 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 194 selfloop transitions, 47 changer transitions 0/254 dead transitions. [2024-06-27 22:55:40,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 254 transitions, 1698 flow [2024-06-27 22:55:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:55:40,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:55:40,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 381 transitions. [2024-06-27 22:55:40,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5870570107858244 [2024-06-27 22:55:40,604 INFO L175 Difference]: Start difference. First operand has 83 places, 100 transitions, 655 flow. Second operand 11 states and 381 transitions. [2024-06-27 22:55:40,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 254 transitions, 1698 flow [2024-06-27 22:55:40,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 254 transitions, 1692 flow, removed 3 selfloop flow, removed 0 redundant places. [2024-06-27 22:55:40,655 INFO L231 Difference]: Finished difference. Result has 96 places, 125 transitions, 958 flow [2024-06-27 22:55:40,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=958, PETRI_PLACES=96, PETRI_TRANSITIONS=125} [2024-06-27 22:55:40,657 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 31 predicate places. [2024-06-27 22:55:40,657 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 125 transitions, 958 flow [2024-06-27 22:55:40,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-27 22:55:40,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:40,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:40,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:55:40,658 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-27 22:55:40,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:40,658 INFO L85 PathProgramCache]: Analyzing trace with hash 496139413, now seen corresponding path program 2 times [2024-06-27 22:55:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:40,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743113091] [2024-06-27 22:55:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:46,734 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-27 22:55:46,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:46,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743113091] [2024-06-27 22:55:46,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743113091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:46,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:46,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:55:46,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074339483] [2024-06-27 22:55:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:46,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:55:46,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:46,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:55:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:55:46,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-27 22:55:46,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 125 transitions, 958 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-27 22:55:46,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:46,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-27 22:55:46,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:55:51,810 INFO L124 PetriNetUnfolderBase]: 19282/26701 cut-off events. [2024-06-27 22:55:51,810 INFO L125 PetriNetUnfolderBase]: For 78077/78673 co-relation queries the response was YES. [2024-06-27 22:55:51,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96988 conditions, 26701 events. 19282/26701 cut-off events. For 78077/78673 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 161975 event pairs, 6928 based on Foata normal form. 94/26696 useless extension candidates. Maximal degree in co-relation 96953. Up to 25336 conditions per place. [2024-06-27 22:55:52,012 INFO L140 encePairwiseOnDemand]: 46/59 looper letters, 125 selfloop transitions, 64 changer transitions 0/202 dead transitions. [2024-06-27 22:55:52,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 202 transitions, 1740 flow [2024-06-27 22:55:52,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:55:52,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:55:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 210 transitions. [2024-06-27 22:55:52,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5932203389830508 [2024-06-27 22:55:52,014 INFO L175 Difference]: Start difference. First operand has 96 places, 125 transitions, 958 flow. Second operand 6 states and 210 transitions. [2024-06-27 22:55:52,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 202 transitions, 1740 flow [2024-06-27 22:55:52,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 202 transitions, 1656 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 22:55:52,107 INFO L231 Difference]: Finished difference. Result has 98 places, 149 transitions, 1354 flow [2024-06-27 22:55:52,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1354, PETRI_PLACES=98, PETRI_TRANSITIONS=149} [2024-06-27 22:55:52,107 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 33 predicate places. [2024-06-27 22:55:52,108 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 149 transitions, 1354 flow [2024-06-27 22:55:52,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-27 22:55:52,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:55:52,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:55:52,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:55:52,108 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-27 22:55:52,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:55:52,109 INFO L85 PathProgramCache]: Analyzing trace with hash 502265297, now seen corresponding path program 3 times [2024-06-27 22:55:52,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:55:52,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649163720] [2024-06-27 22:55:52,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:55:52,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:55:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:55:56,411 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-27 22:55:56,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:55:56,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649163720] [2024-06-27 22:55:56,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649163720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:55:56,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:55:56,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:55:56,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962689955] [2024-06-27 22:55:56,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:55:56,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:55:56,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:55:56,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:55:56,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:55:56,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 59 [2024-06-27 22:55:56,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 149 transitions, 1354 flow. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-27 22:55:56,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:55:56,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 59 [2024-06-27 22:55:56,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:01,713 INFO L124 PetriNetUnfolderBase]: 19510/27077 cut-off events. [2024-06-27 22:56:01,713 INFO L125 PetriNetUnfolderBase]: For 103893/104463 co-relation queries the response was YES. [2024-06-27 22:56:01,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103770 conditions, 27077 events. 19510/27077 cut-off events. For 103893/104463 co-relation queries the response was YES. Maximal size of possible extension queue 1081. Compared 164859 event pairs, 6818 based on Foata normal form. 146/27099 useless extension candidates. Maximal degree in co-relation 103732. Up to 24877 conditions per place. [2024-06-27 22:56:01,926 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 114 selfloop transitions, 85 changer transitions 0/212 dead transitions. [2024-06-27 22:56:01,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 212 transitions, 2015 flow [2024-06-27 22:56:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:56:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:56:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 221 transitions. [2024-06-27 22:56:01,928 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5351089588377724 [2024-06-27 22:56:01,928 INFO L175 Difference]: Start difference. First operand has 98 places, 149 transitions, 1354 flow. Second operand 7 states and 221 transitions. [2024-06-27 22:56:01,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 212 transitions, 2015 flow [2024-06-27 22:56:02,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 212 transitions, 1926 flow, removed 17 selfloop flow, removed 2 redundant places. [2024-06-27 22:56:02,038 INFO L231 Difference]: Finished difference. Result has 104 places, 165 transitions, 1661 flow [2024-06-27 22:56:02,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1661, PETRI_PLACES=104, PETRI_TRANSITIONS=165} [2024-06-27 22:56:02,038 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 39 predicate places. [2024-06-27 22:56:02,038 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 165 transitions, 1661 flow [2024-06-27 22:56:02,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 7 states have internal predecessors, (124), 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-27 22:56:02,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:02,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:02,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:56:02,039 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-27 22:56:02,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:02,039 INFO L85 PathProgramCache]: Analyzing trace with hash 583264555, now seen corresponding path program 1 times [2024-06-27 22:56:02,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:02,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189222963] [2024-06-27 22:56:02,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:02,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:06,838 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-27 22:56:06,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:06,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189222963] [2024-06-27 22:56:06,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189222963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:06,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:06,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:56:06,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932395350] [2024-06-27 22:56:06,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:06,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:56:06,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:06,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:56:06,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:56:06,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-27 22:56:06,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 165 transitions, 1661 flow. Second operand has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 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-27 22:56:06,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:06,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-27 22:56:06,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:12,843 INFO L124 PetriNetUnfolderBase]: 20639/28352 cut-off events. [2024-06-27 22:56:12,843 INFO L125 PetriNetUnfolderBase]: For 132290/132686 co-relation queries the response was YES. [2024-06-27 22:56:12,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114490 conditions, 28352 events. 20639/28352 cut-off events. For 132290/132686 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 168660 event pairs, 7317 based on Foata normal form. 95/28424 useless extension candidates. Maximal degree in co-relation 114449. Up to 26989 conditions per place. [2024-06-27 22:56:13,031 INFO L140 encePairwiseOnDemand]: 48/59 looper letters, 186 selfloop transitions, 30 changer transitions 0/226 dead transitions. [2024-06-27 22:56:13,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 226 transitions, 2326 flow [2024-06-27 22:56:13,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:56:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:56:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 216 transitions. [2024-06-27 22:56:13,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230024213075061 [2024-06-27 22:56:13,033 INFO L175 Difference]: Start difference. First operand has 104 places, 165 transitions, 1661 flow. Second operand 7 states and 216 transitions. [2024-06-27 22:56:13,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 226 transitions, 2326 flow [2024-06-27 22:56:13,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 226 transitions, 2299 flow, removed 11 selfloop flow, removed 2 redundant places. [2024-06-27 22:56:13,173 INFO L231 Difference]: Finished difference. Result has 109 places, 168 transitions, 1738 flow [2024-06-27 22:56:13,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1738, PETRI_PLACES=109, PETRI_TRANSITIONS=168} [2024-06-27 22:56:13,174 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 44 predicate places. [2024-06-27 22:56:13,174 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 168 transitions, 1738 flow [2024-06-27 22:56:13,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.714285714285715) internal successors, (117), 7 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-27 22:56:13,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:13,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:13,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:56:13,174 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-27 22:56:13,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:13,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1021949063, now seen corresponding path program 1 times [2024-06-27 22:56:13,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:13,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189361318] [2024-06-27 22:56:13,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:13,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:19,656 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-27 22:56:19,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:19,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189361318] [2024-06-27 22:56:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189361318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:19,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:19,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:56:19,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909575043] [2024-06-27 22:56:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:19,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:56:19,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:19,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:56:19,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:56:19,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-27 22:56:19,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 168 transitions, 1738 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-27 22:56:19,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:19,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-27 22:56:19,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:26,259 INFO L124 PetriNetUnfolderBase]: 21003/29568 cut-off events. [2024-06-27 22:56:26,259 INFO L125 PetriNetUnfolderBase]: For 159472/159675 co-relation queries the response was YES. [2024-06-27 22:56:26,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121451 conditions, 29568 events. 21003/29568 cut-off events. For 159472/159675 co-relation queries the response was YES. Maximal size of possible extension queue 1060. Compared 183915 event pairs, 10122 based on Foata normal form. 77/29576 useless extension candidates. Maximal degree in co-relation 121408. Up to 26969 conditions per place. [2024-06-27 22:56:26,471 INFO L140 encePairwiseOnDemand]: 45/59 looper letters, 295 selfloop transitions, 63 changer transitions 0/368 dead transitions. [2024-06-27 22:56:26,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 368 transitions, 3406 flow [2024-06-27 22:56:26,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:56:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:56:26,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 407 transitions. [2024-06-27 22:56:26,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5748587570621468 [2024-06-27 22:56:26,473 INFO L175 Difference]: Start difference. First operand has 109 places, 168 transitions, 1738 flow. Second operand 12 states and 407 transitions. [2024-06-27 22:56:26,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 368 transitions, 3406 flow [2024-06-27 22:56:26,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 368 transitions, 3309 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-06-27 22:56:26,708 INFO L231 Difference]: Finished difference. Result has 124 places, 219 transitions, 2353 flow [2024-06-27 22:56:26,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=1660, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2353, PETRI_PLACES=124, PETRI_TRANSITIONS=219} [2024-06-27 22:56:26,710 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 59 predicate places. [2024-06-27 22:56:26,710 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 219 transitions, 2353 flow [2024-06-27 22:56:26,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-27 22:56:26,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:26,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:26,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:56:26,712 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-27 22:56:26,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash -900365945, now seen corresponding path program 2 times [2024-06-27 22:56:26,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:26,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278932528] [2024-06-27 22:56:26,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:26,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:56:31,846 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-27 22:56:31,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:56:31,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278932528] [2024-06-27 22:56:31,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278932528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:56:31,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:56:31,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:56:31,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637624803] [2024-06-27 22:56:31,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:56:31,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:56:31,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:56:31,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:56:31,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:56:31,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 59 [2024-06-27 22:56:31,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 219 transitions, 2353 flow. Second operand has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-27 22:56:31,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:56:31,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 59 [2024-06-27 22:56:31,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:56:38,812 INFO L124 PetriNetUnfolderBase]: 21369/29261 cut-off events. [2024-06-27 22:56:38,812 INFO L125 PetriNetUnfolderBase]: For 180089/180508 co-relation queries the response was YES. [2024-06-27 22:56:38,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131409 conditions, 29261 events. 21369/29261 cut-off events. For 180089/180508 co-relation queries the response was YES. Maximal size of possible extension queue 1067. Compared 171871 event pairs, 7241 based on Foata normal form. 140/29373 useless extension candidates. Maximal degree in co-relation 131358. Up to 27059 conditions per place. [2024-06-27 22:56:39,071 INFO L140 encePairwiseOnDemand]: 44/59 looper letters, 233 selfloop transitions, 80 changer transitions 0/323 dead transitions. [2024-06-27 22:56:39,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 323 transitions, 3603 flow [2024-06-27 22:56:39,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:56:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:56:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 257 transitions. [2024-06-27 22:56:39,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444915254237288 [2024-06-27 22:56:39,073 INFO L175 Difference]: Start difference. First operand has 124 places, 219 transitions, 2353 flow. Second operand 8 states and 257 transitions. [2024-06-27 22:56:39,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 323 transitions, 3603 flow [2024-06-27 22:56:39,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 323 transitions, 3565 flow, removed 18 selfloop flow, removed 1 redundant places. [2024-06-27 22:56:39,294 INFO L231 Difference]: Finished difference. Result has 133 places, 248 transitions, 2861 flow [2024-06-27 22:56:39,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=59, PETRI_DIFFERENCE_MINUEND_FLOW=2325, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2861, PETRI_PLACES=133, PETRI_TRANSITIONS=248} [2024-06-27 22:56:39,295 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 68 predicate places. [2024-06-27 22:56:39,295 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 248 transitions, 2861 flow [2024-06-27 22:56:39,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.625) internal successors, (133), 8 states have internal predecessors, (133), 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-27 22:56:39,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:56:39,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:56:39,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:56:39,296 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-27 22:56:39,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:56:39,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1609636973, now seen corresponding path program 3 times [2024-06-27 22:56:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:56:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861781982] [2024-06-27 22:56:39,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:56:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:56:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat