./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.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/mix053_power.oepc_pso.oepc_rmo.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/mix053_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix053_power.oepc_pso.oepc_rmo.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:29:12,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:29:12,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:29:12,181 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:29:12,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:29:12,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:29:12,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:29:12,205 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:29:12,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:29:12,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:29:12,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:29:12,210 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:29:12,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:29:12,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:29:12,211 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:29:12,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:29:12,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:29:12,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:29:12,212 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:29:12,212 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:29:12,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:29:12,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:29:12,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:29:12,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:29:12,214 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:29:12,214 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:29:12,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:29:12,214 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:29:12,215 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:29:12,215 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:29:12,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:29:12,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:29:12,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:29:12,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:29:12,217 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:29:12,217 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:29:12,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:29:12,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:29:12,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:29:12,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:29:12,218 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:29:12,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:29:12,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:29:12,218 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:29:12,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:29:12,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:29:12,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:29:12,454 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:29:12,455 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:29:12,456 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/mix053_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-06-27 22:29:12,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:29:12,561 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:29:12,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:29:13,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:29:13,751 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:29:13,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:29:13,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c7873390/2194feb3f45a4673a26764fc66089359/FLAG487f3216e [2024-06-27 22:29:13,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c7873390/2194feb3f45a4673a26764fc66089359 [2024-06-27 22:29:13,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:29:13,775 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:29:13,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:29:13,776 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:29:13,780 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:29:13,781 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:29:12" (1/2) ... [2024-06-27 22:29:13,781 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f5359e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:29:13, skipping insertion in model container [2024-06-27 22:29:13,782 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:29:12" (1/2) ... [2024-06-27 22:29:13,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@52ffca4b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:29:13, skipping insertion in model container [2024-06-27 22:29:13,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:29:13" (2/2) ... [2024-06-27 22:29:13,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f5359e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:13, skipping insertion in model container [2024-06-27 22:29:13,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:29:13" (2/2) ... [2024-06-27 22:29:13,784 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:29:13,817 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:29:13,818 INFO L97 edCorrectnessWitness]: Location invariant before [L864-L864] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:29:13,819 INFO L97 edCorrectnessWitness]: Location invariant before [L867-L867] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:29:13,819 INFO L97 edCorrectnessWitness]: Location invariant before [L866-L866] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:29:13,819 INFO L97 edCorrectnessWitness]: Location invariant before [L862-L862] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a$mem_tmp >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$flush_delayed) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$r_buff0_thd1 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff0_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd0) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff1 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd2) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd3) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$r_buff1_thd4) + (long long )a$w_buff0_used >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0 >= 0LL) && (0LL - (long long )a$read_delayed) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff0_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$r_buff1_thd1) + (long long )a$w_buff0_used >= 0LL) && (1LL - (long long )a$w_buff0) + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a$w_buff0_used >= 0LL) && (long long )a + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a + (long long )a$w_buff0 >= 0LL) && (long long )a + (long long )a$w_buff0_used >= 0LL) && (long long )a$flush_delayed + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$flush_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$mem_tmp + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0 >= 0LL) && (long long )a$mem_tmp + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$r_buff0_thd1 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )x >= 0LL) && (long long )a$r_buff0_thd1 + (long long )y >= 0LL) && (long long )a$r_buff0_thd1 + (long long )z >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )a$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd1 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd2 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd3 + (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff1_thd4 + (long long )a$w_buff0_used >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0 >= 0LL) && (long long )a$read_delayed + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0 + (long long )x >= 0LL) && (long long )a$w_buff0 + (long long )y >= 0LL) && (long long )a$w_buff0 + (long long )z >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0_used + (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )a$w_buff0_used + (long long )x >= 0LL) && (long long )a$w_buff0_used + (long long )y >= 0LL) && (long long )a$w_buff0_used + (long long )z >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )a$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )a$w_buff0_used) - (long long )a$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )a$mem_tmp >= 0LL) && (long long )a - (long long )a$mem_tmp >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff0_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd2 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd3 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$r_buff1_thd4 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$read_delayed >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff0_used >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff0_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1 >= 0LL) && (long long )a$r_buff1_thd1 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff0_used >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1 >= 0LL) && (long long )a$w_buff0 - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff0_used - (long long )a$w_buff1_used >= 0LL) && (long long )a$w_buff1 - (long long )a$w_buff1_used >= 0LL) [2024-06-27 22:29:13,820 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:29:13,820 INFO L106 edCorrectnessWitness]: ghost_update [L860-L860] multithreaded = 1; [2024-06-27 22:29:13,855 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:29:13,981 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/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2024-06-27 22:29:14,134 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:29:14,142 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:29:14,181 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/mix053_power.oepc_pso.oepc_rmo.oepc.i[969,982] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:29:14,412 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:29:14,453 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:29:14,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14 WrapperNode [2024-06-27 22:29:14,454 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:29:14,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:29:14,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:29:14,474 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:29:14,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,577 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2024-06-27 22:29:14,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:29:14,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:29:14,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:29:14,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:29:14,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,648 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:29:14,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,703 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:29:14,704 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:29:14,704 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:29:14,705 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:29:14,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (1/1) ... [2024-06-27 22:29:14,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:29:14,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:29:14,731 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:29:14,749 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:29:14,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:29:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:29:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:29:14,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:29:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:29:14,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:29:14,773 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 22:29:14,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 22:29:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 22:29:14,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 22:29:14,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:29:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:29:14,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:29:14,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:29:14,776 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:29:14,874 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:29:14,875 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:29:15,452 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:29:15,453 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:29:15,661 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:29:15,661 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:29:15,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:29:15 BoogieIcfgContainer [2024-06-27 22:29:15,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:29:15,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:29:15,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:29:15,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:29:15,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:29:12" (1/4) ... [2024-06-27 22:29:15,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccb8125 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:29:15, skipping insertion in model container [2024-06-27 22:29:15,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:29:13" (2/4) ... [2024-06-27 22:29:15,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccb8125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:29:15, skipping insertion in model container [2024-06-27 22:29:15,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:29:14" (3/4) ... [2024-06-27 22:29:15,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccb8125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:29:15, skipping insertion in model container [2024-06-27 22:29:15,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:29:15" (4/4) ... [2024-06-27 22:29:15,671 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2024-06-27 22:29:15,683 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:29:15,684 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-06-27 22:29:15,684 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:29:15,741 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:29:15,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 57 transitions, 130 flow [2024-06-27 22:29:15,799 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2024-06-27 22:29:15,799 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:29:15,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 53 events. 1/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2024-06-27 22:29:15,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 57 transitions, 130 flow [2024-06-27 22:29:15,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 53 transitions, 118 flow [2024-06-27 22:29:15,817 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:29:15,824 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;@518cb5c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:29:15,825 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-06-27 22:29:15,829 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:29:15,829 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:29:15,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:29:15,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:15,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:29:15,830 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:29:15,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash 372205070, now seen corresponding path program 1 times [2024-06-27 22:29:15,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:15,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625872556] [2024-06-27 22:29:15,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:17,309 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:29:17,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:17,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625872556] [2024-06-27 22:29:17,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625872556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:17,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:17,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:29:17,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209209177] [2024-06-27 22:29:17,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:17,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:29:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:17,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:29:17,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:29:17,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-27 22:29:17,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:29:17,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:17,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-27 22:29:17,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:21,760 INFO L124 PetriNetUnfolderBase]: 30396/45476 cut-off events. [2024-06-27 22:29:21,760 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2024-06-27 22:29:21,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86226 conditions, 45476 events. 30396/45476 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 1649. Compared 334009 event pairs, 26466 based on Foata normal form. 1260/43788 useless extension candidates. Maximal degree in co-relation 86213. Up to 40215 conditions per place. [2024-06-27 22:29:22,021 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 53 selfloop transitions, 5 changer transitions 0/70 dead transitions. [2024-06-27 22:29:22,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 277 flow [2024-06-27 22:29:22,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:29:22,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:29:22,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-06-27 22:29:22,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6608187134502924 [2024-06-27 22:29:22,037 INFO L175 Difference]: Start difference. First operand has 65 places, 53 transitions, 118 flow. Second operand 3 states and 113 transitions. [2024-06-27 22:29:22,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 277 flow [2024-06-27 22:29:22,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:29:22,048 INFO L231 Difference]: Finished difference. Result has 64 places, 56 transitions, 153 flow [2024-06-27 22:29:22,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, 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=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2024-06-27 22:29:22,052 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, -1 predicate places. [2024-06-27 22:29:22,052 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 153 flow [2024-06-27 22:29:22,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:29:22,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:22,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:22,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:29:22,053 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:29:22,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:22,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1206843468, now seen corresponding path program 1 times [2024-06-27 22:29:22,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:22,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110060915] [2024-06-27 22:29:22,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:22,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:23,324 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:29:23,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:23,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110060915] [2024-06-27 22:29:23,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110060915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:23,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:23,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:29:23,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098134381] [2024-06-27 22:29:23,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:23,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:29:23,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:23,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:29:23,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:29:23,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-27 22:29:23,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:29:23,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:23,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-27 22:29:23,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:27,362 INFO L124 PetriNetUnfolderBase]: 30397/44603 cut-off events. [2024-06-27 22:29:27,363 INFO L125 PetriNetUnfolderBase]: For 6384/6384 co-relation queries the response was YES. [2024-06-27 22:29:27,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94698 conditions, 44603 events. 30397/44603 cut-off events. For 6384/6384 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 315225 event pairs, 22654 based on Foata normal form. 4/41908 useless extension candidates. Maximal degree in co-relation 94686. Up to 40192 conditions per place. [2024-06-27 22:29:27,607 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 67 selfloop transitions, 10 changer transitions 1/90 dead transitions. [2024-06-27 22:29:27,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 407 flow [2024-06-27 22:29:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:29:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:29:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-06-27 22:29:27,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2024-06-27 22:29:27,612 INFO L175 Difference]: Start difference. First operand has 64 places, 56 transitions, 153 flow. Second operand 4 states and 142 transitions. [2024-06-27 22:29:27,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 407 flow [2024-06-27 22:29:27,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 398 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:29:27,625 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 237 flow [2024-06-27 22:29:27,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-06-27 22:29:27,626 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 3 predicate places. [2024-06-27 22:29:27,628 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 237 flow [2024-06-27 22:29:27,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:29:27,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:27,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:27,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:29:27,635 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:29:27,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:27,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1242556291, now seen corresponding path program 1 times [2024-06-27 22:29:27,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:27,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636333648] [2024-06-27 22:29:27,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:27,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:28,847 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:29:28,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:28,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636333648] [2024-06-27 22:29:28,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636333648] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:28,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:28,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:29:28,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299784546] [2024-06-27 22:29:28,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:28,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:29:28,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:28,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:29:28,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:29:28,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-27 22:29:28,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:29:28,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:28,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-27 22:29:28,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:32,790 INFO L124 PetriNetUnfolderBase]: 30484/44687 cut-off events. [2024-06-27 22:29:32,790 INFO L125 PetriNetUnfolderBase]: For 19702/19702 co-relation queries the response was YES. [2024-06-27 22:29:33,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104190 conditions, 44687 events. 30484/44687 cut-off events. For 19702/19702 co-relation queries the response was YES. Maximal size of possible extension queue 1588. Compared 315140 event pairs, 17673 based on Foata normal form. 14/42071 useless extension candidates. Maximal degree in co-relation 104175. Up to 40069 conditions per place. [2024-06-27 22:29:33,255 INFO L140 encePairwiseOnDemand]: 43/57 looper letters, 90 selfloop transitions, 23 changer transitions 2/127 dead transitions. [2024-06-27 22:29:33,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 127 transitions, 671 flow [2024-06-27 22:29:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:29:33,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:29:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 189 transitions. [2024-06-27 22:29:33,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6631578947368421 [2024-06-27 22:29:33,262 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 237 flow. Second operand 5 states and 189 transitions. [2024-06-27 22:29:33,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 127 transitions, 671 flow [2024-06-27 22:29:33,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 127 transitions, 656 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 22:29:33,274 INFO L231 Difference]: Finished difference. Result has 74 places, 80 transitions, 386 flow [2024-06-27 22:29:33,274 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2024-06-27 22:29:33,276 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 9 predicate places. [2024-06-27 22:29:33,276 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 386 flow [2024-06-27 22:29:33,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:29:33,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:33,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:33,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:29:33,277 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:29:33,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:33,277 INFO L85 PathProgramCache]: Analyzing trace with hash -95626660, now seen corresponding path program 1 times [2024-06-27 22:29:33,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:33,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495335361] [2024-06-27 22:29:33,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:33,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:34,856 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:29:34,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:34,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495335361] [2024-06-27 22:29:34,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495335361] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:34,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:34,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:29:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116588241] [2024-06-27 22:29:34,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:34,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:29:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:29:34,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:29:34,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 57 [2024-06-27 22:29:34,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 386 flow. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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:29:34,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:34,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 57 [2024-06-27 22:29:34,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:39,373 INFO L124 PetriNetUnfolderBase]: 30552/45671 cut-off events. [2024-06-27 22:29:39,373 INFO L125 PetriNetUnfolderBase]: For 46593/46598 co-relation queries the response was YES. [2024-06-27 22:29:39,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120715 conditions, 45671 events. 30552/45671 cut-off events. For 46593/46598 co-relation queries the response was YES. Maximal size of possible extension queue 1649. Compared 332786 event pairs, 17878 based on Foata normal form. 18/43054 useless extension candidates. Maximal degree in co-relation 120696. Up to 40040 conditions per place. [2024-06-27 22:29:39,660 INFO L140 encePairwiseOnDemand]: 43/57 looper letters, 117 selfloop transitions, 50 changer transitions 4/183 dead transitions. [2024-06-27 22:29:39,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 183 transitions, 1154 flow [2024-06-27 22:29:39,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:29:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:29:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 255 transitions. [2024-06-27 22:29:39,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6390977443609023 [2024-06-27 22:29:39,663 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 386 flow. Second operand 7 states and 255 transitions. [2024-06-27 22:29:39,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 183 transitions, 1154 flow [2024-06-27 22:29:39,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 183 transitions, 1130 flow, removed 12 selfloop flow, removed 0 redundant places. [2024-06-27 22:29:39,724 INFO L231 Difference]: Finished difference. Result has 83 places, 110 transitions, 744 flow [2024-06-27 22:29:39,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=744, PETRI_PLACES=83, PETRI_TRANSITIONS=110} [2024-06-27 22:29:39,725 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 18 predicate places. [2024-06-27 22:29:39,725 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 110 transitions, 744 flow [2024-06-27 22:29:39,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 7 states have internal predecessors, (120), 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:29:39,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:39,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:39,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:29:39,726 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:29:39,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1357957914, now seen corresponding path program 1 times [2024-06-27 22:29:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937139044] [2024-06-27 22:29:39,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:41,534 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:29:41,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:41,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937139044] [2024-06-27 22:29:41,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937139044] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:41,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:41,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:29:41,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35167690] [2024-06-27 22:29:41,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:41,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:29:41,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:29:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:29:41,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2024-06-27 22:29:41,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 110 transitions, 744 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:41,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:41,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2024-06-27 22:29:41,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:47,149 INFO L124 PetriNetUnfolderBase]: 34738/51197 cut-off events. [2024-06-27 22:29:47,150 INFO L125 PetriNetUnfolderBase]: For 92360/92360 co-relation queries the response was YES. [2024-06-27 22:29:47,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152530 conditions, 51197 events. 34738/51197 cut-off events. For 92360/92360 co-relation queries the response was YES. Maximal size of possible extension queue 1717. Compared 367581 event pairs, 20268 based on Foata normal form. 3/48381 useless extension candidates. Maximal degree in co-relation 152504. Up to 45839 conditions per place. [2024-06-27 22:29:47,503 INFO L140 encePairwiseOnDemand]: 46/57 looper letters, 106 selfloop transitions, 20 changer transitions 0/136 dead transitions. [2024-06-27 22:29:47,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 136 transitions, 1072 flow [2024-06-27 22:29:47,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:29:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:29:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2024-06-27 22:29:47,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2024-06-27 22:29:47,512 INFO L175 Difference]: Start difference. First operand has 83 places, 110 transitions, 744 flow. Second operand 5 states and 150 transitions. [2024-06-27 22:29:47,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 136 transitions, 1072 flow [2024-06-27 22:29:47,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 136 transitions, 1020 flow, removed 26 selfloop flow, removed 0 redundant places. [2024-06-27 22:29:47,582 INFO L231 Difference]: Finished difference. Result has 89 places, 112 transitions, 771 flow [2024-06-27 22:29:47,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=771, PETRI_PLACES=89, PETRI_TRANSITIONS=112} [2024-06-27 22:29:47,584 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 24 predicate places. [2024-06-27 22:29:47,584 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 112 transitions, 771 flow [2024-06-27 22:29:47,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:29:47,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:47,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:47,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:29:47,585 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:29:47,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash 853015994, now seen corresponding path program 1 times [2024-06-27 22:29:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:47,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221733050] [2024-06-27 22:29:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:47,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:47,646 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:29:47,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:47,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221733050] [2024-06-27 22:29:47,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221733050] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:47,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:47,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:29:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146998480] [2024-06-27 22:29:47,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:47,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:29:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:47,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:29:47,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:29:47,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 57 [2024-06-27 22:29:47,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 112 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:29:47,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:47,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 57 [2024-06-27 22:29:47,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:29:49,439 INFO L124 PetriNetUnfolderBase]: 9008/16261 cut-off events. [2024-06-27 22:29:49,439 INFO L125 PetriNetUnfolderBase]: For 13031/13387 co-relation queries the response was YES. [2024-06-27 22:29:49,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38831 conditions, 16261 events. 9008/16261 cut-off events. For 13031/13387 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 142494 event pairs, 5366 based on Foata normal form. 34/14794 useless extension candidates. Maximal degree in co-relation 38801. Up to 10515 conditions per place. [2024-06-27 22:29:49,544 INFO L140 encePairwiseOnDemand]: 54/57 looper letters, 49 selfloop transitions, 7 changer transitions 0/131 dead transitions. [2024-06-27 22:29:49,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 131 transitions, 925 flow [2024-06-27 22:29:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:29:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:29:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2024-06-27 22:29:49,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7894736842105263 [2024-06-27 22:29:49,546 INFO L175 Difference]: Start difference. First operand has 89 places, 112 transitions, 771 flow. Second operand 3 states and 135 transitions. [2024-06-27 22:29:49,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 131 transitions, 925 flow [2024-06-27 22:29:49,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 871 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 22:29:49,574 INFO L231 Difference]: Finished difference. Result has 87 places, 111 transitions, 723 flow [2024-06-27 22:29:49,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=87, PETRI_TRANSITIONS=111} [2024-06-27 22:29:49,575 INFO L281 CegarLoopForPetriNet]: 65 programPoint places, 22 predicate places. [2024-06-27 22:29:49,575 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 111 transitions, 723 flow [2024-06-27 22:29:49,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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:29:49,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:29:49,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:29:49,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:29:49,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 8 more)] === [2024-06-27 22:29:49,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:29:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash 818815227, now seen corresponding path program 1 times [2024-06-27 22:29:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:29:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052682226] [2024-06-27 22:29:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:29:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:29:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:29:51,413 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:29:51,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:29:51,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052682226] [2024-06-27 22:29:51,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052682226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:29:51,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:29:51,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:29:51,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778859208] [2024-06-27 22:29:51,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:29:51,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:29:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:29:51,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:29:51,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:29:51,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 57 [2024-06-27 22:29:51,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 111 transitions, 723 flow. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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:29:51,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:29:51,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 57 [2024-06-27 22:29:51,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand