./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix030_tso.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/mix030_tso.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix030_tso.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 15:04:27,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:04:27,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:04:27,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:04:27,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:04:27,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:04:27,799 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:04:27,799 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:04:27,800 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:04:27,803 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:04:27,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:04:27,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:04:27,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:04:27,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:04:27,805 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:04:27,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:04:27,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:04:27,806 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:04:27,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:04:27,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:04:27,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:04:27,807 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:04:27,807 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:04:27,807 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:04:27,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:04:27,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:04:27,808 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:04:27,808 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:04:27,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:04:27,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:04:27,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:04:27,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:04:27,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:04:27,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:04:27,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:04:27,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:04:27,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:04:27,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:04:27,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:04:27,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:04:27,811 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:04:27,812 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:04:27,812 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:04:27,812 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 15:04:28,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:04:28,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:04:28,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:04:28,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:04:28,044 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:04:28,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2024-06-14 15:04:29,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:04:29,279 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:04:29,280 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.i [2024-06-14 15:04:29,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff139050/1c1e7c0ca68b4f829c5acb1b4141eeca/FLAG1b40f475b [2024-06-14 15:04:29,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bff139050/1c1e7c0ca68b4f829c5acb1b4141eeca [2024-06-14 15:04:29,302 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:04:29,303 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:04:29,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/mix030_tso.yml/witness.yml [2024-06-14 15:04:29,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:04:29,520 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:04:29,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:04:29,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:04:29,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:04:29,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:04:29" (1/2) ... [2024-06-14 15:04:29,526 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6086b1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:04:29, skipping insertion in model container [2024-06-14 15:04:29,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:04:29" (1/2) ... [2024-06-14 15:04:29,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6cdd37eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:04:29, skipping insertion in model container [2024-06-14 15:04:29,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:04:29" (2/2) ... [2024-06-14 15:04:29,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6086b1db and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:29, skipping insertion in model container [2024-06-14 15:04:29,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:04:29" (2/2) ... [2024-06-14 15:04:29,528 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:04:29,630 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:04:29,631 INFO L97 edCorrectnessWitness]: Location invariant before [L859-L859] (((((((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p3_EBX <= 1) && a <= 1) && z$w_buff0 <= 127) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (0 <= z$mem_tmp && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p3_EAX && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (0 <= z && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= z$w_buff0 && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || (((0 <= z$w_buff1 && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0) [2024-06-14 15:04:29,632 INFO L97 edCorrectnessWitness]: Location invariant before [L860-L860] (((((((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p3_EBX <= 1) && a <= 1) && z$w_buff0 <= 127) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (0 <= z$mem_tmp && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p3_EAX && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (0 <= z && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= z$w_buff0 && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || (((0 <= z$w_buff1 && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0) [2024-06-14 15:04:29,632 INFO L97 edCorrectnessWitness]: Location invariant before [L855-L855] (((((((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p3_EBX <= 1) && a <= 1) && z$w_buff0 <= 127) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (0 <= z$mem_tmp && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p3_EAX && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (0 <= z && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= z$w_buff0 && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || (((0 <= z$w_buff1 && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0) [2024-06-14 15:04:29,633 INFO L97 edCorrectnessWitness]: Location invariant before [L857-L857] (((((((((((((((((((((! multithreaded || z$r_buff0_thd2 == (_Bool)0) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p3_EBX) + (long long )a >= 0LL && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )a) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )a) + (long long )x >= 0LL) && (1LL - (long long )a) + (long long )y >= 0LL) && (1LL - (long long )a) + (long long )z >= 0LL) && (1LL - (long long )a) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )a) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )a) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )z >= 0LL) && (long long )__unbuffered_cnt + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )__unbuffered_p3_EBX >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )main$tmp_guard1 >= 0LL) && (long long )a + (long long )x >= 0LL) && (long long )a + (long long )y >= 0LL) && (long long )a + (long long )z >= 0LL) && (long long )a + (long long )z$flush_delayed >= 0LL) && (long long )a + (long long )z$mem_tmp >= 0LL) && (long long )a + (long long )z$r_buff0_thd0 >= 0LL) && (long long )a + (long long )z$r_buff0_thd1 >= 0LL) && (long long )a + (long long )z$r_buff0_thd2 >= 0LL) && (long long )a + (long long )z$r_buff0_thd3 >= 0LL) && (long long )a + (long long )z$r_buff1_thd0 >= 0LL) && (long long )a + (long long )z$r_buff1_thd1 >= 0LL) && (long long )a + (long long )z$r_buff1_thd2 >= 0LL) && (long long )a + (long long )z$r_buff1_thd3 >= 0LL) && (long long )a + (long long )z$read_delayed >= 0LL) && (long long )a + (long long )z$w_buff0 >= 0LL) && (long long )a + (long long )z$w_buff1 >= 0LL) && (long long )a + (long long )weak$$choice0 >= 0LL) && (long long )a + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )z >= 0LL) && (long long )main$tmp_guard1 + (long long )z$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )z$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )z >= 0LL) && (long long )x + (long long )z$flush_delayed >= 0LL) && (long long )x + (long long )z$mem_tmp >= 0LL) && (long long )x + (long long )z$r_buff0_thd0 >= 0LL) && (long long )x + (long long )z$r_buff0_thd1 >= 0LL) && (long long )x + (long long )z$r_buff0_thd2 >= 0LL) && (long long )x + (long long )z$r_buff0_thd3 >= 0LL) && (long long )x + (long long )z$r_buff1_thd0 >= 0LL) && (long long )x + (long long )z$r_buff1_thd1 >= 0LL) && (long long )x + (long long )z$r_buff1_thd2 >= 0LL) && (long long )x + (long long )z$r_buff1_thd3 >= 0LL) && (long long )x + (long long )z$read_delayed >= 0LL) && (long long )x + (long long )z$w_buff0 >= 0LL) && (long long )x + (long long )z$w_buff1 >= 0LL) && (long long )y + (long long )z >= 0LL) && (long long )y + (long long )z$flush_delayed >= 0LL) && (long long )y + (long long )z$mem_tmp >= 0LL) && (long long )y + (long long )z$r_buff0_thd0 >= 0LL) && (long long )y + (long long )z$r_buff0_thd1 >= 0LL) && (long long )y + (long long )z$r_buff0_thd2 >= 0LL) && (long long )y + (long long )z$r_buff0_thd3 >= 0LL) && (long long )y + (long long )z$r_buff1_thd0 >= 0LL) && (long long )y + (long long )z$r_buff1_thd1 >= 0LL) && (long long )y + (long long )z$r_buff1_thd2 >= 0LL) && (long long )y + (long long )z$r_buff1_thd3 >= 0LL) && (long long )y + (long long )z$read_delayed >= 0LL) && (long long )y + (long long )z$w_buff0 >= 0LL) && (long long )y + (long long )z$w_buff1 >= 0LL) && (long long )z + (long long )z$flush_delayed >= 0LL) && (long long )z + (long long )z$mem_tmp >= 0LL) && (long long )z + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z + (long long )z$read_delayed >= 0LL) && (long long )z + (long long )z$w_buff0 >= 0LL) && (long long )z + (long long )z$w_buff1 >= 0LL) && (long long )z$flush_delayed + (long long )z$mem_tmp >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed + (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$flush_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp + (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff0 >= 0LL) && (long long )z$mem_tmp + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff0_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd0 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd1 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd2 + (long long )z$w_buff1 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff0 >= 0LL) && (long long )z$r_buff1_thd3 + (long long )z$w_buff1 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff0 >= 0LL) && (long long )z$read_delayed + (long long )z$w_buff1 >= 0LL) && (long long )z$w_buff0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )z >= 0LL) && (long long )weak$$choice0 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )z >= 0LL) && (long long )weak$$choice2 + (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )z$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )__unbuffered_p3_EBX >= 0LL) && (1LL + (long long )__unbuffered_p3_EAX) - (long long )a >= 0LL) && (1LL + (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff0_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd1) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p3_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )a) - (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )a) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p3_EBX) - (long long )a >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )z$read_delayed >= 0LL) && (long long )a - (long long )z$r_buff0_thd0 >= 0LL) && (long long )a - (long long )z$r_buff0_thd1 >= 0LL) && (long long )a - (long long )z$r_buff0_thd2 >= 0LL) && (long long )a - (long long )z$r_buff0_thd3 >= 0LL) && (long long )a - (long long )z$r_buff1_thd0 >= 0LL) && (long long )a - (long long )z$r_buff1_thd1 >= 0LL) && (long long )a - (long long )z$r_buff1_thd2 >= 0LL) && (long long )a - (long long )z$r_buff1_thd3 >= 0LL) && (long long )a - (long long )z$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_thd1 >= 0LL) && (long long )x - (long long )z$r_buff0_thd2 >= 0LL) && (long long )x - (long long )z$r_buff0_thd3 >= 0LL) && (long long )x - (long long )z$r_buff1_thd0 >= 0LL) && (long long )x - (long long )z$r_buff1_thd1 >= 0LL) && (long long )x - (long long )z$r_buff1_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_thd1 >= 0LL) && (long long )y - (long long )z$r_buff0_thd2 >= 0LL) && (long long )y - (long long )z$r_buff0_thd3 >= 0LL) && (long long )y - (long long )z$r_buff1_thd0 >= 0LL) && (long long )y - (long long )z$r_buff1_thd1 >= 0LL) && (long long )y - (long long )z$r_buff1_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd1 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p3_EAX) && 0 <= __unbuffered_p3_EBX) && 0 <= a) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p3_EBX <= 1) && a <= 1) && z$w_buff0 <= 127) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd1 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)) && (a == 0 || a == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (0 <= z$mem_tmp && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p3_EBX && __unbuffered_p3_EBX <= 1) && (__unbuffered_p3_EBX == 0 || __unbuffered_p3_EBX == 1)))) && (! multithreaded || (0 <= __unbuffered_p3_EAX && ((__unbuffered_p3_EAX == 0 || __unbuffered_p3_EAX == 1) || __unbuffered_p3_EAX == 2)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || (0 <= z && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || (((0 <= z$w_buff0 && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2)))) && (! multithreaded || (((0 <= z$w_buff1 && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((0 <= y && y <= 2) && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0) [2024-06-14 15:04:29,634 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:04:29,634 INFO L106 edCorrectnessWitness]: ghost_update [L853-L853] multithreaded = 1; [2024-06-14 15:04:29,670 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:04:29,985 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:04:29,994 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:04:30,387 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:04:30,410 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:04:30,411 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30 WrapperNode [2024-06-14 15:04:30,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:04:30,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:04:30,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:04:30,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:04:30,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,585 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 178 [2024-06-14 15:04:30,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:04:30,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:04:30,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:04:30,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:04:30,596 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,632 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,699 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-14 15:04:30,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,756 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,797 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:04:30,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:04:30,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:04:30,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:04:30,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (1/1) ... [2024-06-14 15:04:30,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:04:30,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:04:30,873 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-14 15:04:30,887 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-14 15:04:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:04:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:04:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:04:30,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:04:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:04:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:04:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-14 15:04:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-14 15:04:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-14 15:04:30,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-14 15:04:30,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:04:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:04:30,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:04:30,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:04:30,908 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:04:31,024 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:04:31,027 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:04:32,833 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:04:32,833 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:04:33,197 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:04:33,197 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:04:33,197 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:04:33 BoogieIcfgContainer [2024-06-14 15:04:33,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:04:33,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:04:33,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:04:33,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:04:33,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:04:29" (1/4) ... [2024-06-14 15:04:33,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40608d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:04:33, skipping insertion in model container [2024-06-14 15:04:33,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:04:29" (2/4) ... [2024-06-14 15:04:33,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40608d28 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:04:33, skipping insertion in model container [2024-06-14 15:04:33,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:04:30" (3/4) ... [2024-06-14 15:04:33,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40608d28 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:04:33, skipping insertion in model container [2024-06-14 15:04:33,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:04:33" (4/4) ... [2024-06-14 15:04:33,204 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2024-06-14 15:04:33,218 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:04:33,218 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-14 15:04:33,218 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:04:33,351 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:04:33,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-14 15:04:33,492 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-14 15:04:33,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:04:33,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:04:33,495 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-14 15:04:33,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-14 15:04:33,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:04:33,525 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;@cb2d650, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:04:33,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-14 15:04:33,562 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:04:33,562 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:04:33,562 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:04:33,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:33,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:04:33,564 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:04:33,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash -7406172, now seen corresponding path program 1 times [2024-06-14 15:04:33,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:33,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779229094] [2024-06-14 15:04:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:33,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:40,287 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-14 15:04:40,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:40,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779229094] [2024-06-14 15:04:40,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779229094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:40,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:40,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:04:40,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224476494] [2024-06-14 15:04:40,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:40,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:04:40,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:40,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:04:40,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:04:40,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 53 [2024-06-14 15:04:40,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-14 15:04:40,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:40,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 53 [2024-06-14 15:04:40,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:44,556 INFO L124 PetriNetUnfolderBase]: 9547/13263 cut-off events. [2024-06-14 15:04:44,557 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2024-06-14 15:04:44,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26597 conditions, 13263 events. 9547/13263 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 72462 event pairs, 7308 based on Foata normal form. 1/12896 useless extension candidates. Maximal degree in co-relation 26581. Up to 12953 conditions per place. [2024-06-14 15:04:44,630 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 45 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-14 15:04:44,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 235 flow [2024-06-14 15:04:44,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:04:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:04:44,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-06-14 15:04:44,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5849056603773585 [2024-06-14 15:04:44,641 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 93 transitions. [2024-06-14 15:04:44,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 235 flow [2024-06-14 15:04:44,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-14 15:04:44,648 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-14 15:04:44,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-14 15:04:44,653 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-14 15:04:44,653 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-14 15:04:44,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-14 15:04:44,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:44,654 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:44,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:04:44,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:04:44,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:44,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1472658499, now seen corresponding path program 1 times [2024-06-14 15:04:44,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:44,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099711670] [2024-06-14 15:04:44,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:44,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:49,283 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-14 15:04:49,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:49,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099711670] [2024-06-14 15:04:49,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099711670] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:49,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:49,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:04:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046457029] [2024-06-14 15:04:49,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:49,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:04:49,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:04:49,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:04:49,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:04:49,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-14 15:04:49,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:49,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:04:49,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:04:54,074 INFO L124 PetriNetUnfolderBase]: 10932/14852 cut-off events. [2024-06-14 15:04:54,075 INFO L125 PetriNetUnfolderBase]: For 2898/2898 co-relation queries the response was YES. [2024-06-14 15:04:54,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33867 conditions, 14852 events. 10932/14852 cut-off events. For 2898/2898 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 78429 event pairs, 7512 based on Foata normal form. 4/14848 useless extension candidates. Maximal degree in co-relation 33852. Up to 14763 conditions per place. [2024-06-14 15:04:54,140 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 56 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-14 15:04:54,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 329 flow [2024-06-14 15:04:54,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:04:54,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:04:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-06-14 15:04:54,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5518867924528302 [2024-06-14 15:04:54,142 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 117 transitions. [2024-06-14 15:04:54,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 329 flow [2024-06-14 15:04:54,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 324 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:04:54,149 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-14 15:04:54,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-14 15:04:54,149 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-14 15:04:54,150 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-14 15:04:54,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 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-14 15:04:54,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:04:54,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:04:54,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:04:54,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:04:54,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:04:54,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1592225001, now seen corresponding path program 1 times [2024-06-14 15:04:54,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:04:54,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557902216] [2024-06-14 15:04:54,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:04:54,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:04:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:04:59,594 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-14 15:04:59,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:04:59,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557902216] [2024-06-14 15:04:59,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557902216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:04:59,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:04:59,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:04:59,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308820750] [2024-06-14 15:04:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:04:59,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:04:59,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:04:59,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:04:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:04:59,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:04:59,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-14 15:04:59,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:04:59,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:04:59,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:03,957 INFO L124 PetriNetUnfolderBase]: 10950/14933 cut-off events. [2024-06-14 15:05:03,957 INFO L125 PetriNetUnfolderBase]: For 8377/8377 co-relation queries the response was YES. [2024-06-14 15:05:03,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37815 conditions, 14933 events. 10950/14933 cut-off events. For 8377/8377 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 79621 event pairs, 5910 based on Foata normal form. 7/14935 useless extension candidates. Maximal degree in co-relation 37798. Up to 14684 conditions per place. [2024-06-14 15:05:04,021 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 74 selfloop transitions, 21 changer transitions 0/101 dead transitions. [2024-06-14 15:05:04,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 101 transitions, 545 flow [2024-06-14 15:05:04,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:05:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:05:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2024-06-14 15:05:04,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5773584905660377 [2024-06-14 15:05:04,023 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 5 states and 153 transitions. [2024-06-14 15:05:04,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 101 transitions, 545 flow [2024-06-14 15:05:04,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 101 transitions, 526 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-14 15:05:04,027 INFO L231 Difference]: Finished difference. Result has 63 places, 65 transitions, 312 flow [2024-06-14 15:05:04,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=63, PETRI_TRANSITIONS=65} [2024-06-14 15:05:04,027 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-14 15:05:04,028 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 65 transitions, 312 flow [2024-06-14 15:05:04,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-14 15:05:04,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:04,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:04,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:05:04,028 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:05:04,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1119810410, now seen corresponding path program 1 times [2024-06-14 15:05:04,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988389262] [2024-06-14 15:05:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:04,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:09,177 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-14 15:05:09,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:09,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988389262] [2024-06-14 15:05:09,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988389262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:09,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:09,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:05:09,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021499281] [2024-06-14 15:05:09,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:09,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:05:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:09,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:05:09,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:05:09,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:05:09,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 65 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:09,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:09,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:05:09,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:13,935 INFO L124 PetriNetUnfolderBase]: 10979/14976 cut-off events. [2024-06-14 15:05:13,935 INFO L125 PetriNetUnfolderBase]: For 19963/19969 co-relation queries the response was YES. [2024-06-14 15:05:13,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44209 conditions, 14976 events. 10979/14976 cut-off events. For 19963/19969 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 79733 event pairs, 4816 based on Foata normal form. 18/14989 useless extension candidates. Maximal degree in co-relation 44189. Up to 14649 conditions per place. [2024-06-14 15:05:14,003 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 81 selfloop transitions, 25 changer transitions 0/112 dead transitions. [2024-06-14 15:05:14,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 112 transitions, 690 flow [2024-06-14 15:05:14,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:05:14,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:05:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 176 transitions. [2024-06-14 15:05:14,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5534591194968553 [2024-06-14 15:05:14,006 INFO L175 Difference]: Start difference. First operand has 63 places, 65 transitions, 312 flow. Second operand 6 states and 176 transitions. [2024-06-14 15:05:14,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 112 transitions, 690 flow [2024-06-14 15:05:14,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 112 transitions, 678 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-06-14 15:05:14,012 INFO L231 Difference]: Finished difference. Result has 68 places, 68 transitions, 389 flow [2024-06-14 15:05:14,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=389, PETRI_PLACES=68, PETRI_TRANSITIONS=68} [2024-06-14 15:05:14,013 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2024-06-14 15:05:14,013 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 68 transitions, 389 flow [2024-06-14 15:05:14,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:05:14,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:14,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:14,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:05:14,014 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:05:14,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:14,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1999637521, now seen corresponding path program 1 times [2024-06-14 15:05:14,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:14,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689386795] [2024-06-14 15:05:14,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:14,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:27,288 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-14 15:05:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:27,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689386795] [2024-06-14 15:05:27,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689386795] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:27,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:27,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:05:27,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756663987] [2024-06-14 15:05:27,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:27,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:05:27,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:27,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:05:27,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:05:27,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:05:27,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 68 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-14 15:05:27,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:27,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:05:27,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:31,465 INFO L124 PetriNetUnfolderBase]: 9575/13374 cut-off events. [2024-06-14 15:05:31,466 INFO L125 PetriNetUnfolderBase]: For 25662/25662 co-relation queries the response was YES. [2024-06-14 15:05:31,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42756 conditions, 13374 events. 9575/13374 cut-off events. For 25662/25662 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 73913 event pairs, 4948 based on Foata normal form. 3/13207 useless extension candidates. Maximal degree in co-relation 42733. Up to 12980 conditions per place. [2024-06-14 15:05:31,535 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 68 selfloop transitions, 10 changer transitions 0/85 dead transitions. [2024-06-14 15:05:31,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 589 flow [2024-06-14 15:05:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:05:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:05:31,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2024-06-14 15:05:31,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4641509433962264 [2024-06-14 15:05:31,537 INFO L175 Difference]: Start difference. First operand has 68 places, 68 transitions, 389 flow. Second operand 5 states and 123 transitions. [2024-06-14 15:05:31,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 589 flow [2024-06-14 15:05:31,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 520 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-14 15:05:31,546 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 351 flow [2024-06-14 15:05:31,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=351, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2024-06-14 15:05:31,547 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 13 predicate places. [2024-06-14 15:05:31,547 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 351 flow [2024-06-14 15:05:31,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-14 15:05:31,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:31,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:31,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:05:31,548 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:05:31,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:31,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1858991889, now seen corresponding path program 1 times [2024-06-14 15:05:31,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313103730] [2024-06-14 15:05:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:05:45,949 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-14 15:05:45,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:05:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313103730] [2024-06-14 15:05:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313103730] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:05:45,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:05:45,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:05:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868678775] [2024-06-14 15:05:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:05:45,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:05:45,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:05:45,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:05:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:05:46,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:05:46,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 351 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-14 15:05:46,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:05:46,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:05:46,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:05:50,347 INFO L124 PetriNetUnfolderBase]: 9587/13403 cut-off events. [2024-06-14 15:05:50,348 INFO L125 PetriNetUnfolderBase]: For 29621/29621 co-relation queries the response was YES. [2024-06-14 15:05:50,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43517 conditions, 13403 events. 9587/13403 cut-off events. For 29621/29621 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 73691 event pairs, 4728 based on Foata normal form. 5/13259 useless extension candidates. Maximal degree in co-relation 43492. Up to 12930 conditions per place. [2024-06-14 15:05:50,417 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 81 selfloop transitions, 22 changer transitions 0/110 dead transitions. [2024-06-14 15:05:50,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 110 transitions, 751 flow [2024-06-14 15:05:50,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:05:50,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:05:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-06-14 15:05:50,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48427672955974843 [2024-06-14 15:05:50,419 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 351 flow. Second operand 6 states and 154 transitions. [2024-06-14 15:05:50,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 110 transitions, 751 flow [2024-06-14 15:05:50,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 110 transitions, 722 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:05:50,429 INFO L231 Difference]: Finished difference. Result has 73 places, 82 transitions, 496 flow [2024-06-14 15:05:50,429 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=496, PETRI_PLACES=73, PETRI_TRANSITIONS=82} [2024-06-14 15:05:50,430 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 17 predicate places. [2024-06-14 15:05:50,430 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 82 transitions, 496 flow [2024-06-14 15:05:50,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 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-14 15:05:50,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:05:50,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:05:50,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:05:50,431 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:05:50,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:05:50,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1794853668, now seen corresponding path program 1 times [2024-06-14 15:05:50,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:05:50,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143390976] [2024-06-14 15:05:50,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:05:50,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:05:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:04,773 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-14 15:06:04,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:04,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143390976] [2024-06-14 15:06:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143390976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:04,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:06:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962941797] [2024-06-14 15:06:04,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:04,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:06:04,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:04,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:06:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:06:04,961 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:06:04,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 496 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:04,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:04,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:06:04,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:09,675 INFO L124 PetriNetUnfolderBase]: 10995/14966 cut-off events. [2024-06-14 15:06:09,675 INFO L125 PetriNetUnfolderBase]: For 53023/53035 co-relation queries the response was YES. [2024-06-14 15:06:09,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54965 conditions, 14966 events. 10995/14966 cut-off events. For 53023/53035 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 78908 event pairs, 5541 based on Foata normal form. 14/14975 useless extension candidates. Maximal degree in co-relation 54938. Up to 14743 conditions per place. [2024-06-14 15:06:09,747 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 85 selfloop transitions, 25 changer transitions 0/116 dead transitions. [2024-06-14 15:06:09,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 116 transitions, 859 flow [2024-06-14 15:06:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:06:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:06:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-06-14 15:06:09,748 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748427672955975 [2024-06-14 15:06:09,748 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 496 flow. Second operand 6 states and 151 transitions. [2024-06-14 15:06:09,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 116 transitions, 859 flow [2024-06-14 15:06:09,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 835 flow, removed 11 selfloop flow, removed 1 redundant places. [2024-06-14 15:06:09,770 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 568 flow [2024-06-14 15:06:09,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2024-06-14 15:06:09,771 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 22 predicate places. [2024-06-14 15:06:09,771 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 568 flow [2024-06-14 15:06:09,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:09,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:09,771 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:09,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:06:09,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:06:09,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:09,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1801317168, now seen corresponding path program 2 times [2024-06-14 15:06:09,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:09,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087394764] [2024-06-14 15:06:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:23,895 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-14 15:06:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:23,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087394764] [2024-06-14 15:06:23,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087394764] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:23,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:23,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:06:23,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721208634] [2024-06-14 15:06:23,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:23,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:06:23,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:23,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:06:23,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:06:24,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:06:24,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 568 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:24,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:24,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:06:24,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:28,670 INFO L124 PetriNetUnfolderBase]: 10971/14918 cut-off events. [2024-06-14 15:06:28,671 INFO L125 PetriNetUnfolderBase]: For 59044/59048 co-relation queries the response was YES. [2024-06-14 15:06:28,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55438 conditions, 14918 events. 10971/14918 cut-off events. For 59044/59048 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 78596 event pairs, 5561 based on Foata normal form. 4/14911 useless extension candidates. Maximal degree in co-relation 55408. Up to 14713 conditions per place. [2024-06-14 15:06:28,762 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 78 selfloop transitions, 26 changer transitions 0/110 dead transitions. [2024-06-14 15:06:28,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 110 transitions, 838 flow [2024-06-14 15:06:28,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:06:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:06:28,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 146 transitions. [2024-06-14 15:06:28,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591194968553459 [2024-06-14 15:06:28,764 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 568 flow. Second operand 6 states and 146 transitions. [2024-06-14 15:06:28,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 110 transitions, 838 flow [2024-06-14 15:06:28,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 110 transitions, 795 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-14 15:06:28,802 INFO L231 Difference]: Finished difference. Result has 81 places, 86 transitions, 588 flow [2024-06-14 15:06:28,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=81, PETRI_TRANSITIONS=86} [2024-06-14 15:06:28,802 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 25 predicate places. [2024-06-14 15:06:28,803 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 588 flow [2024-06-14 15:06:28,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:28,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:28,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:28,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:06:28,803 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:06:28,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1373622574, now seen corresponding path program 1 times [2024-06-14 15:06:28,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:28,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659429296] [2024-06-14 15:06:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:28,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:06:43,004 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-14 15:06:43,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:06:43,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659429296] [2024-06-14 15:06:43,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659429296] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:06:43,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:06:43,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:06:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037021991] [2024-06-14 15:06:43,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:06:43,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:06:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:06:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:06:43,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:06:43,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:06:43,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 588 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:43,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:06:43,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:06:43,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:06:48,282 INFO L124 PetriNetUnfolderBase]: 11509/15699 cut-off events. [2024-06-14 15:06:48,282 INFO L125 PetriNetUnfolderBase]: For 74540/74543 co-relation queries the response was YES. [2024-06-14 15:06:48,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59971 conditions, 15699 events. 11509/15699 cut-off events. For 74540/74543 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 84225 event pairs, 4900 based on Foata normal form. 12/15700 useless extension candidates. Maximal degree in co-relation 59940. Up to 14734 conditions per place. [2024-06-14 15:06:48,367 INFO L140 encePairwiseOnDemand]: 36/53 looper letters, 124 selfloop transitions, 59 changer transitions 0/189 dead transitions. [2024-06-14 15:06:48,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 189 transitions, 1668 flow [2024-06-14 15:06:48,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:06:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:06:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 215 transitions. [2024-06-14 15:06:48,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5070754716981132 [2024-06-14 15:06:48,371 INFO L175 Difference]: Start difference. First operand has 81 places, 86 transitions, 588 flow. Second operand 8 states and 215 transitions. [2024-06-14 15:06:48,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 189 transitions, 1668 flow [2024-06-14 15:06:48,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 189 transitions, 1505 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:06:48,410 INFO L231 Difference]: Finished difference. Result has 86 places, 122 transitions, 939 flow [2024-06-14 15:06:48,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=939, PETRI_PLACES=86, PETRI_TRANSITIONS=122} [2024-06-14 15:06:48,410 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 30 predicate places. [2024-06-14 15:06:48,410 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 122 transitions, 939 flow [2024-06-14 15:06:48,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:06:48,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:06:48,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:06:48,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:06:48,411 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:06:48,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:06:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1691358724, now seen corresponding path program 2 times [2024-06-14 15:06:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:06:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168159401] [2024-06-14 15:06:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:06:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:06:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:03,361 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-14 15:07:03,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:03,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168159401] [2024-06-14 15:07:03,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168159401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:03,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:03,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:07:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647937985] [2024-06-14 15:07:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:03,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:07:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:07:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:07:03,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:07:03,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 122 transitions, 939 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:03,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:03,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:07:03,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:08,998 INFO L124 PetriNetUnfolderBase]: 11857/16208 cut-off events. [2024-06-14 15:07:08,998 INFO L125 PetriNetUnfolderBase]: For 106986/106995 co-relation queries the response was YES. [2024-06-14 15:07:09,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70951 conditions, 16208 events. 11857/16208 cut-off events. For 106986/106995 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 87287 event pairs, 5037 based on Foata normal form. 24/16221 useless extension candidates. Maximal degree in co-relation 70916. Up to 15002 conditions per place. [2024-06-14 15:07:09,083 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 103 selfloop transitions, 81 changer transitions 0/190 dead transitions. [2024-06-14 15:07:09,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 190 transitions, 1811 flow [2024-06-14 15:07:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:07:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:07:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 185 transitions. [2024-06-14 15:07:09,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49865229110512127 [2024-06-14 15:07:09,087 INFO L175 Difference]: Start difference. First operand has 86 places, 122 transitions, 939 flow. Second operand 7 states and 185 transitions. [2024-06-14 15:07:09,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 190 transitions, 1811 flow [2024-06-14 15:07:09,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 190 transitions, 1717 flow, removed 38 selfloop flow, removed 2 redundant places. [2024-06-14 15:07:09,144 INFO L231 Difference]: Finished difference. Result has 93 places, 143 transitions, 1312 flow [2024-06-14 15:07:09,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1312, PETRI_PLACES=93, PETRI_TRANSITIONS=143} [2024-06-14 15:07:09,145 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 37 predicate places. [2024-06-14 15:07:09,145 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 143 transitions, 1312 flow [2024-06-14 15:07:09,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:09,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:09,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:09,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:07:09,146 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:07:09,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:09,146 INFO L85 PathProgramCache]: Analyzing trace with hash 6496032, now seen corresponding path program 3 times [2024-06-14 15:07:09,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:09,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312318910] [2024-06-14 15:07:09,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:24,701 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-14 15:07:24,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:24,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312318910] [2024-06-14 15:07:24,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312318910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:24,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:24,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:07:24,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529629313] [2024-06-14 15:07:24,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:24,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:07:24,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:24,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:07:24,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:07:24,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:07:24,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 143 transitions, 1312 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:24,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:24,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:07:24,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:30,330 INFO L124 PetriNetUnfolderBase]: 11974/16390 cut-off events. [2024-06-14 15:07:30,330 INFO L125 PetriNetUnfolderBase]: For 140687/140706 co-relation queries the response was YES. [2024-06-14 15:07:30,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78348 conditions, 16390 events. 11974/16390 cut-off events. For 140687/140706 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 88491 event pairs, 5045 based on Foata normal form. 21/16389 useless extension candidates. Maximal degree in co-relation 78309. Up to 15079 conditions per place. [2024-06-14 15:07:30,422 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 100 selfloop transitions, 108 changer transitions 0/214 dead transitions. [2024-06-14 15:07:30,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 214 transitions, 2354 flow [2024-06-14 15:07:30,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:07:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:07:30,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 184 transitions. [2024-06-14 15:07:30,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49595687331536387 [2024-06-14 15:07:30,429 INFO L175 Difference]: Start difference. First operand has 93 places, 143 transitions, 1312 flow. Second operand 7 states and 184 transitions. [2024-06-14 15:07:30,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 214 transitions, 2354 flow [2024-06-14 15:07:30,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 214 transitions, 2221 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-14 15:07:30,517 INFO L231 Difference]: Finished difference. Result has 99 places, 168 transitions, 1806 flow [2024-06-14 15:07:30,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1806, PETRI_PLACES=99, PETRI_TRANSITIONS=168} [2024-06-14 15:07:30,518 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 43 predicate places. [2024-06-14 15:07:30,518 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 168 transitions, 1806 flow [2024-06-14 15:07:30,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:30,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:30,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:30,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:07:30,519 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:07:30,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:30,519 INFO L85 PathProgramCache]: Analyzing trace with hash -215386158, now seen corresponding path program 4 times [2024-06-14 15:07:30,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:30,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394769627] [2024-06-14 15:07:30,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:30,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:07:45,597 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-14 15:07:45,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:07:45,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394769627] [2024-06-14 15:07:45,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394769627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:07:45,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:07:45,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:07:45,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204932260] [2024-06-14 15:07:45,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:07:45,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:07:45,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:07:45,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:07:45,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:07:45,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:07:45,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 168 transitions, 1806 flow. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:45,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:07:45,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:07:45,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:07:51,255 INFO L124 PetriNetUnfolderBase]: 11954/16355 cut-off events. [2024-06-14 15:07:51,256 INFO L125 PetriNetUnfolderBase]: For 173412/173425 co-relation queries the response was YES. [2024-06-14 15:07:51,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83114 conditions, 16355 events. 11954/16355 cut-off events. For 173412/173425 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 88202 event pairs, 5069 based on Foata normal form. 16/16349 useless extension candidates. Maximal degree in co-relation 83072. Up to 15072 conditions per place. [2024-06-14 15:07:51,361 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 106 selfloop transitions, 100 changer transitions 0/212 dead transitions. [2024-06-14 15:07:51,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 212 transitions, 2546 flow [2024-06-14 15:07:51,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:07:51,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:07:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 182 transitions. [2024-06-14 15:07:51,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49056603773584906 [2024-06-14 15:07:51,365 INFO L175 Difference]: Start difference. First operand has 99 places, 168 transitions, 1806 flow. Second operand 7 states and 182 transitions. [2024-06-14 15:07:51,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 212 transitions, 2546 flow [2024-06-14 15:07:51,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 212 transitions, 2452 flow, removed 46 selfloop flow, removed 1 redundant places. [2024-06-14 15:07:51,498 INFO L231 Difference]: Finished difference. Result has 105 places, 168 transitions, 1932 flow [2024-06-14 15:07:51,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1716, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1932, PETRI_PLACES=105, PETRI_TRANSITIONS=168} [2024-06-14 15:07:51,499 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 49 predicate places. [2024-06-14 15:07:51,499 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 168 transitions, 1932 flow [2024-06-14 15:07:51,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 8 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:07:51,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:07:51,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:07:51,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:07:51,500 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:07:51,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:07:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1932294494, now seen corresponding path program 1 times [2024-06-14 15:07:51,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:07:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868528637] [2024-06-14 15:07:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:07:51,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:07:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:07,313 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-14 15:08:07,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:07,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868528637] [2024-06-14 15:08:07,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868528637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:07,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:07,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:08:07,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694272856] [2024-06-14 15:08:07,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:07,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:08:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:07,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:08:07,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:08:07,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:08:07,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 168 transitions, 1932 flow. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-14 15:08:07,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:07,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:08:07,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:12,460 INFO L124 PetriNetUnfolderBase]: 10579/14723 cut-off events. [2024-06-14 15:08:12,460 INFO L125 PetriNetUnfolderBase]: For 151847/151852 co-relation queries the response was YES. [2024-06-14 15:08:12,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74208 conditions, 14723 events. 10579/14723 cut-off events. For 151847/151852 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 81168 event pairs, 4299 based on Foata normal form. 12/14656 useless extension candidates. Maximal degree in co-relation 74163. Up to 14195 conditions per place. [2024-06-14 15:08:12,574 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 175 selfloop transitions, 26 changer transitions 0/208 dead transitions. [2024-06-14 15:08:12,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 208 transitions, 2584 flow [2024-06-14 15:08:12,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:08:12,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:08:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 178 transitions. [2024-06-14 15:08:12,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4797843665768194 [2024-06-14 15:08:12,576 INFO L175 Difference]: Start difference. First operand has 105 places, 168 transitions, 1932 flow. Second operand 7 states and 178 transitions. [2024-06-14 15:08:12,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 208 transitions, 2584 flow [2024-06-14 15:08:12,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 208 transitions, 2353 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-14 15:08:12,691 INFO L231 Difference]: Finished difference. Result has 106 places, 172 transitions, 1818 flow [2024-06-14 15:08:12,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1701, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1818, PETRI_PLACES=106, PETRI_TRANSITIONS=172} [2024-06-14 15:08:12,691 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2024-06-14 15:08:12,691 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 172 transitions, 1818 flow [2024-06-14 15:08:12,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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-14 15:08:12,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:12,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:12,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:08:12,692 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:08:12,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1437426046, now seen corresponding path program 1 times [2024-06-14 15:08:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107449714] [2024-06-14 15:08:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:28,799 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-14 15:08:28,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:28,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107449714] [2024-06-14 15:08:28,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107449714] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:28,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:28,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:08:28,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719351574] [2024-06-14 15:08:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:28,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:08:28,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:08:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:08:28,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:08:28,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 172 transitions, 1818 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-14 15:08:28,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:28,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:08:28,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:33,640 INFO L124 PetriNetUnfolderBase]: 10572/14710 cut-off events. [2024-06-14 15:08:33,640 INFO L125 PetriNetUnfolderBase]: For 164746/164748 co-relation queries the response was YES. [2024-06-14 15:08:33,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75916 conditions, 14710 events. 10572/14710 cut-off events. For 164746/164748 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 80937 event pairs, 4456 based on Foata normal form. 2/14631 useless extension candidates. Maximal degree in co-relation 75871. Up to 14310 conditions per place. [2024-06-14 15:08:33,733 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 169 selfloop transitions, 10 changer transitions 0/186 dead transitions. [2024-06-14 15:08:33,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 186 transitions, 2220 flow [2024-06-14 15:08:33,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:08:33,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:08:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-06-14 15:08:33,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4490566037735849 [2024-06-14 15:08:33,734 INFO L175 Difference]: Start difference. First operand has 106 places, 172 transitions, 1818 flow. Second operand 5 states and 119 transitions. [2024-06-14 15:08:33,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 186 transitions, 2220 flow [2024-06-14 15:08:33,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 186 transitions, 2125 flow, removed 24 selfloop flow, removed 5 redundant places. [2024-06-14 15:08:33,832 INFO L231 Difference]: Finished difference. Result has 106 places, 172 transitions, 1752 flow [2024-06-14 15:08:33,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1723, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1752, PETRI_PLACES=106, PETRI_TRANSITIONS=172} [2024-06-14 15:08:33,833 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 50 predicate places. [2024-06-14 15:08:33,833 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 172 transitions, 1752 flow [2024-06-14 15:08:33,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-14 15:08:33,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:33,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:33,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:08:33,834 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:08:33,834 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:33,834 INFO L85 PathProgramCache]: Analyzing trace with hash -975329656, now seen corresponding path program 1 times [2024-06-14 15:08:33,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:33,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20910819] [2024-06-14 15:08:33,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:33,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:08:49,349 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-14 15:08:49,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:08:49,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20910819] [2024-06-14 15:08:49,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20910819] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:08:49,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:08:49,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:08:49,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946338434] [2024-06-14 15:08:49,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:08:49,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:08:49,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:08:49,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:08:49,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:08:49,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:08:49,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 172 transitions, 1752 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:49,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:08:49,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:08:49,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:08:55,267 INFO L124 PetriNetUnfolderBase]: 12053/16534 cut-off events. [2024-06-14 15:08:55,267 INFO L125 PetriNetUnfolderBase]: For 208389/208404 co-relation queries the response was YES. [2024-06-14 15:08:55,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86039 conditions, 16534 events. 12053/16534 cut-off events. For 208389/208404 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 89576 event pairs, 5134 based on Foata normal form. 24/16547 useless extension candidates. Maximal degree in co-relation 85993. Up to 15181 conditions per place. [2024-06-14 15:08:55,372 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 118 selfloop transitions, 112 changer transitions 0/236 dead transitions. [2024-06-14 15:08:55,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 236 transitions, 2798 flow [2024-06-14 15:08:55,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:08:55,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:08:55,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-06-14 15:08:55,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5040431266846361 [2024-06-14 15:08:55,375 INFO L175 Difference]: Start difference. First operand has 106 places, 172 transitions, 1752 flow. Second operand 7 states and 187 transitions. [2024-06-14 15:08:55,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 236 transitions, 2798 flow [2024-06-14 15:08:55,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 236 transitions, 2765 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-14 15:08:55,499 INFO L231 Difference]: Finished difference. Result has 110 places, 188 transitions, 2215 flow [2024-06-14 15:08:55,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1719, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2215, PETRI_PLACES=110, PETRI_TRANSITIONS=188} [2024-06-14 15:08:55,500 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 54 predicate places. [2024-06-14 15:08:55,500 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 188 transitions, 2215 flow [2024-06-14 15:08:55,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:08:55,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:08:55,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:08:55,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:08:55,500 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:08:55,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:08:55,501 INFO L85 PathProgramCache]: Analyzing trace with hash 892514228, now seen corresponding path program 2 times [2024-06-14 15:08:55,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:08:55,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373120125] [2024-06-14 15:08:55,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:08:55,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:08:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:11,093 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-14 15:09:11,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:11,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373120125] [2024-06-14 15:09:11,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373120125] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:11,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:11,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:11,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829862256] [2024-06-14 15:09:11,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:11,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:11,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:11,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:11,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:11,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:09:11,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 188 transitions, 2215 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:11,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:11,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:09:11,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:16,989 INFO L124 PetriNetUnfolderBase]: 12133/16678 cut-off events. [2024-06-14 15:09:16,989 INFO L125 PetriNetUnfolderBase]: For 241621/241650 co-relation queries the response was YES. [2024-06-14 15:09:17,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91086 conditions, 16678 events. 12133/16678 cut-off events. For 241621/241650 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 90964 event pairs, 5122 based on Foata normal form. 36/16703 useless extension candidates. Maximal degree in co-relation 91039. Up to 15259 conditions per place. [2024-06-14 15:09:17,099 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 117 selfloop transitions, 117 changer transitions 0/240 dead transitions. [2024-06-14 15:09:17,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 240 transitions, 3133 flow [2024-06-14 15:09:17,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-14 15:09:17,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48787061994609165 [2024-06-14 15:09:17,111 INFO L175 Difference]: Start difference. First operand has 110 places, 188 transitions, 2215 flow. Second operand 7 states and 181 transitions. [2024-06-14 15:09:17,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 240 transitions, 3133 flow [2024-06-14 15:09:17,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 240 transitions, 2976 flow, removed 22 selfloop flow, removed 3 redundant places. [2024-06-14 15:09:17,305 INFO L231 Difference]: Finished difference. Result has 114 places, 197 transitions, 2452 flow [2024-06-14 15:09:17,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2066, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2452, PETRI_PLACES=114, PETRI_TRANSITIONS=197} [2024-06-14 15:09:17,305 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 58 predicate places. [2024-06-14 15:09:17,305 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 197 transitions, 2452 flow [2024-06-14 15:09:17,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:17,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:17,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:17,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:09:17,306 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:09:17,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash 201378328, now seen corresponding path program 3 times [2024-06-14 15:09:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:17,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782432491] [2024-06-14 15:09:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:17,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:32,909 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-14 15:09:32,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:32,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782432491] [2024-06-14 15:09:32,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782432491] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:32,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:32,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:32,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184019247] [2024-06-14 15:09:32,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:32,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:32,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:32,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:32,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:33,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:09:33,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 197 transitions, 2452 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:33,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:33,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:09:33,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:09:38,700 INFO L124 PetriNetUnfolderBase]: 12148/16716 cut-off events. [2024-06-14 15:09:38,700 INFO L125 PetriNetUnfolderBase]: For 270698/270789 co-relation queries the response was YES. [2024-06-14 15:09:38,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93176 conditions, 16716 events. 12148/16716 cut-off events. For 270698/270789 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 91196 event pairs, 5169 based on Foata normal form. 68/16740 useless extension candidates. Maximal degree in co-relation 93128. Up to 15282 conditions per place. [2024-06-14 15:09:38,815 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 113 selfloop transitions, 124 changer transitions 0/243 dead transitions. [2024-06-14 15:09:38,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 243 transitions, 3270 flow [2024-06-14 15:09:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:09:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:09:38,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 175 transitions. [2024-06-14 15:09:38,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2024-06-14 15:09:38,818 INFO L175 Difference]: Start difference. First operand has 114 places, 197 transitions, 2452 flow. Second operand 7 states and 175 transitions. [2024-06-14 15:09:38,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 243 transitions, 3270 flow [2024-06-14 15:09:39,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 243 transitions, 3064 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-14 15:09:39,011 INFO L231 Difference]: Finished difference. Result has 117 places, 206 transitions, 2662 flow [2024-06-14 15:09:39,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2254, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2662, PETRI_PLACES=117, PETRI_TRANSITIONS=206} [2024-06-14 15:09:39,012 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 61 predicate places. [2024-06-14 15:09:39,012 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 206 transitions, 2662 flow [2024-06-14 15:09:39,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:09:39,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:09:39,012 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:09:39,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:09:39,013 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:09:39,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:09:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1610535754, now seen corresponding path program 1 times [2024-06-14 15:09:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:09:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262850967] [2024-06-14 15:09:39,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:09:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:09:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:09:58,479 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-14 15:09:58,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:09:58,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262850967] [2024-06-14 15:09:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262850967] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:09:58,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:09:58,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:09:58,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513449472] [2024-06-14 15:09:58,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:09:58,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:09:58,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:09:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:09:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:09:58,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:09:58,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 206 transitions, 2662 flow. Second operand has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-14 15:09:58,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:09:58,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:09:58,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:03,766 INFO L124 PetriNetUnfolderBase]: 10739/15250 cut-off events. [2024-06-14 15:10:03,766 INFO L125 PetriNetUnfolderBase]: For 256982/256984 co-relation queries the response was YES. [2024-06-14 15:10:03,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85592 conditions, 15250 events. 10739/15250 cut-off events. For 256982/256984 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 86231 event pairs, 4440 based on Foata normal form. 4/15235 useless extension candidates. Maximal degree in co-relation 85543. Up to 14517 conditions per place. [2024-06-14 15:10:03,882 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 208 selfloop transitions, 14 changer transitions 0/229 dead transitions. [2024-06-14 15:10:03,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 229 transitions, 3206 flow [2024-06-14 15:10:03,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:10:03,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:10:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-06-14 15:10:03,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44025157232704404 [2024-06-14 15:10:03,883 INFO L175 Difference]: Start difference. First operand has 117 places, 206 transitions, 2662 flow. Second operand 6 states and 140 transitions. [2024-06-14 15:10:03,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 229 transitions, 3206 flow [2024-06-14 15:10:04,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 229 transitions, 2994 flow, removed 22 selfloop flow, removed 4 redundant places. [2024-06-14 15:10:04,094 INFO L231 Difference]: Finished difference. Result has 119 places, 210 transitions, 2537 flow [2024-06-14 15:10:04,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2450, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2537, PETRI_PLACES=119, PETRI_TRANSITIONS=210} [2024-06-14 15:10:04,094 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 63 predicate places. [2024-06-14 15:10:04,094 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 210 transitions, 2537 flow [2024-06-14 15:10:04,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.75) internal successors, (110), 8 states have internal predecessors, (110), 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-14 15:10:04,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:04,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:04,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-14 15:10:04,095 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:10:04,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:04,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1779812775, now seen corresponding path program 1 times [2024-06-14 15:10:04,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:04,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673221806] [2024-06-14 15:10:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:04,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:20,780 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-14 15:10:20,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:20,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673221806] [2024-06-14 15:10:20,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673221806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:20,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:20,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:10:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196947157] [2024-06-14 15:10:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:20,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:10:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:10:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:10:20,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:10:20,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 210 transitions, 2537 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:20,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:20,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:10:20,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:26,571 INFO L124 PetriNetUnfolderBase]: 12170/16725 cut-off events. [2024-06-14 15:10:26,571 INFO L125 PetriNetUnfolderBase]: For 319594/319632 co-relation queries the response was YES. [2024-06-14 15:10:26,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97361 conditions, 16725 events. 12170/16725 cut-off events. For 319594/319632 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 90296 event pairs, 3970 based on Foata normal form. 38/16758 useless extension candidates. Maximal degree in co-relation 97310. Up to 16039 conditions per place. [2024-06-14 15:10:26,692 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 209 selfloop transitions, 41 changer transitions 0/256 dead transitions. [2024-06-14 15:10:26,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 256 transitions, 3383 flow [2024-06-14 15:10:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:10:26,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:10:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-14 15:10:26,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46630727762803237 [2024-06-14 15:10:26,696 INFO L175 Difference]: Start difference. First operand has 119 places, 210 transitions, 2537 flow. Second operand 7 states and 173 transitions. [2024-06-14 15:10:26,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 256 transitions, 3383 flow [2024-06-14 15:10:26,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 256 transitions, 3326 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-14 15:10:26,912 INFO L231 Difference]: Finished difference. Result has 122 places, 216 transitions, 2694 flow [2024-06-14 15:10:26,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2480, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2694, PETRI_PLACES=122, PETRI_TRANSITIONS=216} [2024-06-14 15:10:26,913 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 66 predicate places. [2024-06-14 15:10:26,913 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 216 transitions, 2694 flow [2024-06-14 15:10:26,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:26,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:26,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:26,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-14 15:10:26,913 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:10:26,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:26,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1579307851, now seen corresponding path program 2 times [2024-06-14 15:10:26,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:26,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002535867] [2024-06-14 15:10:26,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:26,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:10:43,293 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-14 15:10:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:10:43,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002535867] [2024-06-14 15:10:43,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002535867] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:10:43,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:10:43,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:10:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890159803] [2024-06-14 15:10:43,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:10:43,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:10:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:10:43,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:10:43,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:10:43,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:10:43,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 216 transitions, 2694 flow. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:43,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:10:43,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:10:43,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:10:49,092 INFO L124 PetriNetUnfolderBase]: 12155/16695 cut-off events. [2024-06-14 15:10:49,092 INFO L125 PetriNetUnfolderBase]: For 352826/352848 co-relation queries the response was YES. [2024-06-14 15:10:49,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100131 conditions, 16695 events. 12155/16695 cut-off events. For 352826/352848 co-relation queries the response was YES. Maximal size of possible extension queue 536. Compared 90100 event pairs, 4724 based on Foata normal form. 22/16712 useless extension candidates. Maximal degree in co-relation 100079. Up to 16154 conditions per place. [2024-06-14 15:10:49,211 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 208 selfloop transitions, 40 changer transitions 0/254 dead transitions. [2024-06-14 15:10:49,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 254 transitions, 3320 flow [2024-06-14 15:10:49,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:10:49,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:10:49,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2024-06-14 15:10:49,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4582210242587601 [2024-06-14 15:10:49,215 INFO L175 Difference]: Start difference. First operand has 122 places, 216 transitions, 2694 flow. Second operand 7 states and 170 transitions. [2024-06-14 15:10:49,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 254 transitions, 3320 flow [2024-06-14 15:10:49,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 254 transitions, 3188 flow, removed 49 selfloop flow, removed 3 redundant places. [2024-06-14 15:10:49,509 INFO L231 Difference]: Finished difference. Result has 126 places, 216 transitions, 2654 flow [2024-06-14 15:10:49,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2562, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2654, PETRI_PLACES=126, PETRI_TRANSITIONS=216} [2024-06-14 15:10:49,510 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places. [2024-06-14 15:10:49,510 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 216 transitions, 2654 flow [2024-06-14 15:10:49,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 8 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:10:49,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:10:49,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:10:49,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-14 15:10:49,510 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:10:49,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:10:49,511 INFO L85 PathProgramCache]: Analyzing trace with hash -170266973, now seen corresponding path program 1 times [2024-06-14 15:10:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:10:49,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471584091] [2024-06-14 15:10:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:10:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:10:49,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:07,178 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-14 15:11:07,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:07,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471584091] [2024-06-14 15:11:07,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471584091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:07,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:07,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:11:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365018201] [2024-06-14 15:11:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:07,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:11:07,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:07,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:11:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:11:07,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:11:07,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 216 transitions, 2654 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-14 15:11:07,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:07,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:11:07,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:13,991 INFO L124 PetriNetUnfolderBase]: 12480/17169 cut-off events. [2024-06-14 15:11:13,991 INFO L125 PetriNetUnfolderBase]: For 393730/393746 co-relation queries the response was YES. [2024-06-14 15:11:14,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103924 conditions, 17169 events. 12480/17169 cut-off events. For 393730/393746 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 93501 event pairs, 4696 based on Foata normal form. 62/17220 useless extension candidates. Maximal degree in co-relation 103870. Up to 15366 conditions per place. [2024-06-14 15:11:14,128 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 135 selfloop transitions, 133 changer transitions 0/274 dead transitions. [2024-06-14 15:11:14,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 274 transitions, 3678 flow [2024-06-14 15:11:14,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:11:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:11:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-14 15:11:14,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49528301886792453 [2024-06-14 15:11:14,132 INFO L175 Difference]: Start difference. First operand has 126 places, 216 transitions, 2654 flow. Second operand 8 states and 210 transitions. [2024-06-14 15:11:14,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 274 transitions, 3678 flow [2024-06-14 15:11:14,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 274 transitions, 3586 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:11:14,499 INFO L231 Difference]: Finished difference. Result has 128 places, 220 transitions, 2922 flow [2024-06-14 15:11:14,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2562, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2922, PETRI_PLACES=128, PETRI_TRANSITIONS=220} [2024-06-14 15:11:14,499 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 72 predicate places. [2024-06-14 15:11:14,499 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 220 transitions, 2922 flow [2024-06-14 15:11:14,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-14 15:11:14,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:14,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:14,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-14 15:11:14,500 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:11:14,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash -896431823, now seen corresponding path program 1 times [2024-06-14 15:11:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:14,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742406102] [2024-06-14 15:11:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:14,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:32,861 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-14 15:11:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:32,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742406102] [2024-06-14 15:11:32,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742406102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:32,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:32,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:11:32,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670543356] [2024-06-14 15:11:32,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:32,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:11:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:11:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:11:33,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:11:33,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 220 transitions, 2922 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:33,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:33,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:11:33,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:11:38,608 INFO L124 PetriNetUnfolderBase]: 12503/17202 cut-off events. [2024-06-14 15:11:38,608 INFO L125 PetriNetUnfolderBase]: For 425142/425158 co-relation queries the response was YES. [2024-06-14 15:11:38,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108929 conditions, 17202 events. 12503/17202 cut-off events. For 425142/425158 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 93500 event pairs, 4733 based on Foata normal form. 18/17216 useless extension candidates. Maximal degree in co-relation 108874. Up to 16855 conditions per place. [2024-06-14 15:11:38,762 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 221 selfloop transitions, 29 changer transitions 0/256 dead transitions. [2024-06-14 15:11:38,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 256 transitions, 3741 flow [2024-06-14 15:11:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:11:38,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:11:38,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-06-14 15:11:38,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2024-06-14 15:11:38,763 INFO L175 Difference]: Start difference. First operand has 128 places, 220 transitions, 2922 flow. Second operand 6 states and 144 transitions. [2024-06-14 15:11:38,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 256 transitions, 3741 flow [2024-06-14 15:11:39,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 256 transitions, 3510 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-06-14 15:11:39,185 INFO L231 Difference]: Finished difference. Result has 129 places, 227 transitions, 2896 flow [2024-06-14 15:11:39,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2697, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2896, PETRI_PLACES=129, PETRI_TRANSITIONS=227} [2024-06-14 15:11:39,186 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 73 predicate places. [2024-06-14 15:11:39,186 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 227 transitions, 2896 flow [2024-06-14 15:11:39,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:11:39,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:11:39,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:11:39,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-14 15:11:39,187 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:11:39,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:11:39,187 INFO L85 PathProgramCache]: Analyzing trace with hash -599716753, now seen corresponding path program 2 times [2024-06-14 15:11:39,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:11:39,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694721196] [2024-06-14 15:11:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:11:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:11:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:11:57,185 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-14 15:11:57,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:11:57,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694721196] [2024-06-14 15:11:57,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694721196] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:11:57,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:11:57,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:11:57,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311891760] [2024-06-14 15:11:57,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:11:57,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:11:57,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:11:57,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:11:57,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:11:57,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:11:57,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 227 transitions, 2896 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-14 15:11:57,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:11:57,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:11:57,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:03,838 INFO L124 PetriNetUnfolderBase]: 12574/17289 cut-off events. [2024-06-14 15:12:03,838 INFO L125 PetriNetUnfolderBase]: For 448722/448748 co-relation queries the response was YES. [2024-06-14 15:12:03,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108505 conditions, 17289 events. 12574/17289 cut-off events. For 448722/448748 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 93889 event pairs, 4719 based on Foata normal form. 28/17280 useless extension candidates. Maximal degree in co-relation 108449. Up to 15821 conditions per place. [2024-06-14 15:12:03,961 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 125 selfloop transitions, 148 changer transitions 0/279 dead transitions. [2024-06-14 15:12:03,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 279 transitions, 3858 flow [2024-06-14 15:12:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:12:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:12:03,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 203 transitions. [2024-06-14 15:12:03,964 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47877358490566035 [2024-06-14 15:12:03,964 INFO L175 Difference]: Start difference. First operand has 129 places, 227 transitions, 2896 flow. Second operand 8 states and 203 transitions. [2024-06-14 15:12:03,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 279 transitions, 3858 flow [2024-06-14 15:12:04,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 279 transitions, 3443 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-14 15:12:04,297 INFO L231 Difference]: Finished difference. Result has 130 places, 231 transitions, 2875 flow [2024-06-14 15:12:04,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2481, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=144, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2875, PETRI_PLACES=130, PETRI_TRANSITIONS=231} [2024-06-14 15:12:04,298 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 74 predicate places. [2024-06-14 15:12:04,298 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 231 transitions, 2875 flow [2024-06-14 15:12:04,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-14 15:12:04,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:04,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:04,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-14 15:12:04,299 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:12:04,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:04,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1739072973, now seen corresponding path program 3 times [2024-06-14 15:12:04,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:04,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476762202] [2024-06-14 15:12:04,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:22,596 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-14 15:12:22,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:22,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476762202] [2024-06-14 15:12:22,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476762202] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:22,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:22,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:12:22,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032799047] [2024-06-14 15:12:22,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:22,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:12:22,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:22,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:12:22,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:12:22,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:12:22,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 231 transitions, 2875 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-14 15:12:22,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:22,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:12:22,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:29,368 INFO L124 PetriNetUnfolderBase]: 12684/17443 cut-off events. [2024-06-14 15:12:29,368 INFO L125 PetriNetUnfolderBase]: For 486381/486407 co-relation queries the response was YES. [2024-06-14 15:12:29,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113910 conditions, 17443 events. 12684/17443 cut-off events. For 486381/486407 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 94966 event pairs, 4286 based on Foata normal form. 28/17434 useless extension candidates. Maximal degree in co-relation 113854. Up to 15374 conditions per place. [2024-06-14 15:12:29,776 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 124 selfloop transitions, 163 changer transitions 0/293 dead transitions. [2024-06-14 15:12:29,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 293 transitions, 4113 flow [2024-06-14 15:12:29,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:12:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:12:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 210 transitions. [2024-06-14 15:12:29,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49528301886792453 [2024-06-14 15:12:29,779 INFO L175 Difference]: Start difference. First operand has 130 places, 231 transitions, 2875 flow. Second operand 8 states and 210 transitions. [2024-06-14 15:12:29,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 293 transitions, 4113 flow [2024-06-14 15:12:30,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 293 transitions, 3753 flow, removed 35 selfloop flow, removed 6 redundant places. [2024-06-14 15:12:30,202 INFO L231 Difference]: Finished difference. Result has 132 places, 239 transitions, 3032 flow [2024-06-14 15:12:30,202 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2515, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3032, PETRI_PLACES=132, PETRI_TRANSITIONS=239} [2024-06-14 15:12:30,203 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 76 predicate places. [2024-06-14 15:12:30,203 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 239 transitions, 3032 flow [2024-06-14 15:12:30,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-14 15:12:30,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:30,203 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:30,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-14 15:12:30,203 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:12:30,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -827617903, now seen corresponding path program 4 times [2024-06-14 15:12:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:30,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135041039] [2024-06-14 15:12:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:12:48,218 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-14 15:12:48,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:12:48,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135041039] [2024-06-14 15:12:48,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135041039] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:12:48,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:12:48,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:12:48,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937187187] [2024-06-14 15:12:48,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:12:48,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:12:48,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:12:48,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:12:48,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:12:48,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:12:48,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 239 transitions, 3032 flow. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-14 15:12:48,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:12:48,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:12:48,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:12:54,888 INFO L124 PetriNetUnfolderBase]: 12665/17408 cut-off events. [2024-06-14 15:12:54,888 INFO L125 PetriNetUnfolderBase]: For 525637/525655 co-relation queries the response was YES. [2024-06-14 15:12:54,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116809 conditions, 17408 events. 12665/17408 cut-off events. For 525637/525655 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 94656 event pairs, 4747 based on Foata normal form. 20/17391 useless extension candidates. Maximal degree in co-relation 116752. Up to 15946 conditions per place. [2024-06-14 15:12:55,034 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 142 selfloop transitions, 140 changer transitions 0/288 dead transitions. [2024-06-14 15:12:55,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 288 transitions, 4046 flow [2024-06-14 15:12:55,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:12:55,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:12:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-06-14 15:12:55,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811320754716981 [2024-06-14 15:12:55,038 INFO L175 Difference]: Start difference. First operand has 132 places, 239 transitions, 3032 flow. Second operand 8 states and 204 transitions. [2024-06-14 15:12:55,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 288 transitions, 4046 flow [2024-06-14 15:12:55,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 288 transitions, 3597 flow, removed 63 selfloop flow, removed 6 redundant places. [2024-06-14 15:12:55,651 INFO L231 Difference]: Finished difference. Result has 134 places, 239 transitions, 2875 flow [2024-06-14 15:12:55,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2583, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2875, PETRI_PLACES=134, PETRI_TRANSITIONS=239} [2024-06-14 15:12:55,651 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 78 predicate places. [2024-06-14 15:12:55,652 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 239 transitions, 2875 flow [2024-06-14 15:12:55,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 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-14 15:12:55,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:12:55,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:12:55,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-14 15:12:55,652 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:12:55,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:12:55,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1613011747, now seen corresponding path program 2 times [2024-06-14 15:12:55,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:12:55,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860681332] [2024-06-14 15:12:55,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:12:55,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:12:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:14,383 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-14 15:13:14,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:14,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860681332] [2024-06-14 15:13:14,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860681332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:14,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:14,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:13:14,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125806726] [2024-06-14 15:13:14,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:14,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:13:14,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:14,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:13:14,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:13:14,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:13:14,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 239 transitions, 2875 flow. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:14,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:14,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:13:14,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:20,456 INFO L124 PetriNetUnfolderBase]: 12654/17423 cut-off events. [2024-06-14 15:13:20,456 INFO L125 PetriNetUnfolderBase]: For 533784/533808 co-relation queries the response was YES. [2024-06-14 15:13:20,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115400 conditions, 17423 events. 12654/17423 cut-off events. For 533784/533808 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 94931 event pairs, 4738 based on Foata normal form. 23/17439 useless extension candidates. Maximal degree in co-relation 115343. Up to 17074 conditions per place. [2024-06-14 15:13:20,589 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 226 selfloop transitions, 29 changer transitions 0/261 dead transitions. [2024-06-14 15:13:20,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 261 transitions, 3467 flow [2024-06-14 15:13:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:13:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:13:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-06-14 15:13:20,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4276729559748428 [2024-06-14 15:13:20,590 INFO L175 Difference]: Start difference. First operand has 134 places, 239 transitions, 2875 flow. Second operand 6 states and 136 transitions. [2024-06-14 15:13:20,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 261 transitions, 3467 flow [2024-06-14 15:13:20,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 261 transitions, 3108 flow, removed 29 selfloop flow, removed 7 redundant places. [2024-06-14 15:13:20,977 INFO L231 Difference]: Finished difference. Result has 133 places, 239 transitions, 2586 flow [2024-06-14 15:13:20,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2516, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2586, PETRI_PLACES=133, PETRI_TRANSITIONS=239} [2024-06-14 15:13:20,977 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 77 predicate places. [2024-06-14 15:13:20,977 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 239 transitions, 2586 flow [2024-06-14 15:13:20,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:13:20,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:20,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:20,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-14 15:13:20,978 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:13:20,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash -179788045, now seen corresponding path program 1 times [2024-06-14 15:13:20,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:20,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44793701] [2024-06-14 15:13:20,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:20,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:13:39,760 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-14 15:13:39,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:13:39,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44793701] [2024-06-14 15:13:39,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44793701] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:13:39,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:13:39,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:13:39,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209544551] [2024-06-14 15:13:39,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:13:39,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:13:39,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:13:39,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:13:39,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:13:39,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:13:39,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 239 transitions, 2586 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-14 15:13:39,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:13:39,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:13:39,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:13:45,240 INFO L124 PetriNetUnfolderBase]: 11268/15929 cut-off events. [2024-06-14 15:13:45,240 INFO L125 PetriNetUnfolderBase]: For 481088/481096 co-relation queries the response was YES. [2024-06-14 15:13:45,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103259 conditions, 15929 events. 11268/15929 cut-off events. For 481088/481096 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 90165 event pairs, 4125 based on Foata normal form. 8/15902 useless extension candidates. Maximal degree in co-relation 103201. Up to 15224 conditions per place. [2024-06-14 15:13:45,384 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 234 selfloop transitions, 25 changer transitions 0/266 dead transitions. [2024-06-14 15:13:45,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 266 transitions, 3329 flow [2024-06-14 15:13:45,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:13:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:13:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-14 15:13:45,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46540880503144655 [2024-06-14 15:13:45,385 INFO L175 Difference]: Start difference. First operand has 133 places, 239 transitions, 2586 flow. Second operand 6 states and 148 transitions. [2024-06-14 15:13:45,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 266 transitions, 3329 flow [2024-06-14 15:13:45,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 266 transitions, 3248 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-14 15:13:45,745 INFO L231 Difference]: Finished difference. Result has 134 places, 243 transitions, 2619 flow [2024-06-14 15:13:45,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2505, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2619, PETRI_PLACES=134, PETRI_TRANSITIONS=243} [2024-06-14 15:13:45,746 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 78 predicate places. [2024-06-14 15:13:45,746 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 243 transitions, 2619 flow [2024-06-14 15:13:45,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-14 15:13:45,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:13:45,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:13:45,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-14 15:13:45,747 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:13:45,747 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:13:45,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1613005795, now seen corresponding path program 2 times [2024-06-14 15:13:45,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:13:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363168865] [2024-06-14 15:13:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:13:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:13:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:05,245 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-14 15:14:05,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:05,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363168865] [2024-06-14 15:14:05,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363168865] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:05,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:05,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:14:05,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938640554] [2024-06-14 15:14:05,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:05,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:14:05,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:05,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:14:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:14:05,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-14 15:14:05,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 243 transitions, 2619 flow. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-14 15:14:05,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:05,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-14 15:14:05,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:10,737 INFO L124 PetriNetUnfolderBase]: 11222/15854 cut-off events. [2024-06-14 15:14:10,737 INFO L125 PetriNetUnfolderBase]: For 506266/506268 co-relation queries the response was YES. [2024-06-14 15:14:10,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103895 conditions, 15854 events. 11222/15854 cut-off events. For 506266/506268 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 89667 event pairs, 4137 based on Foata normal form. 2/15816 useless extension candidates. Maximal degree in co-relation 103836. Up to 15162 conditions per place. [2024-06-14 15:14:10,878 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 228 selfloop transitions, 26 changer transitions 0/261 dead transitions. [2024-06-14 15:14:10,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 261 transitions, 3183 flow [2024-06-14 15:14:10,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:14:10,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:14:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2024-06-14 15:14:10,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4528301886792453 [2024-06-14 15:14:10,880 INFO L175 Difference]: Start difference. First operand has 134 places, 243 transitions, 2619 flow. Second operand 6 states and 144 transitions. [2024-06-14 15:14:10,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 261 transitions, 3183 flow [2024-06-14 15:14:11,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 261 transitions, 3128 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-14 15:14:11,384 INFO L231 Difference]: Finished difference. Result has 137 places, 243 transitions, 2625 flow [2024-06-14 15:14:11,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2564, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2625, PETRI_PLACES=137, PETRI_TRANSITIONS=243} [2024-06-14 15:14:11,384 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 81 predicate places. [2024-06-14 15:14:11,385 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 243 transitions, 2625 flow [2024-06-14 15:14:11,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 7 states have internal predecessors, (98), 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-14 15:14:11,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:11,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:11,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-14 15:14:11,385 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:14:11,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:11,386 INFO L85 PathProgramCache]: Analyzing trace with hash -356657717, now seen corresponding path program 1 times [2024-06-14 15:14:11,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031433393] [2024-06-14 15:14:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:30,129 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-14 15:14:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031433393] [2024-06-14 15:14:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031433393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:30,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:30,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:14:30,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415058487] [2024-06-14 15:14:30,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:30,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:14:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:30,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:14:30,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:14:30,343 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:14:30,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 243 transitions, 2625 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-14 15:14:30,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:30,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:14:30,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:14:37,336 INFO L124 PetriNetUnfolderBase]: 13215/18270 cut-off events. [2024-06-14 15:14:37,337 INFO L125 PetriNetUnfolderBase]: For 661476/661484 co-relation queries the response was YES. [2024-06-14 15:14:37,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123653 conditions, 18270 events. 13215/18270 cut-off events. For 661476/661484 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 101396 event pairs, 3746 based on Foata normal form. 34/18293 useless extension candidates. Maximal degree in co-relation 123593. Up to 14777 conditions per place. [2024-06-14 15:14:37,485 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 170 selfloop transitions, 136 changer transitions 0/312 dead transitions. [2024-06-14 15:14:37,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 312 transitions, 4043 flow [2024-06-14 15:14:37,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:14:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:14:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 213 transitions. [2024-06-14 15:14:37,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023584905660378 [2024-06-14 15:14:37,488 INFO L175 Difference]: Start difference. First operand has 137 places, 243 transitions, 2625 flow. Second operand 8 states and 213 transitions. [2024-06-14 15:14:37,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 312 transitions, 4043 flow [2024-06-14 15:14:37,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 312 transitions, 3951 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:14:37,878 INFO L231 Difference]: Finished difference. Result has 140 places, 252 transitions, 3071 flow [2024-06-14 15:14:37,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2533, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3071, PETRI_PLACES=140, PETRI_TRANSITIONS=252} [2024-06-14 15:14:37,879 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 84 predicate places. [2024-06-14 15:14:37,879 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 252 transitions, 3071 flow [2024-06-14 15:14:37,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-14 15:14:37,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:14:37,879 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:14:37,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-14 15:14:37,880 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:14:37,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:14:37,880 INFO L85 PathProgramCache]: Analyzing trace with hash -268091957, now seen corresponding path program 2 times [2024-06-14 15:14:37,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:14:37,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672547506] [2024-06-14 15:14:37,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:14:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:14:37,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:14:55,985 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-14 15:14:55,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:14:55,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672547506] [2024-06-14 15:14:55,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672547506] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:14:55,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:14:55,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:14:55,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813906655] [2024-06-14 15:14:55,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:14:55,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:14:55,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:14:55,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:14:55,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:14:56,222 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:14:56,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 252 transitions, 3071 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-14 15:14:56,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:14:56,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:14:56,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:03,316 INFO L124 PetriNetUnfolderBase]: 13618/18867 cut-off events. [2024-06-14 15:15:03,316 INFO L125 PetriNetUnfolderBase]: For 741571/741579 co-relation queries the response was YES. [2024-06-14 15:15:03,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134439 conditions, 18867 events. 13618/18867 cut-off events. For 741571/741579 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 105691 event pairs, 4887 based on Foata normal form. 34/18890 useless extension candidates. Maximal degree in co-relation 134377. Up to 16416 conditions per place. [2024-06-14 15:15:03,469 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 164 selfloop transitions, 144 changer transitions 0/314 dead transitions. [2024-06-14 15:15:03,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 314 transitions, 4371 flow [2024-06-14 15:15:03,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:15:03,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:15:03,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 211 transitions. [2024-06-14 15:15:03,472 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49764150943396224 [2024-06-14 15:15:03,472 INFO L175 Difference]: Start difference. First operand has 140 places, 252 transitions, 3071 flow. Second operand 8 states and 211 transitions. [2024-06-14 15:15:03,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 314 transitions, 4371 flow [2024-06-14 15:15:04,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 314 transitions, 4168 flow, removed 40 selfloop flow, removed 3 redundant places. [2024-06-14 15:15:04,131 INFO L231 Difference]: Finished difference. Result has 146 places, 259 transitions, 3362 flow [2024-06-14 15:15:04,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2868, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3362, PETRI_PLACES=146, PETRI_TRANSITIONS=259} [2024-06-14 15:15:04,132 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 90 predicate places. [2024-06-14 15:15:04,132 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 259 transitions, 3362 flow [2024-06-14 15:15:04,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 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-14 15:15:04,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:04,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:04,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-14 15:15:04,132 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:15:04,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:04,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2019880351, now seen corresponding path program 1 times [2024-06-14 15:15:04,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:04,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143970669] [2024-06-14 15:15:04,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:04,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:15:23,042 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-14 15:15:23,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:15:23,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143970669] [2024-06-14 15:15:23,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143970669] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:15:23,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:15:23,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:15:23,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862996113] [2024-06-14 15:15:23,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:15:23,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:15:23,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:15:23,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:15:23,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:15:23,242 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-14 15:15:23,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 259 transitions, 3362 flow. Second operand has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:23,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:15:23,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-14 15:15:23,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:15:30,152 INFO L124 PetriNetUnfolderBase]: 13714/19051 cut-off events. [2024-06-14 15:15:30,152 INFO L125 PetriNetUnfolderBase]: For 796165/796187 co-relation queries the response was YES. [2024-06-14 15:15:30,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139879 conditions, 19051 events. 13714/19051 cut-off events. For 796165/796187 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 107399 event pairs, 4952 based on Foata normal form. 32/19072 useless extension candidates. Maximal degree in co-relation 139814. Up to 17477 conditions per place. [2024-06-14 15:15:30,324 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 156 selfloop transitions, 148 changer transitions 0/310 dead transitions. [2024-06-14 15:15:30,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 310 transitions, 4534 flow [2024-06-14 15:15:30,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:15:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:15:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-14 15:15:30,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48787061994609165 [2024-06-14 15:15:30,327 INFO L175 Difference]: Start difference. First operand has 146 places, 259 transitions, 3362 flow. Second operand 7 states and 181 transitions. [2024-06-14 15:15:30,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 310 transitions, 4534 flow [2024-06-14 15:15:31,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 310 transitions, 4295 flow, removed 36 selfloop flow, removed 4 redundant places. [2024-06-14 15:15:31,119 INFO L231 Difference]: Finished difference. Result has 149 places, 270 transitions, 3632 flow [2024-06-14 15:15:31,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=3135, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3632, PETRI_PLACES=149, PETRI_TRANSITIONS=270} [2024-06-14 15:15:31,119 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 93 predicate places. [2024-06-14 15:15:31,119 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 270 transitions, 3632 flow [2024-06-14 15:15:31,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.875) internal successors, (103), 8 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:15:31,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:15:31,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:15:31,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-14 15:15:31,120 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-14 15:15:31,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:15:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1292752567, now seen corresponding path program 3 times [2024-06-14 15:15:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:15:31,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297603639] [2024-06-14 15:15:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:15:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:15:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat