./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.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/mix033.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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/mix033.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/mix033.opt.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-76401ed-m [2024-06-20 18:59:13,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 18:59:13,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 18:59:13,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 18:59:13,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 18:59:13,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 18:59:13,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 18:59:13,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 18:59:13,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 18:59:13,906 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 18:59:13,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 18:59:13,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 18:59:13,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 18:59:13,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 18:59:13,909 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 18:59:13,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 18:59:13,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 18:59:13,910 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 18:59:13,910 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 18:59:13,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 18:59:13,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 18:59:13,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 18:59:13,911 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 18:59:13,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 18:59:13,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 18:59:13,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 18:59:13,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 18:59:13,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 18:59:13,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 18:59:13,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 18:59:13,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 18:59:13,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 18:59:13,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:59:13,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 18:59:13,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 18:59:13,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 18:59:13,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 18:59:13,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 18:59:13,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 18:59:13,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 18:59:13,915 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 18:59:13,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 18:59:13,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 18:59:13,916 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-20 18:59:14,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 18:59:14,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 18:59:14,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 18:59:14,137 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 18:59:14,138 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 18:59:14,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2024-06-20 18:59:15,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 18:59:15,446 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 18:59:15,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033.opt.i [2024-06-20 18:59:15,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875417ab4/cb600b799c5e40eca5cdcdcd40b876cc/FLAG32c7d61a8 [2024-06-20 18:59:15,477 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/875417ab4/cb600b799c5e40eca5cdcdcd40b876cc [2024-06-20 18:59:15,479 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 18:59:15,479 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 18:59:15,480 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/mix033.opt.yml/witness.yml [2024-06-20 18:59:15,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 18:59:15,636 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 18:59:15,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 18:59:15,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 18:59:15,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 18:59:15,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:59:15" (1/2) ... [2024-06-20 18:59:15,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cbd708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:15, skipping insertion in model container [2024-06-20 18:59:15,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:59:15" (1/2) ... [2024-06-20 18:59:15,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ec24c33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:59:15, skipping insertion in model container [2024-06-20 18:59:15,644 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:59:15" (2/2) ... [2024-06-20 18:59:15,644 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cbd708 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:15, skipping insertion in model container [2024-06-20 18:59:15,644 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:59:15" (2/2) ... [2024-06-20 18:59:15,644 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 18:59:15,744 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 18:59:15,746 INFO L97 edCorrectnessWitness]: Location invariant before [L848-L848] ((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 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_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$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 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 )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 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_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$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_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$read_delayed >= 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$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$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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 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_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$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_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_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$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (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_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$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_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$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_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$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_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$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_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$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_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$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_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$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_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$read_delayed >= 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$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$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$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$read_delayed >= 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_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$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_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$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && 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_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0) [2024-06-20 18:59:15,747 INFO L97 edCorrectnessWitness]: Location invariant before [L846-L846] ((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 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_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$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 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 )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 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_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$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_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$read_delayed >= 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$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$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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 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_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$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_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_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$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (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_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$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_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$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_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$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_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$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_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$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_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$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_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$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_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$read_delayed >= 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$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$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$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$read_delayed >= 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_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$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_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$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && 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_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0) [2024-06-20 18:59:15,747 INFO L97 edCorrectnessWitness]: Location invariant before [L849-L849] ((((((((((((((((((((((! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 1) && (z$mem_tmp == 0 || z$mem_tmp == 1)))) && (! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)))) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || ((0 <= b && b <= 1) && (b == 0 || b == 1)))) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p2_EBX) + (long long )b >= 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_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$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )a >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )b) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )b) + (long long )x >= 0LL) && (1LL - (long long )b) + (long long )y >= 0LL) && (1LL - (long long )b) + (long long )z >= 0LL) && (1LL - (long long )b) + (long long )z$flush_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$mem_tmp >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff0_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) + (long long )z$r_buff1_thd3 >= 0LL) && (1LL - (long long )b) + (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff0 >= 0LL) && (1LL - (long long )b) + (long long )z$w_buff1 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )b) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )a >= 0LL) && (long long )__unbuffered_cnt + (long long )b >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )__unbuffered_p2_EBX >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )a >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )b >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EBX + (long long )weak$$choice2 >= 0LL) && (long long )a + (long long )b >= 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 )b + (long long )main$tmp_guard1 >= 0LL) && (long long )b + (long long )x >= 0LL) && (long long )b + (long long )y >= 0LL) && (long long )b + (long long )z >= 0LL) && (long long )b + (long long )z$flush_delayed >= 0LL) && (long long )b + (long long )z$mem_tmp >= 0LL) && (long long )b + (long long )z$r_buff0_thd0 >= 0LL) && (long long )b + (long long )z$r_buff0_thd1 >= 0LL) && (long long )b + (long long )z$r_buff0_thd2 >= 0LL) && (long long )b + (long long )z$r_buff0_thd3 >= 0LL) && (long long )b + (long long )z$r_buff1_thd0 >= 0LL) && (long long )b + (long long )z$r_buff1_thd1 >= 0LL) && (long long )b + (long long )z$r_buff1_thd2 >= 0LL) && (long long )b + (long long )z$r_buff1_thd3 >= 0LL) && (long long )b + (long long )z$read_delayed >= 0LL) && (long long )b + (long long )z$w_buff0 >= 0LL) && (long long )b + (long long )z$w_buff1 >= 0LL) && (long long )b + (long long )weak$$choice0 >= 0LL) && (long long )b + (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_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )__unbuffered_p2_EBX >= 0LL) && (1LL + (long long )__unbuffered_p2_EAX) - (long long )b >= 0LL) && (1LL + (long long )__unbuffered_p2_EBX) - (long long )b >= 0LL) && (1LL + (long long )a) - (long long )b >= 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_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$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_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$read_delayed >= 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$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$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$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EBX) - (long long )z$read_delayed >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff0_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd0 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd1 >= 0LL) && (1LL - (long long )b) - (long long )z$r_buff1_thd2 >= 0LL) && (1LL - (long long )b) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p2_EBX) - (long long )b >= 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_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$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )z$read_delayed >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p2_EBX - (long long )z$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_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_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$read_delayed >= 0LL) && (long long )b - (long long )z$r_buff0_thd0 >= 0LL) && (long long )b - (long long )z$r_buff0_thd1 >= 0LL) && (long long )b - (long long )z$r_buff0_thd2 >= 0LL) && (long long )b - (long long )z$r_buff1_thd0 >= 0LL) && (long long )b - (long long )z$r_buff1_thd1 >= 0LL) && (long long )b - (long long )z$r_buff1_thd2 >= 0LL) && (long long )b - (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_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$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_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$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_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$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_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$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_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$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_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$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_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$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_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$read_delayed >= 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$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$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$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$read_delayed >= 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_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$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_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$read_delayed >= 0LL))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= __unbuffered_p2_EAX) && 0 <= __unbuffered_p2_EBX) && 0 <= a) && 0 <= b) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && __unbuffered_p2_EAX <= 1) && __unbuffered_p2_EBX <= 1) && a <= 1) && b <= 1) && y <= 1) && z <= 1) && z$mem_tmp <= 1) && z$w_buff0 <= 1) && z$w_buff1 <= 1) && 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_buff1_thd0 == (_Bool)0) && z$r_buff1_thd1 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)) && (a == 0 || a == 1)) && (b == 0 || b == 1)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && (z$mem_tmp == 0 || z$mem_tmp == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 1)) && (z$w_buff1 == 0 || z$w_buff1 == 1)) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((0 <= z && z <= 1) && (z == 0 || z == 1)))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$w_buff1 && z$w_buff1 <= 1) && (z$w_buff1 == 0 || z$w_buff1 == 1)))) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= __unbuffered_p2_EBX && __unbuffered_p2_EBX <= 1) && (__unbuffered_p2_EBX == 0 || __unbuffered_p2_EBX == 1)))) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= a && a <= 1) && (a == 0 || a == 1)))) && (! multithreaded || ((0 <= z$w_buff0 && z$w_buff0 <= 1) && (z$w_buff0 == 0 || z$w_buff0 == 1)))) && (! multithreaded || z$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0) [2024-06-20 18:59:15,748 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 18:59:15,748 INFO L106 edCorrectnessWitness]: ghost_update [L844-L844] multithreaded = 1; [2024-06-20 18:59:15,782 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 18:59:16,099 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:59:16,109 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-20 18:59:16,430 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:59:16,465 INFO L206 MainTranslator]: Completed translation [2024-06-20 18:59:16,465 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16 WrapperNode [2024-06-20 18:59:16,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 18:59:16,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 18:59:16,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 18:59:16,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 18:59:16,472 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 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,516 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 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,695 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2024-06-20 18:59:16,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 18:59:16,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 18:59:16,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 18:59:16,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 18:59:16,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,742 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,781 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-20 18:59:16,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,782 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,822 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 18:59:16,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 18:59:16,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 18:59:16,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 18:59:16,864 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (1/1) ... [2024-06-20 18:59:16,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:59:16,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:59:16,938 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-20 18:59:16,947 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-20 18:59:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-20 18:59:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 18:59:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-20 18:59:16,970 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-20 18:59:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-20 18:59:16,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-20 18:59:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-20 18:59:16,971 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-20 18:59:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 18:59:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-20 18:59:16,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 18:59:16,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 18:59:16,973 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 18:59:17,071 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 18:59:17,073 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 18:59:18,485 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 18:59:18,487 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 18:59:18,788 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 18:59:18,789 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-20 18:59:18,790 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:59:18 BoogieIcfgContainer [2024-06-20 18:59:18,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 18:59:18,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 18:59:18,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 18:59:18,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 18:59:18,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:59:15" (1/4) ... [2024-06-20 18:59:18,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324fce69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:59:18, skipping insertion in model container [2024-06-20 18:59:18,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:59:15" (2/4) ... [2024-06-20 18:59:18,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324fce69 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:59:18, skipping insertion in model container [2024-06-20 18:59:18,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:59:16" (3/4) ... [2024-06-20 18:59:18,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@324fce69 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:59:18, skipping insertion in model container [2024-06-20 18:59:18,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:59:18" (4/4) ... [2024-06-20 18:59:18,798 INFO L112 eAbstractionObserver]: Analyzing ICFG mix033.opt.i [2024-06-20 18:59:18,812 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 18:59:18,812 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-20 18:59:18,812 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 18:59:18,955 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-20 18:59:18,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 44 transitions, 100 flow [2024-06-20 18:59:19,043 INFO L124 PetriNetUnfolderBase]: 0/41 cut-off events. [2024-06-20 18:59:19,043 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:59:19,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-20 18:59:19,046 INFO L82 GeneralOperation]: Start removeDead. Operand has 54 places, 44 transitions, 100 flow [2024-06-20 18:59:19,049 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 35 transitions, 79 flow [2024-06-20 18:59:19,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 18:59:19,070 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;@3971fa52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 18:59:19,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 18:59:19,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 18:59:19,077 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 18:59:19,077 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:59:19,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:19,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 18:59:19,078 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:19,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:19,082 INFO L85 PathProgramCache]: Analyzing trace with hash 368421363, now seen corresponding path program 1 times [2024-06-20 18:59:19,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:19,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337116707] [2024-06-20 18:59:19,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:19,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:26,888 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-20 18:59:26,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:26,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337116707] [2024-06-20 18:59:26,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337116707] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:26,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:26,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 18:59:26,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669344370] [2024-06-20 18:59:26,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:26,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:59:26,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:26,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:59:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:59:27,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 44 [2024-06-20 18:59:27,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:59:27,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:27,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 44 [2024-06-20 18:59:27,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:28,091 INFO L124 PetriNetUnfolderBase]: 1359/2199 cut-off events. [2024-06-20 18:59:28,092 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-06-20 18:59:28,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4313 conditions, 2199 events. 1359/2199 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11527 event pairs, 941 based on Foata normal form. 1/2116 useless extension candidates. Maximal degree in co-relation 4301. Up to 2029 conditions per place. [2024-06-20 18:59:28,108 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 32 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2024-06-20 18:59:28,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 177 flow [2024-06-20 18:59:28,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:59:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:59:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2024-06-20 18:59:28,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-06-20 18:59:28,119 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 79 flow. Second operand 3 states and 84 transitions. [2024-06-20 18:59:28,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 177 flow [2024-06-20 18:59:28,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-20 18:59:28,126 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 106 flow [2024-06-20 18:59:28,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-20 18:59:28,131 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 0 predicate places. [2024-06-20 18:59:28,131 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 106 flow [2024-06-20 18:59:28,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:59:28,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:28,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:28,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 18:59:28,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:28,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:28,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1865755786, now seen corresponding path program 1 times [2024-06-20 18:59:28,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:28,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875290536] [2024-06-20 18:59:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:28,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:33,694 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-20 18:59:33,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:33,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875290536] [2024-06-20 18:59:33,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875290536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:33,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:33,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 18:59:33,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390502949] [2024-06-20 18:59:33,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:33,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:59:33,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:33,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:59:33,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:59:33,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-06-20 18:59:33,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-20 18:59:33,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:33,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-06-20 18:59:33,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:34,954 INFO L124 PetriNetUnfolderBase]: 1560/2437 cut-off events. [2024-06-20 18:59:34,954 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2024-06-20 18:59:34,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5453 conditions, 2437 events. 1560/2437 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 12451 event pairs, 930 based on Foata normal form. 3/2405 useless extension candidates. Maximal degree in co-relation 5441. Up to 2302 conditions per place. [2024-06-20 18:59:34,970 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-06-20 18:59:34,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 246 flow [2024-06-20 18:59:34,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:59:34,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:59:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-06-20 18:59:34,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-06-20 18:59:34,973 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 106 flow. Second operand 4 states and 106 transitions. [2024-06-20 18:59:34,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 246 flow [2024-06-20 18:59:34,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:59:34,977 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 142 flow [2024-06-20 18:59:34,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2024-06-20 18:59:34,978 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-06-20 18:59:34,978 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 142 flow [2024-06-20 18:59:34,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-20 18:59:34,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:34,980 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:34,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 18:59:34,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:34,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:34,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2003855482, now seen corresponding path program 1 times [2024-06-20 18:59:34,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:34,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258315115] [2024-06-20 18:59:34,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:40,384 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-20 18:59:40,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:40,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258315115] [2024-06-20 18:59:40,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258315115] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:40,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:40,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:59:40,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209947106] [2024-06-20 18:59:40,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:40,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 18:59:40,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:40,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 18:59:40,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 18:59:40,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-06-20 18:59:40,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 41 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:59:40,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:40,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-06-20 18:59:40,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:41,663 INFO L124 PetriNetUnfolderBase]: 1568/2497 cut-off events. [2024-06-20 18:59:41,663 INFO L125 PetriNetUnfolderBase]: For 1343/1343 co-relation queries the response was YES. [2024-06-20 18:59:41,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6130 conditions, 2497 events. 1568/2497 cut-off events. For 1343/1343 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13125 event pairs, 669 based on Foata normal form. 5/2485 useless extension candidates. Maximal degree in co-relation 6116. Up to 2248 conditions per place. [2024-06-20 18:59:41,676 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 53 selfloop transitions, 16 changer transitions 0/77 dead transitions. [2024-06-20 18:59:41,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 400 flow [2024-06-20 18:59:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:59:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:59:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 138 transitions. [2024-06-20 18:59:41,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-06-20 18:59:41,678 INFO L175 Difference]: Start difference. First operand has 48 places, 41 transitions, 142 flow. Second operand 5 states and 138 transitions. [2024-06-20 18:59:41,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 400 flow [2024-06-20 18:59:41,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 77 transitions, 386 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-20 18:59:41,681 INFO L231 Difference]: Finished difference. Result has 53 places, 52 transitions, 241 flow [2024-06-20 18:59:41,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=53, PETRI_TRANSITIONS=52} [2024-06-20 18:59:41,682 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2024-06-20 18:59:41,682 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 52 transitions, 241 flow [2024-06-20 18:59:41,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:59:41,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:41,683 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:41,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 18:59:41,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:41,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:41,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1875696655, now seen corresponding path program 1 times [2024-06-20 18:59:41,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:41,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471100610] [2024-06-20 18:59:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:41,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:59:48,051 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-20 18:59:48,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:59:48,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471100610] [2024-06-20 18:59:48,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471100610] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:59:48,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:59:48,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:59:48,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986570184] [2024-06-20 18:59:48,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:59:48,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:59:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:59:48,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:59:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:59:48,238 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 44 [2024-06-20 18:59:48,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 52 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:59:48,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:59:48,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 44 [2024-06-20 18:59:48,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:59:49,441 INFO L124 PetriNetUnfolderBase]: 1580/2517 cut-off events. [2024-06-20 18:59:49,442 INFO L125 PetriNetUnfolderBase]: For 3179/3181 co-relation queries the response was YES. [2024-06-20 18:59:49,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7274 conditions, 2517 events. 1580/2517 cut-off events. For 3179/3181 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 13210 event pairs, 481 based on Foata normal form. 12/2512 useless extension candidates. Maximal degree in co-relation 7257. Up to 2216 conditions per place. [2024-06-20 18:59:49,453 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 57 selfloop transitions, 19 changer transitions 0/84 dead transitions. [2024-06-20 18:59:49,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 503 flow [2024-06-20 18:59:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:59:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:59:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2024-06-20 18:59:49,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6022727272727273 [2024-06-20 18:59:49,455 INFO L175 Difference]: Start difference. First operand has 53 places, 52 transitions, 241 flow. Second operand 6 states and 159 transitions. [2024-06-20 18:59:49,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 503 flow [2024-06-20 18:59:49,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 84 transitions, 495 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-20 18:59:49,459 INFO L231 Difference]: Finished difference. Result has 58 places, 54 transitions, 297 flow [2024-06-20 18:59:49,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=58, PETRI_TRANSITIONS=54} [2024-06-20 18:59:49,459 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2024-06-20 18:59:49,460 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 54 transitions, 297 flow [2024-06-20 18:59:49,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 18:59:49,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:59:49,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:59:49,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 18:59:49,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:59:49,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:59:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1953014575, now seen corresponding path program 1 times [2024-06-20 18:59:49,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:59:49,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602662913] [2024-06-20 18:59:49,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:59:49,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:59:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:02,186 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-20 19:00:02,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:02,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602662913] [2024-06-20 19:00:02,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602662913] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:02,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:02,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:00:02,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218125916] [2024-06-20 19:00:02,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:02,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:00:02,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:02,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:00:02,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:00:02,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-20 19:00:02,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 54 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-20 19:00:02,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:02,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-20 19:00:02,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:03,420 INFO L124 PetriNetUnfolderBase]: 1368/2246 cut-off events. [2024-06-20 19:00:03,421 INFO L125 PetriNetUnfolderBase]: For 4097/4097 co-relation queries the response was YES. [2024-06-20 19:00:03,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7017 conditions, 2246 events. 1368/2246 cut-off events. For 4097/4097 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 12065 event pairs, 562 based on Foata normal form. 2/2213 useless extension candidates. Maximal degree in co-relation 6996. Up to 2036 conditions per place. [2024-06-20 19:00:03,436 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 49 selfloop transitions, 8 changer transitions 0/65 dead transitions. [2024-06-20 19:00:03,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 439 flow [2024-06-20 19:00:03,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:00:03,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:00:03,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-06-20 19:00:03,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-20 19:00:03,439 INFO L175 Difference]: Start difference. First operand has 58 places, 54 transitions, 297 flow. Second operand 5 states and 110 transitions. [2024-06-20 19:00:03,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 439 flow [2024-06-20 19:00:03,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 65 transitions, 389 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-20 19:00:03,448 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 271 flow [2024-06-20 19:00:03,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2024-06-20 19:00:03,450 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2024-06-20 19:00:03,450 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 271 flow [2024-06-20 19:00:03,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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-20 19:00:03,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:03,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:03,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 19:00:03,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:00:03,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:03,457 INFO L85 PathProgramCache]: Analyzing trace with hash 412930851, now seen corresponding path program 1 times [2024-06-20 19:00:03,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:03,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490582737] [2024-06-20 19:00:03,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:18,076 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-20 19:00:18,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:18,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490582737] [2024-06-20 19:00:18,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490582737] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:18,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:18,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:00:18,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911848184] [2024-06-20 19:00:18,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:18,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:00:18,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:18,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:00:18,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:00:18,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:00:18,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 271 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:00:18,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:18,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:00:18,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:19,560 INFO L124 PetriNetUnfolderBase]: 1606/2615 cut-off events. [2024-06-20 19:00:19,560 INFO L125 PetriNetUnfolderBase]: For 5550/5550 co-relation queries the response was YES. [2024-06-20 19:00:19,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8115 conditions, 2615 events. 1606/2615 cut-off events. For 5550/5550 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13935 event pairs, 676 based on Foata normal form. 2/2594 useless extension candidates. Maximal degree in co-relation 8092. Up to 2373 conditions per place. [2024-06-20 19:00:19,574 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 54 selfloop transitions, 11 changer transitions 0/72 dead transitions. [2024-06-20 19:00:19,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 457 flow [2024-06-20 19:00:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:00:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:00:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-06-20 19:00:19,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2024-06-20 19:00:19,576 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 271 flow. Second operand 6 states and 125 transitions. [2024-06-20 19:00:19,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 457 flow [2024-06-20 19:00:19,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 435 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-20 19:00:19,579 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 303 flow [2024-06-20 19:00:19,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=303, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2024-06-20 19:00:19,580 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2024-06-20 19:00:19,580 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 303 flow [2024-06-20 19:00:19,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:00:19,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:19,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:19,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 19:00:19,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:00:19,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:19,581 INFO L85 PathProgramCache]: Analyzing trace with hash -60128702, now seen corresponding path program 1 times [2024-06-20 19:00:19,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:19,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841940720] [2024-06-20 19:00:19,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:19,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:33,064 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-20 19:00:33,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:33,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841940720] [2024-06-20 19:00:33,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841940720] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:33,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:00:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227170453] [2024-06-20 19:00:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:33,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:00:33,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:33,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:00:33,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:00:33,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:00:33,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 303 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:00:33,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:33,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:00:33,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:34,620 INFO L124 PetriNetUnfolderBase]: 1746/2777 cut-off events. [2024-06-20 19:00:34,620 INFO L125 PetriNetUnfolderBase]: For 8534/8538 co-relation queries the response was YES. [2024-06-20 19:00:34,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9396 conditions, 2777 events. 1746/2777 cut-off events. For 8534/8538 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14611 event pairs, 726 based on Foata normal form. 8/2773 useless extension candidates. Maximal degree in co-relation 9373. Up to 2505 conditions per place. [2024-06-20 19:00:34,640 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 53 selfloop transitions, 19 changer transitions 0/80 dead transitions. [2024-06-20 19:00:34,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 80 transitions, 543 flow [2024-06-20 19:00:34,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:00:34,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:00:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-06-20 19:00:34,641 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-06-20 19:00:34,641 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 303 flow. Second operand 6 states and 134 transitions. [2024-06-20 19:00:34,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 80 transitions, 543 flow [2024-06-20 19:00:34,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 80 transitions, 513 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-20 19:00:34,645 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 345 flow [2024-06-20 19:00:34,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=345, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2024-06-20 19:00:34,646 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2024-06-20 19:00:34,646 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 345 flow [2024-06-20 19:00:34,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:00:34,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:34,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:34,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 19:00:34,647 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:00:34,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:34,647 INFO L85 PathProgramCache]: Analyzing trace with hash -53665202, now seen corresponding path program 2 times [2024-06-20 19:00:34,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:34,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502395054] [2024-06-20 19:00:34,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:34,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:00:48,400 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-20 19:00:48,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:00:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502395054] [2024-06-20 19:00:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502395054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:00:48,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:00:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:00:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35672563] [2024-06-20 19:00:48,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:00:48,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:00:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:00:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:00:48,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:00:48,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:00:48,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:00:48,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:00:48,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:00:48,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:00:49,918 INFO L124 PetriNetUnfolderBase]: 1734/2750 cut-off events. [2024-06-20 19:00:49,919 INFO L125 PetriNetUnfolderBase]: For 10309/10309 co-relation queries the response was YES. [2024-06-20 19:00:49,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9632 conditions, 2750 events. 1734/2750 cut-off events. For 10309/10309 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14424 event pairs, 740 based on Foata normal form. 2/2739 useless extension candidates. Maximal degree in co-relation 9608. Up to 2489 conditions per place. [2024-06-20 19:00:49,933 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 47 selfloop transitions, 20 changer transitions 0/75 dead transitions. [2024-06-20 19:00:49,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 517 flow [2024-06-20 19:00:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:00:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:00:49,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-06-20 19:00:49,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-06-20 19:00:49,937 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 345 flow. Second operand 6 states and 130 transitions. [2024-06-20 19:00:49,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 517 flow [2024-06-20 19:00:49,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 75 transitions, 488 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-20 19:00:49,943 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 364 flow [2024-06-20 19:00:49,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-06-20 19:00:49,945 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 21 predicate places. [2024-06-20 19:00:49,945 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 364 flow [2024-06-20 19:00:49,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:00:49,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:00:49,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:00:49,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 19:00:49,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:00:49,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:00:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash -998329876, now seen corresponding path program 1 times [2024-06-20 19:00:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:00:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773958960] [2024-06-20 19:00:49,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:00:49,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:00:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:04,083 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-20 19:01:04,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:04,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773958960] [2024-06-20 19:01:04,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773958960] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:04,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:04,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:01:04,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658395647] [2024-06-20 19:01:04,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:04,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:01:04,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:04,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:01:04,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:01:04,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:01:04,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 364 flow. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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-20 19:01:04,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:04,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:01:04,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:05,663 INFO L124 PetriNetUnfolderBase]: 1590/2610 cut-off events. [2024-06-20 19:01:05,664 INFO L125 PetriNetUnfolderBase]: For 10273/10273 co-relation queries the response was YES. [2024-06-20 19:01:05,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9112 conditions, 2610 events. 1590/2610 cut-off events. For 10273/10273 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 14019 event pairs, 634 based on Foata normal form. 4/2603 useless extension candidates. Maximal degree in co-relation 9087. Up to 2330 conditions per place. [2024-06-20 19:01:05,702 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 62 selfloop transitions, 14 changer transitions 0/83 dead transitions. [2024-06-20 19:01:05,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 83 transitions, 588 flow [2024-06-20 19:01:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:01:05,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:01:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-20 19:01:05,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707792207792208 [2024-06-20 19:01:05,704 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 364 flow. Second operand 7 states and 145 transitions. [2024-06-20 19:01:05,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 83 transitions, 588 flow [2024-06-20 19:01:05,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 523 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 19:01:05,710 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 363 flow [2024-06-20 19:01:05,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=363, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-06-20 19:01:05,711 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 22 predicate places. [2024-06-20 19:01:05,711 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 363 flow [2024-06-20 19:01:05,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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-20 19:01:05,711 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:05,711 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:05,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 19:01:05,711 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:01:05,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1060831230, now seen corresponding path program 1 times [2024-06-20 19:01:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079837660] [2024-06-20 19:01:05,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:20,920 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-20 19:01:20,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:20,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079837660] [2024-06-20 19:01:20,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079837660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:20,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:20,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:01:20,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678924934] [2024-06-20 19:01:20,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:20,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:01:20,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:20,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:01:20,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:01:21,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:01:21,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 363 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-20 19:01:21,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:21,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:01:21,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:22,573 INFO L124 PetriNetUnfolderBase]: 1856/2895 cut-off events. [2024-06-20 19:01:22,573 INFO L125 PetriNetUnfolderBase]: For 14786/14790 co-relation queries the response was YES. [2024-06-20 19:01:22,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10876 conditions, 2895 events. 1856/2895 cut-off events. For 14786/14790 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14760 event pairs, 731 based on Foata normal form. 8/2890 useless extension candidates. Maximal degree in co-relation 10850. Up to 2601 conditions per place. [2024-06-20 19:01:22,597 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 63 selfloop transitions, 26 changer transitions 0/95 dead transitions. [2024-06-20 19:01:22,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 95 transitions, 693 flow [2024-06-20 19:01:22,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:01:22,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:01:22,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-20 19:01:22,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487012987012987 [2024-06-20 19:01:22,599 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 363 flow. Second operand 7 states and 150 transitions. [2024-06-20 19:01:22,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 95 transitions, 693 flow [2024-06-20 19:01:22,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 95 transitions, 653 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-20 19:01:22,607 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 442 flow [2024-06-20 19:01:22,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=442, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2024-06-20 19:01:22,608 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 24 predicate places. [2024-06-20 19:01:22,610 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 442 flow [2024-06-20 19:01:22,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-20 19:01:22,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:22,611 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:22,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-20 19:01:22,611 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:01:22,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1663619872, now seen corresponding path program 2 times [2024-06-20 19:01:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:22,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570241167] [2024-06-20 19:01:22,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:22,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:37,377 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-20 19:01:37,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:37,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570241167] [2024-06-20 19:01:37,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570241167] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:37,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:37,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:01:37,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014294592] [2024-06-20 19:01:37,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:37,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:01:37,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:37,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:01:37,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:01:37,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:01:37,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 442 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-20 19:01:37,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:37,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:01:37,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:39,081 INFO L124 PetriNetUnfolderBase]: 1867/2907 cut-off events. [2024-06-20 19:01:39,082 INFO L125 PetriNetUnfolderBase]: For 18378/18378 co-relation queries the response was YES. [2024-06-20 19:01:39,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11745 conditions, 2907 events. 1867/2907 cut-off events. For 18378/18378 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14829 event pairs, 745 based on Foata normal form. 2/2895 useless extension candidates. Maximal degree in co-relation 11718. Up to 2608 conditions per place. [2024-06-20 19:01:39,096 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 60 selfloop transitions, 33 changer transitions 0/99 dead transitions. [2024-06-20 19:01:39,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 99 transitions, 824 flow [2024-06-20 19:01:39,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:01:39,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:01:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2024-06-20 19:01:39,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487012987012987 [2024-06-20 19:01:39,098 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 442 flow. Second operand 7 states and 150 transitions. [2024-06-20 19:01:39,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 99 transitions, 824 flow [2024-06-20 19:01:39,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 99 transitions, 788 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-20 19:01:39,105 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 542 flow [2024-06-20 19:01:39,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=542, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2024-06-20 19:01:39,106 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places. [2024-06-20 19:01:39,106 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 542 flow [2024-06-20 19:01:39,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-20 19:01:39,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:39,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:39,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-20 19:01:39,107 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:01:39,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash -883462560, now seen corresponding path program 3 times [2024-06-20 19:01:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:39,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341492036] [2024-06-20 19:01:39,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:39,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:01:54,482 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-20 19:01:54,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:01:54,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341492036] [2024-06-20 19:01:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341492036] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:01:54,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:01:54,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:01:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424768869] [2024-06-20 19:01:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:01:54,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:01:54,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:01:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:01:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:01:54,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:01:54,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 542 flow. Second operand has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-20 19:01:54,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:01:54,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:01:54,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:01:56,124 INFO L124 PetriNetUnfolderBase]: 1862/2900 cut-off events. [2024-06-20 19:01:56,124 INFO L125 PetriNetUnfolderBase]: For 21727/21727 co-relation queries the response was YES. [2024-06-20 19:01:56,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12205 conditions, 2900 events. 1862/2900 cut-off events. For 21727/21727 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14784 event pairs, 745 based on Foata normal form. 2/2888 useless extension candidates. Maximal degree in co-relation 12176. Up to 2605 conditions per place. [2024-06-20 19:01:56,149 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 57 selfloop transitions, 34 changer transitions 0/97 dead transitions. [2024-06-20 19:01:56,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 97 transitions, 820 flow [2024-06-20 19:01:56,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:01:56,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:01:56,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 148 transitions. [2024-06-20 19:01:56,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805194805194805 [2024-06-20 19:01:56,151 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 542 flow. Second operand 7 states and 148 transitions. [2024-06-20 19:01:56,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 97 transitions, 820 flow [2024-06-20 19:01:56,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 97 transitions, 765 flow, removed 19 selfloop flow, removed 2 redundant places. [2024-06-20 19:01:56,190 INFO L231 Difference]: Finished difference. Result has 78 places, 76 transitions, 563 flow [2024-06-20 19:01:56,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=563, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2024-06-20 19:01:56,191 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2024-06-20 19:01:56,191 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 563 flow [2024-06-20 19:01:56,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.375) internal successors, (99), 8 states have internal predecessors, (99), 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-20 19:01:56,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:01:56,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:01:56,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-20 19:01:56,192 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:01:56,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:01:56,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1752323353, now seen corresponding path program 1 times [2024-06-20 19:01:56,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:01:56,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164842216] [2024-06-20 19:01:56,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:01:56,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:01:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:11,439 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-20 19:02:11,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:11,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164842216] [2024-06-20 19:02:11,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164842216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:11,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:11,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 19:02:11,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434503706] [2024-06-20 19:02:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:11,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 19:02:11,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:11,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 19:02:11,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-20 19:02:11,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-20 19:02:11,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 563 flow. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-20 19:02:11,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:11,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-20 19:02:11,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:12,696 INFO L124 PetriNetUnfolderBase]: 1534/2560 cut-off events. [2024-06-20 19:02:12,696 INFO L125 PetriNetUnfolderBase]: For 20440/20440 co-relation queries the response was YES. [2024-06-20 19:02:12,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10683 conditions, 2560 events. 1534/2560 cut-off events. For 20440/20440 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 13956 event pairs, 581 based on Foata normal form. 1/2548 useless extension candidates. Maximal degree in co-relation 10651. Up to 2252 conditions per place. [2024-06-20 19:02:12,708 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 66 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2024-06-20 19:02:12,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 87 transitions, 753 flow [2024-06-20 19:02:12,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 19:02:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 19:02:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2024-06-20 19:02:12,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818181818181818 [2024-06-20 19:02:12,709 INFO L175 Difference]: Start difference. First operand has 78 places, 76 transitions, 563 flow. Second operand 5 states and 106 transitions. [2024-06-20 19:02:12,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 87 transitions, 753 flow [2024-06-20 19:02:12,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 87 transitions, 665 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-20 19:02:12,721 INFO L231 Difference]: Finished difference. Result has 76 places, 79 transitions, 525 flow [2024-06-20 19:02:12,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=525, PETRI_PLACES=76, PETRI_TRANSITIONS=79} [2024-06-20 19:02:12,721 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 31 predicate places. [2024-06-20 19:02:12,722 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 79 transitions, 525 flow [2024-06-20 19:02:12,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 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-20 19:02:12,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:12,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:12,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-20 19:02:12,722 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:02:12,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1641438136, now seen corresponding path program 1 times [2024-06-20 19:02:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364604948] [2024-06-20 19:02:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:27,307 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-20 19:02:27,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364604948] [2024-06-20 19:02:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364604948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:27,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:27,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:02:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602376370] [2024-06-20 19:02:27,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:27,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:02:27,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:27,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:02:27,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:02:27,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:02:27,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 525 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-20 19:02:27,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:27,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:02:27,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:29,019 INFO L124 PetriNetUnfolderBase]: 1870/2921 cut-off events. [2024-06-20 19:02:29,019 INFO L125 PetriNetUnfolderBase]: For 27028/27032 co-relation queries the response was YES. [2024-06-20 19:02:29,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12838 conditions, 2921 events. 1870/2921 cut-off events. For 27028/27032 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 14947 event pairs, 730 based on Foata normal form. 6/2927 useless extension candidates. Maximal degree in co-relation 12806. Up to 2613 conditions per place. [2024-06-20 19:02:29,034 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 67 selfloop transitions, 36 changer transitions 0/109 dead transitions. [2024-06-20 19:02:29,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 109 transitions, 883 flow [2024-06-20 19:02:29,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:02:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:02:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2024-06-20 19:02:29,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967532467532468 [2024-06-20 19:02:29,036 INFO L175 Difference]: Start difference. First operand has 76 places, 79 transitions, 525 flow. Second operand 7 states and 153 transitions. [2024-06-20 19:02:29,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 109 transitions, 883 flow [2024-06-20 19:02:29,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 109 transitions, 855 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-20 19:02:29,048 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 611 flow [2024-06-20 19:02:29,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2024-06-20 19:02:29,049 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2024-06-20 19:02:29,049 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 611 flow [2024-06-20 19:02:29,049 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-20 19:02:29,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:29,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:29,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-20 19:02:29,050 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:02:29,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:29,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1641432339, now seen corresponding path program 1 times [2024-06-20 19:02:29,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:29,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171535978] [2024-06-20 19:02:29,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:02:45,885 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-20 19:02:45,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:02:45,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171535978] [2024-06-20 19:02:45,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171535978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:02:45,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:02:45,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:02:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119787106] [2024-06-20 19:02:45,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:02:45,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:02:45,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:02:45,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:02:45,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:02:46,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:02:46,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 611 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-20 19:02:46,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:02:46,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:02:46,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:02:47,713 INFO L124 PetriNetUnfolderBase]: 1914/2996 cut-off events. [2024-06-20 19:02:47,714 INFO L125 PetriNetUnfolderBase]: For 31282/31286 co-relation queries the response was YES. [2024-06-20 19:02:47,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13498 conditions, 2996 events. 1914/2996 cut-off events. For 31282/31286 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15464 event pairs, 638 based on Foata normal form. 9/3005 useless extension candidates. Maximal degree in co-relation 13465. Up to 2529 conditions per place. [2024-06-20 19:02:47,729 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 77 selfloop transitions, 38 changer transitions 0/121 dead transitions. [2024-06-20 19:02:47,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 1039 flow [2024-06-20 19:02:47,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:02:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:02:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-20 19:02:47,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943181818181818 [2024-06-20 19:02:47,731 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 611 flow. Second operand 8 states and 174 transitions. [2024-06-20 19:02:47,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 1039 flow [2024-06-20 19:02:47,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 928 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:02:47,765 INFO L231 Difference]: Finished difference. Result has 82 places, 89 transitions, 653 flow [2024-06-20 19:02:47,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=653, PETRI_PLACES=82, PETRI_TRANSITIONS=89} [2024-06-20 19:02:47,766 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2024-06-20 19:02:47,766 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 89 transitions, 653 flow [2024-06-20 19:02:47,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-20 19:02:47,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:02:47,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:02:47,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-20 19:02:47,767 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:02:47,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:02:47,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1949063480, now seen corresponding path program 2 times [2024-06-20 19:02:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:02:47,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068875660] [2024-06-20 19:02:47,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:02:47,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:02:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:02,695 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-20 19:03:02,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:02,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068875660] [2024-06-20 19:03:02,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068875660] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:02,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:02,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:02,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888133751] [2024-06-20 19:03:02,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:02,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:02,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:02,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:02,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:02,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:03:02,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 89 transitions, 653 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-20 19:03:02,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:02,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:03:02,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:04,433 INFO L124 PetriNetUnfolderBase]: 1925/3017 cut-off events. [2024-06-20 19:03:04,433 INFO L125 PetriNetUnfolderBase]: For 35490/35492 co-relation queries the response was YES. [2024-06-20 19:03:04,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14355 conditions, 3017 events. 1925/3017 cut-off events. For 35490/35492 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15572 event pairs, 696 based on Foata normal form. 4/3021 useless extension candidates. Maximal degree in co-relation 14322. Up to 2689 conditions per place. [2024-06-20 19:03:04,448 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 74 selfloop transitions, 36 changer transitions 0/116 dead transitions. [2024-06-20 19:03:04,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 116 transitions, 1026 flow [2024-06-20 19:03:04,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:04,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:04,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 149 transitions. [2024-06-20 19:03:04,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837662337662338 [2024-06-20 19:03:04,450 INFO L175 Difference]: Start difference. First operand has 82 places, 89 transitions, 653 flow. Second operand 7 states and 149 transitions. [2024-06-20 19:03:04,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 116 transitions, 1026 flow [2024-06-20 19:03:04,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 116 transitions, 977 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-20 19:03:04,466 INFO L231 Difference]: Finished difference. Result has 85 places, 92 transitions, 720 flow [2024-06-20 19:03:04,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=720, PETRI_PLACES=85, PETRI_TRANSITIONS=92} [2024-06-20 19:03:04,466 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 40 predicate places. [2024-06-20 19:03:04,467 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 92 transitions, 720 flow [2024-06-20 19:03:04,467 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-20 19:03:04,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:04,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:04,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-20 19:03:04,467 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:03:04,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash 2017714575, now seen corresponding path program 2 times [2024-06-20 19:03:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:04,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77123621] [2024-06-20 19:03:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:04,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:20,417 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-20 19:03:20,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:20,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77123621] [2024-06-20 19:03:20,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77123621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:20,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:20,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924982300] [2024-06-20 19:03:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:20,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:20,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:20,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:03:20,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 92 transitions, 720 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-20 19:03:20,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:20,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:03:20,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:22,350 INFO L124 PetriNetUnfolderBase]: 1947/3032 cut-off events. [2024-06-20 19:03:22,351 INFO L125 PetriNetUnfolderBase]: For 40337/40337 co-relation queries the response was YES. [2024-06-20 19:03:22,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14784 conditions, 3032 events. 1947/3032 cut-off events. For 40337/40337 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15499 event pairs, 662 based on Foata normal form. 4/3035 useless extension candidates. Maximal degree in co-relation 14749. Up to 2545 conditions per place. [2024-06-20 19:03:22,367 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 70 selfloop transitions, 52 changer transitions 0/128 dead transitions. [2024-06-20 19:03:22,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 128 transitions, 1228 flow [2024-06-20 19:03:22,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 174 transitions. [2024-06-20 19:03:22,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943181818181818 [2024-06-20 19:03:22,368 INFO L175 Difference]: Start difference. First operand has 85 places, 92 transitions, 720 flow. Second operand 8 states and 174 transitions. [2024-06-20 19:03:22,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 128 transitions, 1228 flow [2024-06-20 19:03:22,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 128 transitions, 1162 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-20 19:03:22,384 INFO L231 Difference]: Finished difference. Result has 89 places, 98 transitions, 836 flow [2024-06-20 19:03:22,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=836, PETRI_PLACES=89, PETRI_TRANSITIONS=98} [2024-06-20 19:03:22,385 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 44 predicate places. [2024-06-20 19:03:22,385 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 98 transitions, 836 flow [2024-06-20 19:03:22,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-20 19:03:22,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:22,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:22,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-20 19:03:22,386 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:03:22,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:22,386 INFO L85 PathProgramCache]: Analyzing trace with hash 830631803, now seen corresponding path program 3 times [2024-06-20 19:03:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:22,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071708758] [2024-06-20 19:03:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:38,278 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-20 19:03:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071708758] [2024-06-20 19:03:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071708758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:38,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:03:38,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113148903] [2024-06-20 19:03:38,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:38,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:03:38,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:38,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:03:38,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:03:38,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:03:38,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 98 transitions, 836 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-20 19:03:38,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:38,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:03:38,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:40,109 INFO L124 PetriNetUnfolderBase]: 1969/3069 cut-off events. [2024-06-20 19:03:40,109 INFO L125 PetriNetUnfolderBase]: For 45828/45828 co-relation queries the response was YES. [2024-06-20 19:03:40,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15504 conditions, 3069 events. 1969/3069 cut-off events. For 45828/45828 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15763 event pairs, 662 based on Foata normal form. 4/3072 useless extension candidates. Maximal degree in co-relation 15468. Up to 2554 conditions per place. [2024-06-20 19:03:40,127 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 73 selfloop transitions, 53 changer transitions 0/132 dead transitions. [2024-06-20 19:03:40,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 132 transitions, 1334 flow [2024-06-20 19:03:40,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:03:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:03:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 175 transitions. [2024-06-20 19:03:40,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4971590909090909 [2024-06-20 19:03:40,128 INFO L175 Difference]: Start difference. First operand has 89 places, 98 transitions, 836 flow. Second operand 8 states and 175 transitions. [2024-06-20 19:03:40,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 132 transitions, 1334 flow [2024-06-20 19:03:40,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 132 transitions, 1240 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-20 19:03:40,154 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 896 flow [2024-06-20 19:03:40,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=896, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2024-06-20 19:03:40,155 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 48 predicate places. [2024-06-20 19:03:40,155 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 896 flow [2024-06-20 19:03:40,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-20 19:03:40,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:40,155 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:40,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-20 19:03:40,156 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:03:40,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:40,156 INFO L85 PathProgramCache]: Analyzing trace with hash 969406344, now seen corresponding path program 3 times [2024-06-20 19:03:40,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:40,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222058437] [2024-06-20 19:03:40,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:40,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:03:55,622 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-20 19:03:55,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:03:55,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222058437] [2024-06-20 19:03:55,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222058437] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:03:55,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:03:55,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:03:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691766710] [2024-06-20 19:03:55,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:03:55,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:03:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:03:55,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:03:55,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:03:55,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:03:55,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 896 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-20 19:03:55,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:03:55,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:03:55,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:03:57,397 INFO L124 PetriNetUnfolderBase]: 1964/3085 cut-off events. [2024-06-20 19:03:57,398 INFO L125 PetriNetUnfolderBase]: For 49465/49467 co-relation queries the response was YES. [2024-06-20 19:03:57,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15615 conditions, 3085 events. 1964/3085 cut-off events. For 49465/49467 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 16033 event pairs, 722 based on Foata normal form. 4/3088 useless extension candidates. Maximal degree in co-relation 15577. Up to 2748 conditions per place. [2024-06-20 19:03:57,414 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 80 selfloop transitions, 34 changer transitions 0/120 dead transitions. [2024-06-20 19:03:57,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 120 transitions, 1172 flow [2024-06-20 19:03:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:03:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:03:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2024-06-20 19:03:57,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-06-20 19:03:57,418 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 896 flow. Second operand 7 states and 143 transitions. [2024-06-20 19:03:57,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 120 transitions, 1172 flow [2024-06-20 19:03:57,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 120 transitions, 1060 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-20 19:03:57,446 INFO L231 Difference]: Finished difference. Result has 95 places, 101 transitions, 860 flow [2024-06-20 19:03:57,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=860, PETRI_PLACES=95, PETRI_TRANSITIONS=101} [2024-06-20 19:03:57,447 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 50 predicate places. [2024-06-20 19:03:57,447 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 860 flow [2024-06-20 19:03:57,447 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-20 19:03:57,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:03:57,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:03:57,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-20 19:03:57,447 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:03:57,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:03:57,448 INFO L85 PathProgramCache]: Analyzing trace with hash -32607059, now seen corresponding path program 4 times [2024-06-20 19:03:57,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:03:57,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639164979] [2024-06-20 19:03:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:03:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:03:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:13,913 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-20 19:04:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639164979] [2024-06-20 19:04:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639164979] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:04:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764453610] [2024-06-20 19:04:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:13,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:04:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:04:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:04:14,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:04:14,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 860 flow. Second operand has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-20 19:04:14,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:14,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:04:14,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:15,829 INFO L124 PetriNetUnfolderBase]: 1954/3047 cut-off events. [2024-06-20 19:04:15,829 INFO L125 PetriNetUnfolderBase]: For 53325/53325 co-relation queries the response was YES. [2024-06-20 19:04:15,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15530 conditions, 3047 events. 1954/3047 cut-off events. For 53325/53325 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15661 event pairs, 658 based on Foata normal form. 4/3050 useless extension candidates. Maximal degree in co-relation 15491. Up to 2547 conditions per place. [2024-06-20 19:04:15,845 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 72 selfloop transitions, 52 changer transitions 0/130 dead transitions. [2024-06-20 19:04:15,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 130 transitions, 1252 flow [2024-06-20 19:04:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:04:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:04:15,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2024-06-20 19:04:15,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914772727272727 [2024-06-20 19:04:15,849 INFO L175 Difference]: Start difference. First operand has 95 places, 101 transitions, 860 flow. Second operand 8 states and 173 transitions. [2024-06-20 19:04:15,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 130 transitions, 1252 flow [2024-06-20 19:04:15,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 130 transitions, 1139 flow, removed 8 selfloop flow, removed 7 redundant places. [2024-06-20 19:04:15,874 INFO L231 Difference]: Finished difference. Result has 96 places, 101 transitions, 859 flow [2024-06-20 19:04:15,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=747, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=859, PETRI_PLACES=96, PETRI_TRANSITIONS=101} [2024-06-20 19:04:15,875 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 51 predicate places. [2024-06-20 19:04:15,875 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 101 transitions, 859 flow [2024-06-20 19:04:15,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.333333333333334) internal successors, (111), 9 states have internal predecessors, (111), 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-20 19:04:15,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:15,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:15,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-20 19:04:15,876 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:04:15,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1493783763, now seen corresponding path program 1 times [2024-06-20 19:04:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:15,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431099752] [2024-06-20 19:04:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:15,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:31,719 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-20 19:04:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:31,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431099752] [2024-06-20 19:04:31,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431099752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:31,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:31,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:04:31,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273545432] [2024-06-20 19:04:31,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:31,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:04:31,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:31,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:04:31,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:04:31,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:04:31,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 101 transitions, 859 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-20 19:04:31,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:31,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:04:31,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:33,071 INFO L124 PetriNetUnfolderBase]: 1845/2972 cut-off events. [2024-06-20 19:04:33,072 INFO L125 PetriNetUnfolderBase]: For 56981/56981 co-relation queries the response was YES. [2024-06-20 19:04:33,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15391 conditions, 2972 events. 1845/2972 cut-off events. For 56981/56981 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15843 event pairs, 649 based on Foata normal form. 1/2973 useless extension candidates. Maximal degree in co-relation 15351. Up to 2703 conditions per place. [2024-06-20 19:04:33,090 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 88 selfloop transitions, 11 changer transitions 0/113 dead transitions. [2024-06-20 19:04:33,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 113 transitions, 1105 flow [2024-06-20 19:04:33,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:04:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:04:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2024-06-20 19:04:33,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2024-06-20 19:04:33,093 INFO L175 Difference]: Start difference. First operand has 96 places, 101 transitions, 859 flow. Second operand 6 states and 118 transitions. [2024-06-20 19:04:33,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 113 transitions, 1105 flow [2024-06-20 19:04:33,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 113 transitions, 962 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-06-20 19:04:33,118 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 776 flow [2024-06-20 19:04:33,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2024-06-20 19:04:33,119 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 49 predicate places. [2024-06-20 19:04:33,119 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 776 flow [2024-06-20 19:04:33,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-20 19:04:33,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:33,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:33,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-20 19:04:33,120 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:04:33,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash -296189015, now seen corresponding path program 1 times [2024-06-20 19:04:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:33,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369502571] [2024-06-20 19:04:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:33,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:04:49,854 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-20 19:04:49,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:04:49,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369502571] [2024-06-20 19:04:49,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369502571] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:04:49,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:04:49,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:04:49,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257073060] [2024-06-20 19:04:49,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:04:49,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:04:49,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:04:49,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:04:49,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:04:50,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:04:50,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 776 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-20 19:04:50,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:04:50,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:04:50,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:04:51,736 INFO L124 PetriNetUnfolderBase]: 1934/3071 cut-off events. [2024-06-20 19:04:51,736 INFO L125 PetriNetUnfolderBase]: For 71312/71314 co-relation queries the response was YES. [2024-06-20 19:04:51,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16849 conditions, 3071 events. 1934/3071 cut-off events. For 71312/71314 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16354 event pairs, 486 based on Foata normal form. 6/3077 useless extension candidates. Maximal degree in co-relation 16808. Up to 2634 conditions per place. [2024-06-20 19:04:51,756 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 96 selfloop transitions, 23 changer transitions 0/134 dead transitions. [2024-06-20 19:04:51,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 1206 flow [2024-06-20 19:04:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:04:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:04:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 153 transitions. [2024-06-20 19:04:51,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4967532467532468 [2024-06-20 19:04:51,759 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 776 flow. Second operand 7 states and 153 transitions. [2024-06-20 19:04:51,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 1206 flow [2024-06-20 19:04:51,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 134 transitions, 1168 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-20 19:04:51,785 INFO L231 Difference]: Finished difference. Result has 97 places, 108 transitions, 843 flow [2024-06-20 19:04:51,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=843, PETRI_PLACES=97, PETRI_TRANSITIONS=108} [2024-06-20 19:04:51,786 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 52 predicate places. [2024-06-20 19:04:51,786 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 108 transitions, 843 flow [2024-06-20 19:04:51,786 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-20 19:04:51,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:04:51,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:04:51,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-20 19:04:51,786 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:04:51,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:04:51,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1666993243, now seen corresponding path program 2 times [2024-06-20 19:04:51,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:04:51,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138142767] [2024-06-20 19:04:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:04:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:04:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:08,214 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-20 19:05:08,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:08,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138142767] [2024-06-20 19:05:08,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138142767] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:08,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:08,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:05:08,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631344781] [2024-06-20 19:05:08,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:08,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:05:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:08,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:05:08,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:05:08,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:05:08,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 108 transitions, 843 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-20 19:05:08,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:08,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:05:08,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:09,992 INFO L124 PetriNetUnfolderBase]: 1922/3050 cut-off events. [2024-06-20 19:05:09,992 INFO L125 PetriNetUnfolderBase]: For 77303/77305 co-relation queries the response was YES. [2024-06-20 19:05:10,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17221 conditions, 3050 events. 1922/3050 cut-off events. For 77303/77305 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16154 event pairs, 640 based on Foata normal form. 6/3056 useless extension candidates. Maximal degree in co-relation 17179. Up to 2695 conditions per place. [2024-06-20 19:05:10,010 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 95 selfloop transitions, 21 changer transitions 0/131 dead transitions. [2024-06-20 19:05:10,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 131 transitions, 1133 flow [2024-06-20 19:05:10,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:05:10,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:05:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-06-20 19:05:10,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4902597402597403 [2024-06-20 19:05:10,025 INFO L175 Difference]: Start difference. First operand has 97 places, 108 transitions, 843 flow. Second operand 7 states and 151 transitions. [2024-06-20 19:05:10,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 131 transitions, 1133 flow [2024-06-20 19:05:10,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 131 transitions, 1078 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-20 19:05:10,068 INFO L231 Difference]: Finished difference. Result has 101 places, 108 transitions, 837 flow [2024-06-20 19:05:10,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=837, PETRI_PLACES=101, PETRI_TRANSITIONS=108} [2024-06-20 19:05:10,070 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 56 predicate places. [2024-06-20 19:05:10,070 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 108 transitions, 837 flow [2024-06-20 19:05:10,070 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-20 19:05:10,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:10,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:10,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-20 19:05:10,070 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:05:10,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:10,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1551697113, now seen corresponding path program 1 times [2024-06-20 19:05:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:10,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451196288] [2024-06-20 19:05:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:26,063 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-20 19:05:26,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451196288] [2024-06-20 19:05:26,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451196288] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:26,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:26,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:05:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512822226] [2024-06-20 19:05:26,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:26,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:05:26,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:26,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:05:26,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:05:26,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:05:26,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 108 transitions, 837 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-20 19:05:26,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:26,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:05:26,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:28,035 INFO L124 PetriNetUnfolderBase]: 2053/3201 cut-off events. [2024-06-20 19:05:28,036 INFO L125 PetriNetUnfolderBase]: For 84058/84060 co-relation queries the response was YES. [2024-06-20 19:05:28,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18133 conditions, 3201 events. 2053/3201 cut-off events. For 84058/84060 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 16648 event pairs, 626 based on Foata normal form. 4/3205 useless extension candidates. Maximal degree in co-relation 18089. Up to 2649 conditions per place. [2024-06-20 19:05:28,058 INFO L140 encePairwiseOnDemand]: 32/44 looper letters, 84 selfloop transitions, 55 changer transitions 0/146 dead transitions. [2024-06-20 19:05:28,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 146 transitions, 1327 flow [2024-06-20 19:05:28,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:05:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:05:28,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2024-06-20 19:05:28,061 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5056818181818182 [2024-06-20 19:05:28,061 INFO L175 Difference]: Start difference. First operand has 101 places, 108 transitions, 837 flow. Second operand 8 states and 178 transitions. [2024-06-20 19:05:28,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 146 transitions, 1327 flow [2024-06-20 19:05:28,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 146 transitions, 1277 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-20 19:05:28,148 INFO L231 Difference]: Finished difference. Result has 103 places, 111 transitions, 943 flow [2024-06-20 19:05:28,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=943, PETRI_PLACES=103, PETRI_TRANSITIONS=111} [2024-06-20 19:05:28,149 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 58 predicate places. [2024-06-20 19:05:28,149 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 111 transitions, 943 flow [2024-06-20 19:05:28,150 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-20 19:05:28,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:28,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:28,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-20 19:05:28,150 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:05:28,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:28,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1551517623, now seen corresponding path program 2 times [2024-06-20 19:05:28,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:28,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875122605] [2024-06-20 19:05:28,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:28,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:05:45,452 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-20 19:05:45,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:05:45,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875122605] [2024-06-20 19:05:45,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875122605] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:05:45,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:05:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:05:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724674586] [2024-06-20 19:05:45,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:05:45,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:05:45,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:05:45,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:05:45,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:05:45,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:05:45,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 111 transitions, 943 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-20 19:05:45,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:05:45,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:05:45,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:05:47,519 INFO L124 PetriNetUnfolderBase]: 2107/3294 cut-off events. [2024-06-20 19:05:47,519 INFO L125 PetriNetUnfolderBase]: For 92778/92780 co-relation queries the response was YES. [2024-06-20 19:05:47,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19139 conditions, 3294 events. 2107/3294 cut-off events. For 92778/92780 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17249 event pairs, 628 based on Foata normal form. 4/3298 useless extension candidates. Maximal degree in co-relation 19094. Up to 2695 conditions per place. [2024-06-20 19:05:47,537 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 87 selfloop transitions, 57 changer transitions 0/151 dead transitions. [2024-06-20 19:05:47,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 151 transitions, 1585 flow [2024-06-20 19:05:47,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:05:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:05:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-06-20 19:05:47,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-20 19:05:47,540 INFO L175 Difference]: Start difference. First operand has 103 places, 111 transitions, 943 flow. Second operand 8 states and 176 transitions. [2024-06-20 19:05:47,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 151 transitions, 1585 flow [2024-06-20 19:05:47,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 151 transitions, 1400 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-06-20 19:05:47,582 INFO L231 Difference]: Finished difference. Result has 104 places, 117 transitions, 969 flow [2024-06-20 19:05:47,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=969, PETRI_PLACES=104, PETRI_TRANSITIONS=117} [2024-06-20 19:05:47,583 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 59 predicate places. [2024-06-20 19:05:47,583 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 117 transitions, 969 flow [2024-06-20 19:05:47,583 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-20 19:05:47,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:05:47,584 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:05:47,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-20 19:05:47,584 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:05:47,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:05:47,585 INFO L85 PathProgramCache]: Analyzing trace with hash 655199737, now seen corresponding path program 3 times [2024-06-20 19:05:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:05:47,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742412396] [2024-06-20 19:05:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:05:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:05:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:03,491 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-20 19:06:03,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:03,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742412396] [2024-06-20 19:06:03,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742412396] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:03,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:03,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:06:03,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941096805] [2024-06-20 19:06:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:03,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:06:03,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:03,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:06:03,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:06:03,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:06:03,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 117 transitions, 969 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-20 19:06:03,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:03,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:06:03,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:05,475 INFO L124 PetriNetUnfolderBase]: 2097/3280 cut-off events. [2024-06-20 19:06:05,475 INFO L125 PetriNetUnfolderBase]: For 97813/97815 co-relation queries the response was YES. [2024-06-20 19:06:05,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19158 conditions, 3280 events. 2097/3280 cut-off events. For 97813/97815 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17175 event pairs, 633 based on Foata normal form. 4/3284 useless extension candidates. Maximal degree in co-relation 19113. Up to 2687 conditions per place. [2024-06-20 19:06:05,498 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 87 selfloop transitions, 56 changer transitions 0/150 dead transitions. [2024-06-20 19:06:05,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 150 transitions, 1431 flow [2024-06-20 19:06:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:06:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:06:05,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-06-20 19:06:05,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-20 19:06:05,502 INFO L175 Difference]: Start difference. First operand has 104 places, 117 transitions, 969 flow. Second operand 8 states and 176 transitions. [2024-06-20 19:06:05,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 150 transitions, 1431 flow [2024-06-20 19:06:05,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 150 transitions, 1322 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-20 19:06:05,541 INFO L231 Difference]: Finished difference. Result has 108 places, 117 transitions, 980 flow [2024-06-20 19:06:05,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=980, PETRI_PLACES=108, PETRI_TRANSITIONS=117} [2024-06-20 19:06:05,541 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 63 predicate places. [2024-06-20 19:06:05,542 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 117 transitions, 980 flow [2024-06-20 19:06:05,542 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-20 19:06:05,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:05,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:05,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-20 19:06:05,542 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:06:05,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:05,543 INFO L85 PathProgramCache]: Analyzing trace with hash -950690736, now seen corresponding path program 1 times [2024-06-20 19:06:05,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:05,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119922091] [2024-06-20 19:06:05,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:05,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:22,291 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-20 19:06:22,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:22,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119922091] [2024-06-20 19:06:22,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119922091] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:22,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:22,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:06:22,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599337017] [2024-06-20 19:06:22,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:22,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:06:22,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:22,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:06:22,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:06:22,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:06:22,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 117 transitions, 980 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-20 19:06:22,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:22,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:06:22,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:23,850 INFO L124 PetriNetUnfolderBase]: 2018/3202 cut-off events. [2024-06-20 19:06:23,851 INFO L125 PetriNetUnfolderBase]: For 103698/103698 co-relation queries the response was YES. [2024-06-20 19:06:23,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19109 conditions, 3202 events. 2018/3202 cut-off events. For 103698/103698 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 17088 event pairs, 650 based on Foata normal form. 1/3203 useless extension candidates. Maximal degree in co-relation 19063. Up to 2897 conditions per place. [2024-06-20 19:06:23,876 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 109 selfloop transitions, 11 changer transitions 0/135 dead transitions. [2024-06-20 19:06:23,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 135 transitions, 1286 flow [2024-06-20 19:06:23,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:06:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:06:23,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-06-20 19:06:23,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-06-20 19:06:23,877 INFO L175 Difference]: Start difference. First operand has 108 places, 117 transitions, 980 flow. Second operand 6 states and 124 transitions. [2024-06-20 19:06:23,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 135 transitions, 1286 flow [2024-06-20 19:06:23,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 135 transitions, 1161 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-20 19:06:23,924 INFO L231 Difference]: Finished difference. Result has 107 places, 120 transitions, 917 flow [2024-06-20 19:06:23,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=917, PETRI_PLACES=107, PETRI_TRANSITIONS=120} [2024-06-20 19:06:23,925 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 62 predicate places. [2024-06-20 19:06:23,925 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 120 transitions, 917 flow [2024-06-20 19:06:23,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-20 19:06:23,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:23,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:23,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-20 19:06:23,925 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:06:23,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1404323913, now seen corresponding path program 4 times [2024-06-20 19:06:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:23,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982018779] [2024-06-20 19:06:23,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:40,369 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-20 19:06:40,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:40,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982018779] [2024-06-20 19:06:40,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982018779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:40,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:40,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:06:40,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368110440] [2024-06-20 19:06:40,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:40,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:06:40,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:40,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:06:40,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:06:40,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:06:40,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 120 transitions, 917 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-20 19:06:40,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:40,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:06:40,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:06:42,352 INFO L124 PetriNetUnfolderBase]: 2150/3356 cut-off events. [2024-06-20 19:06:42,352 INFO L125 PetriNetUnfolderBase]: For 111581/111583 co-relation queries the response was YES. [2024-06-20 19:06:42,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20063 conditions, 3356 events. 2150/3356 cut-off events. For 111581/111583 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 17584 event pairs, 657 based on Foata normal form. 6/3361 useless extension candidates. Maximal degree in co-relation 20016. Up to 2739 conditions per place. [2024-06-20 19:06:42,376 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 84 selfloop transitions, 60 changer transitions 0/151 dead transitions. [2024-06-20 19:06:42,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 151 transitions, 1413 flow [2024-06-20 19:06:42,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:06:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:06:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-06-20 19:06:42,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-20 19:06:42,380 INFO L175 Difference]: Start difference. First operand has 107 places, 120 transitions, 917 flow. Second operand 8 states and 168 transitions. [2024-06-20 19:06:42,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 151 transitions, 1413 flow [2024-06-20 19:06:42,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 151 transitions, 1373 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-06-20 19:06:42,430 INFO L231 Difference]: Finished difference. Result has 111 places, 123 transitions, 1043 flow [2024-06-20 19:06:42,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1043, PETRI_PLACES=111, PETRI_TRANSITIONS=123} [2024-06-20 19:06:42,435 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 66 predicate places. [2024-06-20 19:06:42,435 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 123 transitions, 1043 flow [2024-06-20 19:06:42,435 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-20 19:06:42,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:06:42,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:06:42,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-20 19:06:42,436 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:06:42,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:06:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -782916475, now seen corresponding path program 5 times [2024-06-20 19:06:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:06:42,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442737743] [2024-06-20 19:06:42,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:06:42,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:06:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:06:59,040 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-20 19:06:59,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:06:59,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442737743] [2024-06-20 19:06:59,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442737743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:06:59,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:06:59,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:06:59,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768111763] [2024-06-20 19:06:59,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:06:59,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:06:59,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:06:59,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:06:59,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:06:59,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:06:59,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 123 transitions, 1043 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-20 19:06:59,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:06:59,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:06:59,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:00,960 INFO L124 PetriNetUnfolderBase]: 2172/3393 cut-off events. [2024-06-20 19:07:00,960 INFO L125 PetriNetUnfolderBase]: For 120225/120227 co-relation queries the response was YES. [2024-06-20 19:07:00,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20811 conditions, 3393 events. 2172/3393 cut-off events. For 120225/120227 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17867 event pairs, 652 based on Foata normal form. 6/3398 useless extension candidates. Maximal degree in co-relation 20763. Up to 2758 conditions per place. [2024-06-20 19:07:00,985 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 89 selfloop transitions, 59 changer transitions 0/155 dead transitions. [2024-06-20 19:07:00,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 155 transitions, 1559 flow [2024-06-20 19:07:00,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:07:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:07:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2024-06-20 19:07:00,988 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48579545454545453 [2024-06-20 19:07:00,988 INFO L175 Difference]: Start difference. First operand has 111 places, 123 transitions, 1043 flow. Second operand 8 states and 171 transitions. [2024-06-20 19:07:00,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 155 transitions, 1559 flow [2024-06-20 19:07:01,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 155 transitions, 1433 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-20 19:07:01,057 INFO L231 Difference]: Finished difference. Result has 114 places, 126 transitions, 1087 flow [2024-06-20 19:07:01,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1087, PETRI_PLACES=114, PETRI_TRANSITIONS=126} [2024-06-20 19:07:01,059 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 69 predicate places. [2024-06-20 19:07:01,059 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 126 transitions, 1087 flow [2024-06-20 19:07:01,060 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-20 19:07:01,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:01,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:01,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-20 19:07:01,060 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:07:01,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:01,060 INFO L85 PathProgramCache]: Analyzing trace with hash -782922985, now seen corresponding path program 6 times [2024-06-20 19:07:01,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:01,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245881857] [2024-06-20 19:07:01,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:01,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:17,571 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-20 19:07:17,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:17,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245881857] [2024-06-20 19:07:17,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245881857] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:17,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:17,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:07:17,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17136676] [2024-06-20 19:07:17,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:17,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:07:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:17,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:07:17,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:07:17,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:07:17,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 126 transitions, 1087 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-20 19:07:17,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:17,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:07:17,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:19,587 INFO L124 PetriNetUnfolderBase]: 2162/3379 cut-off events. [2024-06-20 19:07:19,587 INFO L125 PetriNetUnfolderBase]: For 126609/126611 co-relation queries the response was YES. [2024-06-20 19:07:19,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20840 conditions, 3379 events. 2162/3379 cut-off events. For 126609/126611 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 17707 event pairs, 650 based on Foata normal form. 6/3384 useless extension candidates. Maximal degree in co-relation 20791. Up to 2750 conditions per place. [2024-06-20 19:07:19,609 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 86 selfloop transitions, 60 changer transitions 0/153 dead transitions. [2024-06-20 19:07:19,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 153 transitions, 1445 flow [2024-06-20 19:07:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:07:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:07:19,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-06-20 19:07:19,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-20 19:07:19,610 INFO L175 Difference]: Start difference. First operand has 114 places, 126 transitions, 1087 flow. Second operand 8 states and 168 transitions. [2024-06-20 19:07:19,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 153 transitions, 1445 flow [2024-06-20 19:07:19,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 153 transitions, 1254 flow, removed 12 selfloop flow, removed 7 redundant places. [2024-06-20 19:07:19,663 INFO L231 Difference]: Finished difference. Result has 115 places, 126 transitions, 1024 flow [2024-06-20 19:07:19,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1024, PETRI_PLACES=115, PETRI_TRANSITIONS=126} [2024-06-20 19:07:19,664 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places. [2024-06-20 19:07:19,664 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 126 transitions, 1024 flow [2024-06-20 19:07:19,664 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-20 19:07:19,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:19,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:19,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-20 19:07:19,664 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:07:19,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:19,665 INFO L85 PathProgramCache]: Analyzing trace with hash -937358256, now seen corresponding path program 2 times [2024-06-20 19:07:19,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:19,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887038900] [2024-06-20 19:07:19,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:19,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:07:35,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:35,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887038900] [2024-06-20 19:07:35,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887038900] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:35,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:35,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:07:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260722765] [2024-06-20 19:07:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:35,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:07:35,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:35,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:07:35,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:07:35,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:07:35,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 126 transitions, 1024 flow. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-20 19:07:35,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:35,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:07:35,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:37,004 INFO L124 PetriNetUnfolderBase]: 2045/3261 cut-off events. [2024-06-20 19:07:37,005 INFO L125 PetriNetUnfolderBase]: For 131999/132005 co-relation queries the response was YES. [2024-06-20 19:07:37,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20531 conditions, 3261 events. 2045/3261 cut-off events. For 131999/132005 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 17516 event pairs, 660 based on Foata normal form. 7/3268 useless extension candidates. Maximal degree in co-relation 20481. Up to 2933 conditions per place. [2024-06-20 19:07:37,025 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 107 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2024-06-20 19:07:37,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 138 transitions, 1326 flow [2024-06-20 19:07:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:07:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:07:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-06-20 19:07:37,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-20 19:07:37,026 INFO L175 Difference]: Start difference. First operand has 115 places, 126 transitions, 1024 flow. Second operand 6 states and 120 transitions. [2024-06-20 19:07:37,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 138 transitions, 1326 flow [2024-06-20 19:07:37,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 138 transitions, 1169 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-06-20 19:07:37,075 INFO L231 Difference]: Finished difference. Result has 113 places, 129 transitions, 945 flow [2024-06-20 19:07:37,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=945, PETRI_PLACES=113, PETRI_TRANSITIONS=129} [2024-06-20 19:07:37,075 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 68 predicate places. [2024-06-20 19:07:37,075 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 129 transitions, 945 flow [2024-06-20 19:07:37,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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-20 19:07:37,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:37,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:37,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-20 19:07:37,076 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:07:37,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:37,077 INFO L85 PathProgramCache]: Analyzing trace with hash -944970864, now seen corresponding path program 1 times [2024-06-20 19:07:37,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:37,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560420310] [2024-06-20 19:07:37,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:37,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:07:52,461 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-20 19:07:52,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:07:52,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560420310] [2024-06-20 19:07:52,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560420310] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:07:52,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:07:52,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:07:52,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283660921] [2024-06-20 19:07:52,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:07:52,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:07:52,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:07:52,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:07:52,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:07:52,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-20 19:07:52,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 129 transitions, 945 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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-20 19:07:52,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:07:52,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-20 19:07:52,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:07:53,897 INFO L124 PetriNetUnfolderBase]: 1821/3018 cut-off events. [2024-06-20 19:07:53,898 INFO L125 PetriNetUnfolderBase]: For 120404/120404 co-relation queries the response was YES. [2024-06-20 19:07:53,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18636 conditions, 3018 events. 1821/3018 cut-off events. For 120404/120404 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 16799 event pairs, 560 based on Foata normal form. 1/3019 useless extension candidates. Maximal degree in co-relation 18585. Up to 2618 conditions per place. [2024-06-20 19:07:53,919 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 117 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2024-06-20 19:07:53,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 144 transitions, 1261 flow [2024-06-20 19:07:53,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:07:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:07:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-20 19:07:53,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-20 19:07:53,921 INFO L175 Difference]: Start difference. First operand has 113 places, 129 transitions, 945 flow. Second operand 6 states and 126 transitions. [2024-06-20 19:07:53,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 144 transitions, 1261 flow [2024-06-20 19:07:53,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 144 transitions, 1205 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-20 19:07:53,970 INFO L231 Difference]: Finished difference. Result has 115 places, 132 transitions, 953 flow [2024-06-20 19:07:53,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=115, PETRI_TRANSITIONS=132} [2024-06-20 19:07:53,972 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 70 predicate places. [2024-06-20 19:07:53,972 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 132 transitions, 953 flow [2024-06-20 19:07:53,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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-20 19:07:53,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:07:53,972 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:07:53,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-20 19:07:53,972 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:07:53,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:07:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1404631743, now seen corresponding path program 1 times [2024-06-20 19:07:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:07:53,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766853682] [2024-06-20 19:07:53,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:07:53,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:07:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:08,898 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-20 19:08:08,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:08,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766853682] [2024-06-20 19:08:08,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766853682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:08,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:08,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-20 19:08:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941151466] [2024-06-20 19:08:08,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:08,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 19:08:08,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:08,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 19:08:08,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-20 19:08:09,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:08:09,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 132 transitions, 953 flow. Second operand has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:09,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:09,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:08:09,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:10,901 INFO L124 PetriNetUnfolderBase]: 1913/3104 cut-off events. [2024-06-20 19:08:10,902 INFO L125 PetriNetUnfolderBase]: For 126859/126859 co-relation queries the response was YES. [2024-06-20 19:08:10,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19362 conditions, 3104 events. 1913/3104 cut-off events. For 126859/126859 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 16839 event pairs, 549 based on Foata normal form. 4/3108 useless extension candidates. Maximal degree in co-relation 19310. Up to 2742 conditions per place. [2024-06-20 19:08:10,926 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 138 selfloop transitions, 19 changer transitions 0/165 dead transitions. [2024-06-20 19:08:10,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 165 transitions, 1387 flow [2024-06-20 19:08:10,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-20 19:08:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-20 19:08:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-06-20 19:08:10,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4595959595959596 [2024-06-20 19:08:10,930 INFO L175 Difference]: Start difference. First operand has 115 places, 132 transitions, 953 flow. Second operand 9 states and 182 transitions. [2024-06-20 19:08:10,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 165 transitions, 1387 flow [2024-06-20 19:08:10,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 165 transitions, 1345 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-20 19:08:10,987 INFO L231 Difference]: Finished difference. Result has 121 places, 137 transitions, 1016 flow [2024-06-20 19:08:10,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=911, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1016, PETRI_PLACES=121, PETRI_TRANSITIONS=137} [2024-06-20 19:08:10,987 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 76 predicate places. [2024-06-20 19:08:10,988 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 137 transitions, 1016 flow [2024-06-20 19:08:10,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.3) internal successors, (133), 10 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:08:10,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:10,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:10,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-20 19:08:10,988 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:08:10,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:10,989 INFO L85 PathProgramCache]: Analyzing trace with hash -355534074, now seen corresponding path program 2 times [2024-06-20 19:08:10,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:10,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514327225] [2024-06-20 19:08:10,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:10,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:26,513 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-20 19:08:26,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:26,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514327225] [2024-06-20 19:08:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514327225] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:26,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:26,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-20 19:08:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345445990] [2024-06-20 19:08:26,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:26,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-20 19:08:26,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:26,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-20 19:08:26,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-20 19:08:26,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-06-20 19:08:26,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 137 transitions, 1016 flow. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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-20 19:08:26,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:26,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-06-20 19:08:26,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:27,896 INFO L124 PetriNetUnfolderBase]: 1811/3002 cut-off events. [2024-06-20 19:08:27,897 INFO L125 PetriNetUnfolderBase]: For 133290/133292 co-relation queries the response was YES. [2024-06-20 19:08:27,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19496 conditions, 3002 events. 1811/3002 cut-off events. For 133290/133292 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 16684 event pairs, 540 based on Foata normal form. 3/3005 useless extension candidates. Maximal degree in co-relation 19442. Up to 2597 conditions per place. [2024-06-20 19:08:27,916 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 117 selfloop transitions, 16 changer transitions 0/149 dead transitions. [2024-06-20 19:08:27,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 1342 flow [2024-06-20 19:08:27,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 19:08:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 19:08:27,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2024-06-20 19:08:27,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2024-06-20 19:08:27,918 INFO L175 Difference]: Start difference. First operand has 121 places, 137 transitions, 1016 flow. Second operand 6 states and 125 transitions. [2024-06-20 19:08:27,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 1342 flow [2024-06-20 19:08:27,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 149 transitions, 1277 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-20 19:08:27,981 INFO L231 Difference]: Finished difference. Result has 121 places, 140 transitions, 1033 flow [2024-06-20 19:08:27,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=951, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1033, PETRI_PLACES=121, PETRI_TRANSITIONS=140} [2024-06-20 19:08:27,982 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 76 predicate places. [2024-06-20 19:08:27,982 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 140 transitions, 1033 flow [2024-06-20 19:08:27,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 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-20 19:08:27,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:27,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:27,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-20 19:08:27,982 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:08:27,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:27,983 INFO L85 PathProgramCache]: Analyzing trace with hash -937342384, now seen corresponding path program 1 times [2024-06-20 19:08:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:27,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93523743] [2024-06-20 19:08:27,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:27,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:08:43,942 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-20 19:08:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:08:43,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93523743] [2024-06-20 19:08:43,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93523743] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:08:43,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:08:43,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:08:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651453505] [2024-06-20 19:08:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:08:43,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:08:43,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:08:43,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:08:43,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:08:44,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:08:44,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 140 transitions, 1033 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-20 19:08:44,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:08:44,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:08:44,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:08:45,442 INFO L124 PetriNetUnfolderBase]: 1942/3131 cut-off events. [2024-06-20 19:08:45,443 INFO L125 PetriNetUnfolderBase]: For 139401/139401 co-relation queries the response was YES. [2024-06-20 19:08:45,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20422 conditions, 3131 events. 1942/3131 cut-off events. For 139401/139401 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 16821 event pairs, 584 based on Foata normal form. 1/3132 useless extension candidates. Maximal degree in co-relation 20367. Up to 2840 conditions per place. [2024-06-20 19:08:45,464 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 125 selfloop transitions, 14 changer transitions 0/153 dead transitions. [2024-06-20 19:08:45,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 153 transitions, 1375 flow [2024-06-20 19:08:45,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:08:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:08:45,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-20 19:08:45,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2024-06-20 19:08:45,466 INFO L175 Difference]: Start difference. First operand has 121 places, 140 transitions, 1033 flow. Second operand 7 states and 134 transitions. [2024-06-20 19:08:45,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 153 transitions, 1375 flow [2024-06-20 19:08:45,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 153 transitions, 1315 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-06-20 19:08:45,514 INFO L231 Difference]: Finished difference. Result has 124 places, 143 transitions, 1053 flow [2024-06-20 19:08:45,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1053, PETRI_PLACES=124, PETRI_TRANSITIONS=143} [2024-06-20 19:08:45,515 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 79 predicate places. [2024-06-20 19:08:45,515 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 143 transitions, 1053 flow [2024-06-20 19:08:45,515 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-20 19:08:45,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:08:45,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:08:45,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-20 19:08:45,515 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:08:45,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:08:45,516 INFO L85 PathProgramCache]: Analyzing trace with hash -225747351, now seen corresponding path program 1 times [2024-06-20 19:08:45,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:08:45,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740915191] [2024-06-20 19:08:45,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:08:45,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:08:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:01,650 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-20 19:09:01,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:01,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740915191] [2024-06-20 19:09:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740915191] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:01,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:01,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:09:01,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877739317] [2024-06-20 19:09:01,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:01,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:09:01,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:01,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:09:01,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:09:01,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:09:01,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 143 transitions, 1053 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-20 19:09:01,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:01,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:09:01,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:03,552 INFO L124 PetriNetUnfolderBase]: 2168/3389 cut-off events. [2024-06-20 19:09:03,552 INFO L125 PetriNetUnfolderBase]: For 172876/172878 co-relation queries the response was YES. [2024-06-20 19:09:03,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23302 conditions, 3389 events. 2168/3389 cut-off events. For 172876/172878 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 17655 event pairs, 458 based on Foata normal form. 6/3395 useless extension candidates. Maximal degree in co-relation 23246. Up to 2835 conditions per place. [2024-06-20 19:09:03,578 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 131 selfloop transitions, 40 changer transitions 0/178 dead transitions. [2024-06-20 19:09:03,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 178 transitions, 1653 flow [2024-06-20 19:09:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:09:03,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:09:03,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 168 transitions. [2024-06-20 19:09:03,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-20 19:09:03,586 INFO L175 Difference]: Start difference. First operand has 124 places, 143 transitions, 1053 flow. Second operand 8 states and 168 transitions. [2024-06-20 19:09:03,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 178 transitions, 1653 flow [2024-06-20 19:09:03,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 178 transitions, 1595 flow, removed 17 selfloop flow, removed 5 redundant places. [2024-06-20 19:09:03,661 INFO L231 Difference]: Finished difference. Result has 127 places, 147 transitions, 1142 flow [2024-06-20 19:09:03,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=995, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1142, PETRI_PLACES=127, PETRI_TRANSITIONS=147} [2024-06-20 19:09:03,661 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 82 predicate places. [2024-06-20 19:09:03,662 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 147 transitions, 1142 flow [2024-06-20 19:09:03,662 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-20 19:09:03,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:03,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:03,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-20 19:09:03,662 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:09:03,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash -223869681, now seen corresponding path program 2 times [2024-06-20 19:09:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:03,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277646348] [2024-06-20 19:09:03,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:03,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:20,561 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-20 19:09:20,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277646348] [2024-06-20 19:09:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277646348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:20,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:20,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:09:20,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879441161] [2024-06-20 19:09:20,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:20,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:09:20,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:20,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:09:20,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:09:20,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:09:20,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 147 transitions, 1142 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-20 19:09:20,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:20,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:09:20,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:22,504 INFO L124 PetriNetUnfolderBase]: 2185/3416 cut-off events. [2024-06-20 19:09:22,504 INFO L125 PetriNetUnfolderBase]: For 182672/182674 co-relation queries the response was YES. [2024-06-20 19:09:22,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23942 conditions, 3416 events. 2185/3416 cut-off events. For 182672/182674 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 17816 event pairs, 630 based on Foata normal form. 6/3422 useless extension candidates. Maximal degree in co-relation 23885. Up to 3015 conditions per place. [2024-06-20 19:09:22,530 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 131 selfloop transitions, 38 changer transitions 0/176 dead transitions. [2024-06-20 19:09:22,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 176 transitions, 1580 flow [2024-06-20 19:09:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:09:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:09:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 166 transitions. [2024-06-20 19:09:22,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4715909090909091 [2024-06-20 19:09:22,533 INFO L175 Difference]: Start difference. First operand has 127 places, 147 transitions, 1142 flow. Second operand 8 states and 166 transitions. [2024-06-20 19:09:22,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 176 transitions, 1580 flow [2024-06-20 19:09:22,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 176 transitions, 1502 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-20 19:09:22,604 INFO L231 Difference]: Finished difference. Result has 131 places, 149 transitions, 1183 flow [2024-06-20 19:09:22,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1183, PETRI_PLACES=131, PETRI_TRANSITIONS=149} [2024-06-20 19:09:22,605 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 86 predicate places. [2024-06-20 19:09:22,605 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 149 transitions, 1183 flow [2024-06-20 19:09:22,605 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-20 19:09:22,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:22,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:22,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-20 19:09:22,606 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:09:22,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:22,606 INFO L85 PathProgramCache]: Analyzing trace with hash -137181591, now seen corresponding path program 3 times [2024-06-20 19:09:22,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:22,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374602501] [2024-06-20 19:09:22,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:22,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:38,755 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-20 19:09:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:38,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374602501] [2024-06-20 19:09:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374602501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:38,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:38,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:09:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023835949] [2024-06-20 19:09:38,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:38,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:09:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:38,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:09:38,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:09:38,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:09:38,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 149 transitions, 1183 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-20 19:09:38,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:38,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:09:38,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:40,740 INFO L124 PetriNetUnfolderBase]: 2202/3443 cut-off events. [2024-06-20 19:09:40,740 INFO L125 PetriNetUnfolderBase]: For 192571/192573 co-relation queries the response was YES. [2024-06-20 19:09:40,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24399 conditions, 3443 events. 2202/3443 cut-off events. For 192571/192573 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 17960 event pairs, 630 based on Foata normal form. 6/3449 useless extension candidates. Maximal degree in co-relation 24340. Up to 3001 conditions per place. [2024-06-20 19:09:40,766 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 131 selfloop transitions, 41 changer transitions 0/179 dead transitions. [2024-06-20 19:09:40,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 179 transitions, 1625 flow [2024-06-20 19:09:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:09:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:09:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2024-06-20 19:09:40,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744318181818182 [2024-06-20 19:09:40,768 INFO L175 Difference]: Start difference. First operand has 131 places, 149 transitions, 1183 flow. Second operand 8 states and 167 transitions. [2024-06-20 19:09:40,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 179 transitions, 1625 flow [2024-06-20 19:09:40,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 179 transitions, 1536 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 19:09:40,839 INFO L231 Difference]: Finished difference. Result has 133 places, 151 transitions, 1215 flow [2024-06-20 19:09:40,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1215, PETRI_PLACES=133, PETRI_TRANSITIONS=151} [2024-06-20 19:09:40,840 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 88 predicate places. [2024-06-20 19:09:40,840 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 151 transitions, 1215 flow [2024-06-20 19:09:40,840 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-20 19:09:40,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:40,841 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:40,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-20 19:09:40,841 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:09:40,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:40,841 INFO L85 PathProgramCache]: Analyzing trace with hash 593000960, now seen corresponding path program 1 times [2024-06-20 19:09:40,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:40,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799103277] [2024-06-20 19:09:40,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:40,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:40,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:09:56,837 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-20 19:09:56,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:09:56,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799103277] [2024-06-20 19:09:56,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799103277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:09:56,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:09:56,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:09:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804579499] [2024-06-20 19:09:56,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:09:56,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:09:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:09:56,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:09:56,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:09:56,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:09:56,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 151 transitions, 1215 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-20 19:09:56,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:09:56,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:09:56,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:09:58,548 INFO L124 PetriNetUnfolderBase]: 2097/3343 cut-off events. [2024-06-20 19:09:58,549 INFO L125 PetriNetUnfolderBase]: For 201507/201509 co-relation queries the response was YES. [2024-06-20 19:09:58,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24206 conditions, 3343 events. 2097/3343 cut-off events. For 201507/201509 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 17946 event pairs, 625 based on Foata normal form. 4/3347 useless extension candidates. Maximal degree in co-relation 24146. Up to 2921 conditions per place. [2024-06-20 19:09:58,575 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 134 selfloop transitions, 24 changer transitions 0/177 dead transitions. [2024-06-20 19:09:58,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 177 transitions, 1639 flow [2024-06-20 19:09:58,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:09:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:09:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2024-06-20 19:09:58,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4902597402597403 [2024-06-20 19:09:58,576 INFO L175 Difference]: Start difference. First operand has 133 places, 151 transitions, 1215 flow. Second operand 7 states and 151 transitions. [2024-06-20 19:09:58,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 177 transitions, 1639 flow [2024-06-20 19:09:58,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 177 transitions, 1540 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-20 19:09:58,661 INFO L231 Difference]: Finished difference. Result has 134 places, 155 transitions, 1231 flow [2024-06-20 19:09:58,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1231, PETRI_PLACES=134, PETRI_TRANSITIONS=155} [2024-06-20 19:09:58,662 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 89 predicate places. [2024-06-20 19:09:58,662 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 155 transitions, 1231 flow [2024-06-20 19:09:58,662 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-20 19:09:58,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:09:58,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:09:58,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-20 19:09:58,662 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:09:58,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:09:58,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1169159383, now seen corresponding path program 4 times [2024-06-20 19:09:58,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:09:58,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142412534] [2024-06-20 19:09:58,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:09:58,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:09:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:15,016 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-20 19:10:15,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:15,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142412534] [2024-06-20 19:10:15,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142412534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:15,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:15,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:10:15,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080878318] [2024-06-20 19:10:15,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:15,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:10:15,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:15,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:10:15,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:10:15,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:10:15,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 155 transitions, 1231 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-20 19:10:15,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:15,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:10:15,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:17,143 INFO L124 PetriNetUnfolderBase]: 2229/3486 cut-off events. [2024-06-20 19:10:17,143 INFO L125 PetriNetUnfolderBase]: For 212985/212987 co-relation queries the response was YES. [2024-06-20 19:10:17,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25478 conditions, 3486 events. 2229/3486 cut-off events. For 212985/212987 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18248 event pairs, 462 based on Foata normal form. 6/3492 useless extension candidates. Maximal degree in co-relation 25417. Up to 2996 conditions per place. [2024-06-20 19:10:17,169 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 138 selfloop transitions, 45 changer transitions 0/190 dead transitions. [2024-06-20 19:10:17,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 190 transitions, 1851 flow [2024-06-20 19:10:17,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:10:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:10:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 173 transitions. [2024-06-20 19:10:17,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4914772727272727 [2024-06-20 19:10:17,172 INFO L175 Difference]: Start difference. First operand has 134 places, 155 transitions, 1231 flow. Second operand 8 states and 173 transitions. [2024-06-20 19:10:17,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 190 transitions, 1851 flow [2024-06-20 19:10:17,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 190 transitions, 1764 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-20 19:10:17,264 INFO L231 Difference]: Finished difference. Result has 137 places, 157 transitions, 1273 flow [2024-06-20 19:10:17,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1273, PETRI_PLACES=137, PETRI_TRANSITIONS=157} [2024-06-20 19:10:17,264 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 92 predicate places. [2024-06-20 19:10:17,264 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 157 transitions, 1273 flow [2024-06-20 19:10:17,265 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-20 19:10:17,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:17,265 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:17,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-20 19:10:17,265 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:10:17,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash -852612367, now seen corresponding path program 5 times [2024-06-20 19:10:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:17,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287056941] [2024-06-20 19:10:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:17,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:34,775 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-20 19:10:34,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:34,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287056941] [2024-06-20 19:10:34,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287056941] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:34,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:34,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:10:34,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695697268] [2024-06-20 19:10:34,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:34,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:10:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:10:34,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:10:34,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:10:34,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 157 transitions, 1273 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-20 19:10:34,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:34,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:10:34,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:36,802 INFO L124 PetriNetUnfolderBase]: 2246/3513 cut-off events. [2024-06-20 19:10:36,802 INFO L125 PetriNetUnfolderBase]: For 224084/224086 co-relation queries the response was YES. [2024-06-20 19:10:36,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25977 conditions, 3513 events. 2246/3513 cut-off events. For 224084/224086 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 18410 event pairs, 634 based on Foata normal form. 6/3519 useless extension candidates. Maximal degree in co-relation 25915. Up to 3110 conditions per place. [2024-06-20 19:10:36,831 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 141 selfloop transitions, 38 changer transitions 0/186 dead transitions. [2024-06-20 19:10:36,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 186 transitions, 1735 flow [2024-06-20 19:10:36,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:10:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:10:36,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 165 transitions. [2024-06-20 19:10:36,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46875 [2024-06-20 19:10:36,835 INFO L175 Difference]: Start difference. First operand has 137 places, 157 transitions, 1273 flow. Second operand 8 states and 165 transitions. [2024-06-20 19:10:36,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 186 transitions, 1735 flow [2024-06-20 19:10:36,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 186 transitions, 1612 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-20 19:10:36,964 INFO L231 Difference]: Finished difference. Result has 139 places, 159 transitions, 1273 flow [2024-06-20 19:10:36,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1273, PETRI_PLACES=139, PETRI_TRANSITIONS=159} [2024-06-20 19:10:36,964 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 94 predicate places. [2024-06-20 19:10:36,964 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 159 transitions, 1273 flow [2024-06-20 19:10:36,965 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-20 19:10:36,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:36,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:36,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-20 19:10:36,965 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:10:36,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash -857974747, now seen corresponding path program 6 times [2024-06-20 19:10:36,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:36,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667858097] [2024-06-20 19:10:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:10:54,385 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-20 19:10:54,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:10:54,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667858097] [2024-06-20 19:10:54,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667858097] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:10:54,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:10:54,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:10:54,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658825226] [2024-06-20 19:10:54,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:10:54,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:10:54,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:10:54,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:10:54,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:10:54,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:10:54,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 159 transitions, 1273 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-20 19:10:54,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:10:54,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:10:54,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:10:56,430 INFO L124 PetriNetUnfolderBase]: 2263/3540 cut-off events. [2024-06-20 19:10:56,430 INFO L125 PetriNetUnfolderBase]: For 234864/234866 co-relation queries the response was YES. [2024-06-20 19:10:56,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26295 conditions, 3540 events. 2263/3540 cut-off events. For 234864/234866 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 18577 event pairs, 634 based on Foata normal form. 6/3546 useless extension candidates. Maximal degree in co-relation 26232. Up to 3137 conditions per place. [2024-06-20 19:10:56,458 INFO L140 encePairwiseOnDemand]: 33/44 looper letters, 143 selfloop transitions, 41 changer transitions 0/191 dead transitions. [2024-06-20 19:10:56,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 191 transitions, 1753 flow [2024-06-20 19:10:56,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:10:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:10:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 169 transitions. [2024-06-20 19:10:56,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48011363636363635 [2024-06-20 19:10:56,462 INFO L175 Difference]: Start difference. First operand has 139 places, 159 transitions, 1273 flow. Second operand 8 states and 169 transitions. [2024-06-20 19:10:56,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 191 transitions, 1753 flow [2024-06-20 19:10:56,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 191 transitions, 1656 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-06-20 19:10:56,581 INFO L231 Difference]: Finished difference. Result has 141 places, 161 transitions, 1305 flow [2024-06-20 19:10:56,581 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1305, PETRI_PLACES=141, PETRI_TRANSITIONS=161} [2024-06-20 19:10:56,581 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 96 predicate places. [2024-06-20 19:10:56,581 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 161 transitions, 1305 flow [2024-06-20 19:10:56,582 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-20 19:10:56,582 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:10:56,582 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:10:56,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-20 19:10:56,582 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:10:56,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:10:56,583 INFO L85 PathProgramCache]: Analyzing trace with hash 593359010, now seen corresponding path program 2 times [2024-06-20 19:10:56,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:10:56,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046170433] [2024-06-20 19:10:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:10:56,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:10:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:12,492 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-20 19:11:12,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:12,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046170433] [2024-06-20 19:11:12,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046170433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:12,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:12,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:11:12,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264432499] [2024-06-20 19:11:12,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:12,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:11:12,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:12,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:11:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:11:12,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:11:12,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 161 transitions, 1305 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-20 19:11:12,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:12,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:11:12,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:14,243 INFO L124 PetriNetUnfolderBase]: 2161/3455 cut-off events. [2024-06-20 19:11:14,244 INFO L125 PetriNetUnfolderBase]: For 245980/245982 co-relation queries the response was YES. [2024-06-20 19:11:14,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26223 conditions, 3455 events. 2161/3455 cut-off events. For 245980/245982 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18754 event pairs, 624 based on Foata normal form. 4/3459 useless extension candidates. Maximal degree in co-relation 26159. Up to 2985 conditions per place. [2024-06-20 19:11:14,276 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 135 selfloop transitions, 29 changer transitions 0/186 dead transitions. [2024-06-20 19:11:14,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 186 transitions, 1871 flow [2024-06-20 19:11:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:11:14,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:11:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2024-06-20 19:11:14,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4772727272727273 [2024-06-20 19:11:14,277 INFO L175 Difference]: Start difference. First operand has 141 places, 161 transitions, 1305 flow. Second operand 7 states and 147 transitions. [2024-06-20 19:11:14,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 186 transitions, 1871 flow [2024-06-20 19:11:14,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 186 transitions, 1764 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-20 19:11:14,412 INFO L231 Difference]: Finished difference. Result has 143 places, 169 transitions, 1400 flow [2024-06-20 19:11:14,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1400, PETRI_PLACES=143, PETRI_TRANSITIONS=169} [2024-06-20 19:11:14,412 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 98 predicate places. [2024-06-20 19:11:14,412 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 169 transitions, 1400 flow [2024-06-20 19:11:14,413 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-20 19:11:14,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:14,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:14,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-20 19:11:14,413 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:11:14,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash 2043292110, now seen corresponding path program 1 times [2024-06-20 19:11:14,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:14,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927882871] [2024-06-20 19:11:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:14,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 19:11:31,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:31,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927882871] [2024-06-20 19:11:31,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927882871] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:31,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:31,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:11:31,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737637657] [2024-06-20 19:11:31,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:31,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:11:31,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:31,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:11:31,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:11:31,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:11:31,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 169 transitions, 1400 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:31,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:31,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:11:31,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:33,002 INFO L124 PetriNetUnfolderBase]: 2299/3594 cut-off events. [2024-06-20 19:11:33,002 INFO L125 PetriNetUnfolderBase]: For 258269/258269 co-relation queries the response was YES. [2024-06-20 19:11:33,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27695 conditions, 3594 events. 2299/3594 cut-off events. For 258269/258269 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 18972 event pairs, 669 based on Foata normal form. 1/3595 useless extension candidates. Maximal degree in co-relation 27629. Up to 3320 conditions per place. [2024-06-20 19:11:33,032 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 154 selfloop transitions, 14 changer transitions 0/188 dead transitions. [2024-06-20 19:11:33,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 188 transitions, 1820 flow [2024-06-20 19:11:33,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:11:33,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:11:33,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-20 19:11:33,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43506493506493504 [2024-06-20 19:11:33,033 INFO L175 Difference]: Start difference. First operand has 143 places, 169 transitions, 1400 flow. Second operand 7 states and 134 transitions. [2024-06-20 19:11:33,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 188 transitions, 1820 flow [2024-06-20 19:11:33,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 188 transitions, 1737 flow, removed 32 selfloop flow, removed 3 redundant places. [2024-06-20 19:11:33,161 INFO L231 Difference]: Finished difference. Result has 147 places, 172 transitions, 1401 flow [2024-06-20 19:11:33,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1401, PETRI_PLACES=147, PETRI_TRANSITIONS=172} [2024-06-20 19:11:33,161 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 102 predicate places. [2024-06-20 19:11:33,161 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 172 transitions, 1401 flow [2024-06-20 19:11:33,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:11:33,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:33,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:33,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-20 19:11:33,162 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:11:33,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:33,162 INFO L85 PathProgramCache]: Analyzing trace with hash -626923359, now seen corresponding path program 7 times [2024-06-20 19:11:33,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055149694] [2024-06-20 19:11:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:33,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:11:49,488 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-20 19:11:49,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:11:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055149694] [2024-06-20 19:11:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055149694] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:11:49,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:11:49,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-20 19:11:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064922884] [2024-06-20 19:11:49,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:11:49,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-20 19:11:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:11:49,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-20 19:11:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-20 19:11:49,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:11:49,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 172 transitions, 1401 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-20 19:11:49,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:11:49,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:11:49,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:11:51,629 INFO L124 PetriNetUnfolderBase]: 2304/3598 cut-off events. [2024-06-20 19:11:51,630 INFO L125 PetriNetUnfolderBase]: For 269676/269678 co-relation queries the response was YES. [2024-06-20 19:11:51,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28133 conditions, 3598 events. 2304/3598 cut-off events. For 269676/269678 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 18907 event pairs, 658 based on Foata normal form. 6/3603 useless extension candidates. Maximal degree in co-relation 28065. Up to 3185 conditions per place. [2024-06-20 19:11:51,660 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 152 selfloop transitions, 36 changer transitions 0/196 dead transitions. [2024-06-20 19:11:51,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 196 transitions, 1837 flow [2024-06-20 19:11:51,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 19:11:51,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 19:11:51,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 161 transitions. [2024-06-20 19:11:51,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45738636363636365 [2024-06-20 19:11:51,664 INFO L175 Difference]: Start difference. First operand has 147 places, 172 transitions, 1401 flow. Second operand 8 states and 161 transitions. [2024-06-20 19:11:51,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 196 transitions, 1837 flow [2024-06-20 19:11:51,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 196 transitions, 1755 flow, removed 29 selfloop flow, removed 5 redundant places. [2024-06-20 19:11:51,791 INFO L231 Difference]: Finished difference. Result has 150 places, 172 transitions, 1398 flow [2024-06-20 19:11:51,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1319, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1398, PETRI_PLACES=150, PETRI_TRANSITIONS=172} [2024-06-20 19:11:51,792 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 105 predicate places. [2024-06-20 19:11:51,792 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 172 transitions, 1398 flow [2024-06-20 19:11:51,792 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-20 19:11:51,792 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:11:51,793 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:11:51,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-20 19:11:51,793 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:11:51,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:11:51,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1882400210, now seen corresponding path program 3 times [2024-06-20 19:11:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:11:51,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577852722] [2024-06-20 19:11:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:11:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:11:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:08,035 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-20 19:12:08,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:08,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577852722] [2024-06-20 19:12:08,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577852722] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:08,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:08,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:12:08,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389034658] [2024-06-20 19:12:08,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:08,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:12:08,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:08,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:12:08,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:12:08,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:12:08,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 172 transitions, 1398 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-20 19:12:08,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:08,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:12:08,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:09,729 INFO L124 PetriNetUnfolderBase]: 2178/3475 cut-off events. [2024-06-20 19:12:09,730 INFO L125 PetriNetUnfolderBase]: For 278249/278251 co-relation queries the response was YES. [2024-06-20 19:12:09,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27787 conditions, 3475 events. 2178/3475 cut-off events. For 278249/278251 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 18820 event pairs, 650 based on Foata normal form. 4/3478 useless extension candidates. Maximal degree in co-relation 27718. Up to 2973 conditions per place. [2024-06-20 19:12:09,764 INFO L140 encePairwiseOnDemand]: 34/44 looper letters, 127 selfloop transitions, 42 changer transitions 0/192 dead transitions. [2024-06-20 19:12:09,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 192 transitions, 2076 flow [2024-06-20 19:12:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:12:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:12:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 145 transitions. [2024-06-20 19:12:09,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707792207792208 [2024-06-20 19:12:09,766 INFO L175 Difference]: Start difference. First operand has 150 places, 172 transitions, 1398 flow. Second operand 7 states and 145 transitions. [2024-06-20 19:12:09,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 192 transitions, 2076 flow [2024-06-20 19:12:09,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 192 transitions, 1982 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-20 19:12:09,932 INFO L231 Difference]: Finished difference. Result has 151 places, 180 transitions, 1548 flow [2024-06-20 19:12:09,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1548, PETRI_PLACES=151, PETRI_TRANSITIONS=180} [2024-06-20 19:12:09,933 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 106 predicate places. [2024-06-20 19:12:09,933 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 180 transitions, 1548 flow [2024-06-20 19:12:09,933 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-20 19:12:09,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:09,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:09,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-20 19:12:09,934 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:12:09,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:09,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1830749290, now seen corresponding path program 2 times [2024-06-20 19:12:09,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:09,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195239557] [2024-06-20 19:12:09,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:09,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:27,024 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-20 19:12:27,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:27,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195239557] [2024-06-20 19:12:27,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195239557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:27,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:27,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:12:27,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6462857] [2024-06-20 19:12:27,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:27,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:12:27,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:27,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:12:27,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:12:27,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:12:27,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 180 transitions, 1548 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:27,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:27,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:12:27,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:28,730 INFO L124 PetriNetUnfolderBase]: 2300/3598 cut-off events. [2024-06-20 19:12:28,730 INFO L125 PetriNetUnfolderBase]: For 291529/291535 co-relation queries the response was YES. [2024-06-20 19:12:28,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29194 conditions, 3598 events. 2300/3598 cut-off events. For 291529/291535 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 19023 event pairs, 673 based on Foata normal form. 7/3605 useless extension candidates. Maximal degree in co-relation 29123. Up to 3309 conditions per place. [2024-06-20 19:12:28,763 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 151 selfloop transitions, 26 changer transitions 0/197 dead transitions. [2024-06-20 19:12:28,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 197 transitions, 2128 flow [2024-06-20 19:12:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:12:28,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:12:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-20 19:12:28,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2024-06-20 19:12:28,765 INFO L175 Difference]: Start difference. First operand has 151 places, 180 transitions, 1548 flow. Second operand 7 states and 133 transitions. [2024-06-20 19:12:28,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 197 transitions, 2128 flow [2024-06-20 19:12:28,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 197 transitions, 1982 flow, removed 44 selfloop flow, removed 4 redundant places. [2024-06-20 19:12:28,917 INFO L231 Difference]: Finished difference. Result has 154 places, 186 transitions, 1574 flow [2024-06-20 19:12:28,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1402, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1574, PETRI_PLACES=154, PETRI_TRANSITIONS=186} [2024-06-20 19:12:28,918 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 109 predicate places. [2024-06-20 19:12:28,918 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 186 transitions, 1574 flow [2024-06-20 19:12:28,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:28,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:28,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:28,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-20 19:12:28,919 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:12:28,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:28,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1007141554, now seen corresponding path program 3 times [2024-06-20 19:12:28,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:28,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048978528] [2024-06-20 19:12:28,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:28,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:12:45,625 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-20 19:12:45,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:12:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048978528] [2024-06-20 19:12:45,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048978528] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:12:45,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:12:45,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:12:45,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068712369] [2024-06-20 19:12:45,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:12:45,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:12:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:12:45,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:12:45,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:12:45,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 44 [2024-06-20 19:12:45,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 186 transitions, 1574 flow. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:45,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:12:45,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 44 [2024-06-20 19:12:45,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:12:47,235 INFO L124 PetriNetUnfolderBase]: 2297/3594 cut-off events. [2024-06-20 19:12:47,236 INFO L125 PetriNetUnfolderBase]: For 302023/302029 co-relation queries the response was YES. [2024-06-20 19:12:47,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29181 conditions, 3594 events. 2297/3594 cut-off events. For 302023/302029 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18996 event pairs, 673 based on Foata normal form. 7/3601 useless extension candidates. Maximal degree in co-relation 29109. Up to 3306 conditions per place. [2024-06-20 19:12:47,269 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 149 selfloop transitions, 27 changer transitions 0/196 dead transitions. [2024-06-20 19:12:47,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 196 transitions, 1950 flow [2024-06-20 19:12:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:12:47,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:12:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-20 19:12:47,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253246753246753 [2024-06-20 19:12:47,270 INFO L175 Difference]: Start difference. First operand has 154 places, 186 transitions, 1574 flow. Second operand 7 states and 131 transitions. [2024-06-20 19:12:47,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 196 transitions, 1950 flow [2024-06-20 19:12:47,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 196 transitions, 1840 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-20 19:12:47,466 INFO L231 Difference]: Finished difference. Result has 158 places, 186 transitions, 1524 flow [2024-06-20 19:12:47,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1524, PETRI_PLACES=158, PETRI_TRANSITIONS=186} [2024-06-20 19:12:47,467 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 113 predicate places. [2024-06-20 19:12:47,467 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 186 transitions, 1524 flow [2024-06-20 19:12:47,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 8 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 19:12:47,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:12:47,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:12:47,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-20 19:12:47,467 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:12:47,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:12:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1501777210, now seen corresponding path program 1 times [2024-06-20 19:12:47,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:12:47,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906274276] [2024-06-20 19:12:47,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:12:47,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:12:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 19:13:03,487 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-20 19:13:03,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 19:13:03,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906274276] [2024-06-20 19:13:03,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906274276] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 19:13:03,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 19:13:03,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 19:13:03,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358902687] [2024-06-20 19:13:03,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 19:13:03,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 19:13:03,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 19:13:03,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 19:13:03,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-20 19:13:03,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-06-20 19:13:03,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 186 transitions, 1524 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-20 19:13:03,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 19:13:03,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-06-20 19:13:03,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 19:13:05,172 INFO L124 PetriNetUnfolderBase]: 2074/3349 cut-off events. [2024-06-20 19:13:05,172 INFO L125 PetriNetUnfolderBase]: For 270713/270713 co-relation queries the response was YES. [2024-06-20 19:13:05,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26466 conditions, 3349 events. 2074/3349 cut-off events. For 270713/270713 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18143 event pairs, 534 based on Foata normal form. 1/3350 useless extension candidates. Maximal degree in co-relation 26392. Up to 3009 conditions per place. [2024-06-20 19:13:05,204 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 180 selfloop transitions, 14 changer transitions 0/205 dead transitions. [2024-06-20 19:13:05,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 205 transitions, 1998 flow [2024-06-20 19:13:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-20 19:13:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-20 19:13:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 140 transitions. [2024-06-20 19:13:05,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-20 19:13:05,206 INFO L175 Difference]: Start difference. First operand has 158 places, 186 transitions, 1524 flow. Second operand 7 states and 140 transitions. [2024-06-20 19:13:05,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 205 transitions, 1998 flow [2024-06-20 19:13:05,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 205 transitions, 1934 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-20 19:13:05,530 INFO L231 Difference]: Finished difference. Result has 159 places, 189 transitions, 1546 flow [2024-06-20 19:13:05,531 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1546, PETRI_PLACES=159, PETRI_TRANSITIONS=189} [2024-06-20 19:13:05,531 INFO L281 CegarLoopForPetriNet]: 45 programPoint places, 114 predicate places. [2024-06-20 19:13:05,531 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 189 transitions, 1546 flow [2024-06-20 19:13:05,532 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-20 19:13:05,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 19:13:05,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 19:13:05,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-20 19:13:05,532 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 19:13:05,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 19:13:05,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2079721534, now seen corresponding path program 1 times [2024-06-20 19:13:05,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 19:13:05,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955256942] [2024-06-20 19:13:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 19:13:05,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 19:13:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15