./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.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-bcb38a6-m [2024-06-04 17:58:06,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-04 17:58:06,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-04 17:58:06,654 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-04 17:58:06,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-04 17:58:06,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-04 17:58:06,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-04 17:58:06,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-04 17:58:06,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-04 17:58:06,682 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-04 17:58:06,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-04 17:58:06,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-04 17:58:06,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-04 17:58:06,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-04 17:58:06,684 INFO L153 SettingsManager]: * Use SBE=true [2024-06-04 17:58:06,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-04 17:58:06,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-04 17:58:06,685 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-04 17:58:06,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-04 17:58:06,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-04 17:58:06,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-04 17:58:06,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-04 17:58:06,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-04 17:58:06,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-04 17:58:06,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-04 17:58:06,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-04 17:58:06,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-04 17:58:06,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-04 17:58:06,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-04 17:58:06,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-04 17:58:06,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-04 17:58:06,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-04 17:58:06,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:58:06,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-04 17:58:06,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-04 17:58:06,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-04 17:58:06,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-04 17:58:06,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-04 17:58:06,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-04 17:58:06,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-04 17:58:06,692 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-04 17:58:06,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-04 17:58:06,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-04 17:58:06,692 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-04 17:58:06,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-04 17:58:06,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-04 17:58:06,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-04 17:58:06,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-04 17:58:06,912 INFO L274 PluginConnector]: CDTParser initialized [2024-06-04 17:58:06,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-06-04 17:58:08,134 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-04 17:58:08,358 INFO L384 CDTParser]: Found 1 translation units. [2024-06-04 17:58:08,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-06-04 17:58:08,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2eae2228/a10ef86757cd4660a8f341f92689a4ca/FLAG891ea49c6 [2024-06-04 17:58:08,389 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2eae2228/a10ef86757cd4660a8f341f92689a4ca [2024-06-04 17:58:08,391 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-04 17:58:08,391 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-04 17:58:08,393 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/safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-04 17:58:08,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-04 17:58:08,537 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-04 17:58:08,538 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-04 17:58:08,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-04 17:58:08,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-04 17:58:08,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:58:08" (1/2) ... [2024-06-04 17:58:08,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d50eebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:58:08, skipping insertion in model container [2024-06-04 17:58:08,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.06 05:58:08" (1/2) ... [2024-06-04 17:58:08,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3e260559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.06 05:58:08, skipping insertion in model container [2024-06-04 17:58:08,544 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:58:08" (2/2) ... [2024-06-04 17:58:08,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d50eebc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:08, skipping insertion in model container [2024-06-04 17:58:08,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:58:08" (2/2) ... [2024-06-04 17:58:08,545 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-04 17:58:08,604 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-04 17:58:08,605 INFO L97 edCorrectnessWitness]: Location invariant before [L821-L821] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_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_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 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_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_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_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_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_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 )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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 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_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_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_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_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_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 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_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_p2_EAX - (long long )z$r_buff0_thd0 >= 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_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 )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_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_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_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_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_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_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2))) [2024-06-04 17:58:08,606 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_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_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 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_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_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_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_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_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 )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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 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_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_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_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_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_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 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_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_p2_EAX - (long long )z$r_buff0_thd0 >= 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_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 )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_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_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_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_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_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_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2))) [2024-06-04 17:58:08,607 INFO L97 edCorrectnessWitness]: Location invariant before [L824-L824] (((((((((((((((((! multithreaded || ((0 <= __unbuffered_p2_EAX && __unbuffered_p2_EAX <= 1) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || z$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || z$read_delayed_var == 0)) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((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_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_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_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd0) + (long long )z$r_buff1_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_thd2) + (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$r_buff1_thd3) + (long long )z$w_buff1 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff0 >= 0LL) && (0LL - (long long )z$read_delayed) + (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$w_buff0) + (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 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_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_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_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_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_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 )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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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_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) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$flush_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$mem_tmp) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )z$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )z$w_buff1 >= 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_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_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_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd0 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd2 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff0_thd3) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd0) - (long long )z$r_buff1_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_thd2) - (long long )z$r_buff1_thd3 >= 0LL) && (0LL - (long long )z$r_buff1_thd2) - (long long )z$read_delayed >= 0LL) && (0LL - (long long )z$r_buff1_thd3) - (long long )z$read_delayed >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff0_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd0) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd2) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$r_buff1_thd3) - (long long )z$w_buff1 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff0 >= 0LL) && (2LL - (long long )z$read_delayed) - (long long )z$w_buff1 >= 0LL) && (4LL - (long long )z$w_buff0) - (long long )z$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )z$r_buff0_thd0 >= 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_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_p2_EAX - (long long )z$r_buff0_thd0 >= 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_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 )main$tmp_guard1 - (long long )z$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )z$read_delayed >= 0LL) && (long long )x - (long long )z$r_buff0_thd0 >= 0LL) && (long long )x - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )x - (long long )z$r_buff1_thd3 >= 0LL) && (long long )x - (long long )z$read_delayed >= 0LL) && (long long )y - (long long )z$r_buff0_thd0 >= 0LL) && (long long )y - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )y - (long long )z$r_buff1_thd3 >= 0LL) && (long long )y - (long long )z$read_delayed >= 0LL) && (long long )z - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )z - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z - (long long )z$read_delayed >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )z$flush_delayed - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$flush_delayed - (long long )z$read_delayed >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_thd0 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )z$mem_tmp - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$mem_tmp - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd0 - (long long )z$r_buff0_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_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_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_thd2 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd0 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd2 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff0_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd0 - (long long )z$r_buff1_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_thd2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )z$r_buff1_thd2 - (long long )z$read_delayed >= 0LL) && (long long )z$r_buff1_thd3 - (long long )z$read_delayed >= 0LL) && (long long )z$w_buff0 - (long long )z$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff0_thd0 >= 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_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )z$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff0_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_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )z$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )z$read_delayed >= 0LL))) && (! multithreaded || z$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((0 <= z$mem_tmp && z$mem_tmp <= 127) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || (((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= z) && 0 <= z$mem_tmp) && 0 <= z$w_buff0) && 0 <= z$w_buff1) && __unbuffered_p2_EAX <= 1) && y <= 1) && z <= 127) && z$mem_tmp <= 127) && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$flush_delayed == (_Bool)0) && z$r_buff0_thd0 == (_Bool)0) && z$r_buff0_thd2 == (_Bool)0) && z$r_buff0_thd3 == (_Bool)0) && z$r_buff1_thd0 == (_Bool)0) && z$r_buff1_thd2 == (_Bool)0) && z$r_buff1_thd3 == (_Bool)0) && z$read_delayed == (_Bool)0) && z$read_delayed_var == 0) && z$w_buff0 % 2 == 0) && z$w_buff1 % 2 == 0) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (y == 0 || y == 1)) && (z$w_buff0 == 0 || z$w_buff0 == 2)) && (z$w_buff1 == 0 || z$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((z == 0 || z == 1) || z == 2)) && ((z$mem_tmp == 0 || z$mem_tmp == 1) || z$mem_tmp == 2)))) && (! multithreaded || z$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= z$w_buff1 && z$w_buff1 <= 2) && z$w_buff1 <= 127) && z$w_buff1 % 2 == 0) && (z$w_buff1 == 0 || z$w_buff1 == 2)))) && (! multithreaded || z$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || z$r_buff1_thd3 == (_Bool)0)) && (! multithreaded || z$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || z$read_delayed == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= z && z <= 127) && ((z == 0 || z == 1) || z == 2)))) && (! multithreaded || ((((0 <= z$w_buff0 && z$w_buff0 <= 2) && z$w_buff0 <= 127) && z$w_buff0 % 2 == 0) && (z$w_buff0 == 0 || z$w_buff0 == 2))) [2024-06-04 17:58:08,607 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-04 17:58:08,607 INFO L106 edCorrectnessWitness]: ghost_update [L819-L819] multithreaded = 1; [2024-06-04 17:58:08,633 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-04 17:58:08,943 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:58:08,953 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-04 17:58:09,284 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-04 17:58:09,319 INFO L206 MainTranslator]: Completed translation [2024-06-04 17:58:09,321 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09 WrapperNode [2024-06-04 17:58:09,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-04 17:58:09,322 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-04 17:58:09,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-04 17:58:09,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-04 17:58:09,328 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 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,376 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 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,471 INFO L138 Inliner]: procedures = 175, calls = 43, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2024-06-04 17:58:09,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-04 17:58:09,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-04 17:58:09,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-04 17:58:09,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-04 17:58:09,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,539 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-04 17:58:09,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,571 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-04 17:58:09,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-04 17:58:09,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-04 17:58:09,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-04 17:58:09,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (1/1) ... [2024-06-04 17:58:09,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-04 17:58:09,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-04 17:58:09,649 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-04 17:58:09,664 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-04 17:58:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-04 17:58:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-04 17:58:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-04 17:58:09,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-04 17:58:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-04 17:58:09,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-04 17:58:09,695 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-04 17:58:09,696 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-04 17:58:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-04 17:58:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-04 17:58:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-04 17:58:09,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-04 17:58:09,698 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-04 17:58:09,884 INFO L244 CfgBuilder]: Building ICFG [2024-06-04 17:58:09,886 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-04 17:58:10,814 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-04 17:58:10,816 INFO L293 CfgBuilder]: Performing block encoding [2024-06-04 17:58:11,062 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-04 17:58:11,062 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-04 17:58:11,063 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:58:11 BoogieIcfgContainer [2024-06-04 17:58:11,063 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-04 17:58:11,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-04 17:58:11,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-04 17:58:11,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-04 17:58:11,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.06 05:58:08" (1/4) ... [2024-06-04 17:58:11,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440da60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.06 05:58:11, skipping insertion in model container [2024-06-04 17:58:11,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 04.06 05:58:08" (2/4) ... [2024-06-04 17:58:11,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440da60c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:58:11, skipping insertion in model container [2024-06-04 17:58:11,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 04.06 05:58:09" (3/4) ... [2024-06-04 17:58:11,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@440da60c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 04.06 05:58:11, skipping insertion in model container [2024-06-04 17:58:11,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.06 05:58:11" (4/4) ... [2024-06-04 17:58:11,071 INFO L112 eAbstractionObserver]: Analyzing ICFG safe011_power.oepc_pso.oepc_rmo.oepc_rmo.opt.i [2024-06-04 17:58:11,083 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-04 17:58:11,084 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-04 17:58:11,084 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-04 17:58:11,171 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-04 17:58:11,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 17:58:11,242 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2024-06-04 17:58:11,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:58:11,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 38 events. 0/38 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-04 17:58:11,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 41 transitions, 94 flow [2024-06-04 17:58:11,247 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2024-06-04 17:58:11,258 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-04 17:58:11,264 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;@64c0d239, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-04 17:58:11,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-04 17:58:11,270 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-04 17:58:11,270 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-04 17:58:11,270 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-04 17:58:11,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:11,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-04 17:58:11,271 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-04 17:58:11,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1456369184, now seen corresponding path program 1 times [2024-06-04 17:58:11,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:11,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749755628] [2024-06-04 17:58:11,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:11,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:15,460 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-04 17:58:15,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:15,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749755628] [2024-06-04 17:58:15,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749755628] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:15,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:15,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-04 17:58:15,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605304391] [2024-06-04 17:58:15,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:15,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-04 17:58:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:15,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-04 17:58:15,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-04 17:58:15,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:58:15,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04 17:58:15,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:15,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:58:15,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:16,254 INFO L124 PetriNetUnfolderBase]: 1407/2119 cut-off events. [2024-06-04 17:58:16,254 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-04 17:58:16,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4325 conditions, 2119 events. 1407/2119 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9680 event pairs, 989 based on Foata normal form. 1/2076 useless extension candidates. Maximal degree in co-relation 4310. Up to 2105 conditions per place. [2024-06-04 17:58:16,268 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 34 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-04 17:58:16,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 175 flow [2024-06-04 17:58:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-04 17:58:16,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-04 17:58:16,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-06-04 17:58:16,278 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5528455284552846 [2024-06-04 17:58:16,279 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 68 transitions. [2024-06-04 17:58:16,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 175 flow [2024-06-04 17:58:16,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-04 17:58:16,283 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 100 flow [2024-06-04 17:58:16,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-04 17:58:16,287 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-04 17:58:16,287 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 100 flow [2024-06-04 17:58:16,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-04 17:58:16,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:16,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:16,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-04 17:58:16,288 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-04 17:58:16,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 588573823, now seen corresponding path program 1 times [2024-06-04 17:58:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:16,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725083081] [2024-06-04 17:58:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:19,480 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-04 17:58:19,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:19,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725083081] [2024-06-04 17:58:19,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725083081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:19,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:19,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-04 17:58:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182619544] [2024-06-04 17:58:19,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:19,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-04 17:58:19,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:19,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-04 17:58:19,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-04 17:58:19,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:58:19,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 100 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-04 17:58:19,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:19,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:58:19,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:20,163 INFO L124 PetriNetUnfolderBase]: 1401/2110 cut-off events. [2024-06-04 17:58:20,163 INFO L125 PetriNetUnfolderBase]: For 403/411 co-relation queries the response was YES. [2024-06-04 17:58:20,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 2110 events. 1401/2110 cut-off events. For 403/411 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9515 event pairs, 864 based on Foata normal form. 6/2113 useless extension candidates. Maximal degree in co-relation 4854. Up to 2081 conditions per place. [2024-06-04 17:58:20,174 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 41 selfloop transitions, 7 changer transitions 0/52 dead transitions. [2024-06-04 17:58:20,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 242 flow [2024-06-04 17:58:20,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-04 17:58:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-04 17:58:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-06-04 17:58:20,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5304878048780488 [2024-06-04 17:58:20,177 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 100 flow. Second operand 4 states and 87 transitions. [2024-06-04 17:58:20,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 242 flow [2024-06-04 17:58:20,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-04 17:58:20,181 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 136 flow [2024-06-04 17:58:20,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-04 17:58:20,183 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2024-06-04 17:58:20,183 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 136 flow [2024-06-04 17:58:20,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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-04 17:58:20,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:20,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:20,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-04 17:58:20,186 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-04 17:58:20,187 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:20,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1065920051, now seen corresponding path program 1 times [2024-06-04 17:58:20,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:20,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400382346] [2024-06-04 17:58:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:20,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:23,119 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-04 17:58:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:23,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400382346] [2024-06-04 17:58:23,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400382346] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:23,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:23,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-04 17:58:23,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307123351] [2024-06-04 17:58:23,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:23,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-04 17:58:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-04 17:58:23,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-04 17:58:23,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:58:23,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-04 17:58:23,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:23,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:58:23,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:23,972 INFO L124 PetriNetUnfolderBase]: 1409/2124 cut-off events. [2024-06-04 17:58:23,972 INFO L125 PetriNetUnfolderBase]: For 1116/1122 co-relation queries the response was YES. [2024-06-04 17:58:23,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5448 conditions, 2124 events. 1409/2124 cut-off events. For 1116/1122 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9556 event pairs, 673 based on Foata normal form. 9/2127 useless extension candidates. Maximal degree in co-relation 5431. Up to 2027 conditions per place. [2024-06-04 17:58:23,984 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 54 selfloop transitions, 16 changer transitions 0/74 dead transitions. [2024-06-04 17:58:23,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 74 transitions, 396 flow [2024-06-04 17:58:23,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:58:23,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:58:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-06-04 17:58:23,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5560975609756098 [2024-06-04 17:58:23,986 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 136 flow. Second operand 5 states and 114 transitions. [2024-06-04 17:58:23,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 74 transitions, 396 flow [2024-06-04 17:58:23,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 382 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-04 17:58:23,990 INFO L231 Difference]: Finished difference. Result has 50 places, 49 transitions, 235 flow [2024-06-04 17:58:23,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=235, PETRI_PLACES=50, PETRI_TRANSITIONS=49} [2024-06-04 17:58:23,992 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2024-06-04 17:58:23,992 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 49 transitions, 235 flow [2024-06-04 17:58:23,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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-04 17:58:23,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:23,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:23,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-04 17:58:23,993 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-04 17:58:23,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:23,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1316216034, now seen corresponding path program 1 times [2024-06-04 17:58:23,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:23,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600506733] [2024-06-04 17:58:23,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:23,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:27,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 17:58:27,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:27,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600506733] [2024-06-04 17:58:27,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600506733] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:58:27,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176999387] [2024-06-04 17:58:27,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:27,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:58:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:27,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:58:27,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:58:27,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:58:27,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 49 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-04 17:58:27,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:27,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:58:27,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:27,963 INFO L124 PetriNetUnfolderBase]: 1461/2198 cut-off events. [2024-06-04 17:58:27,964 INFO L125 PetriNetUnfolderBase]: For 2704/2723 co-relation queries the response was YES. [2024-06-04 17:58:27,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6607 conditions, 2198 events. 1461/2198 cut-off events. For 2704/2723 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9922 event pairs, 550 based on Foata normal form. 17/2209 useless extension candidates. Maximal degree in co-relation 6587. Up to 1944 conditions per place. [2024-06-04 17:58:27,974 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 73 selfloop transitions, 27 changer transitions 0/104 dead transitions. [2024-06-04 17:58:27,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 104 transitions, 641 flow [2024-06-04 17:58:27,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:58:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:58:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 143 transitions. [2024-06-04 17:58:27,975 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813008130081301 [2024-06-04 17:58:27,976 INFO L175 Difference]: Start difference. First operand has 50 places, 49 transitions, 235 flow. Second operand 6 states and 143 transitions. [2024-06-04 17:58:27,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 104 transitions, 641 flow [2024-06-04 17:58:27,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 104 transitions, 633 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-06-04 17:58:27,980 INFO L231 Difference]: Finished difference. Result has 59 places, 65 transitions, 412 flow [2024-06-04 17:58:27,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=412, PETRI_PLACES=59, PETRI_TRANSITIONS=65} [2024-06-04 17:58:27,981 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2024-06-04 17:58:27,981 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 65 transitions, 412 flow [2024-06-04 17:58:27,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 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-04 17:58:27,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:27,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:27,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-04 17:58:27,982 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:58:27,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:27,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2146976690, now seen corresponding path program 1 times [2024-06-04 17:58:27,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:27,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466974715] [2024-06-04 17:58:27,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:27,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:31,095 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-04 17:58:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466974715] [2024-06-04 17:58:31,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466974715] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:31,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:31,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:58:31,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133052465] [2024-06-04 17:58:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:31,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:58:31,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:31,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:58:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:58:31,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 41 [2024-06-04 17:58:31,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 65 transitions, 412 flow. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-04 17:58:31,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:31,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 41 [2024-06-04 17:58:31,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:32,139 INFO L124 PetriNetUnfolderBase]: 1571/2376 cut-off events. [2024-06-04 17:58:32,139 INFO L125 PetriNetUnfolderBase]: For 6084/6103 co-relation queries the response was YES. [2024-06-04 17:58:32,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8662 conditions, 2376 events. 1571/2376 cut-off events. For 6084/6103 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10997 event pairs, 422 based on Foata normal form. 38/2408 useless extension candidates. Maximal degree in co-relation 8636. Up to 1954 conditions per place. [2024-06-04 17:58:32,154 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 81 selfloop transitions, 30 changer transitions 0/115 dead transitions. [2024-06-04 17:58:32,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 115 transitions, 830 flow [2024-06-04 17:58:32,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:58:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:58:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-06-04 17:58:32,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5679442508710801 [2024-06-04 17:58:32,156 INFO L175 Difference]: Start difference. First operand has 59 places, 65 transitions, 412 flow. Second operand 7 states and 163 transitions. [2024-06-04 17:58:32,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 115 transitions, 830 flow [2024-06-04 17:58:32,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 115 transitions, 812 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-06-04 17:58:32,161 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 487 flow [2024-06-04 17:58:32,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=487, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2024-06-04 17:58:32,162 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-06-04 17:58:32,162 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 487 flow [2024-06-04 17:58:32,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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-04 17:58:32,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:32,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:32,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-04 17:58:32,163 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-04 17:58:32,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:32,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1906059420, now seen corresponding path program 1 times [2024-06-04 17:58:32,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:32,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207107658] [2024-06-04 17:58:32,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:32,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:38,165 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-04 17:58:38,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:38,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207107658] [2024-06-04 17:58:38,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207107658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:38,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:38,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-04 17:58:38,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592881686] [2024-06-04 17:58:38,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:38,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-04 17:58:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:38,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-04 17:58:38,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-04 17:58:38,303 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:58:38,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:38,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:38,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:58:38,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:38,981 INFO L124 PetriNetUnfolderBase]: 1566/2367 cut-off events. [2024-06-04 17:58:38,981 INFO L125 PetriNetUnfolderBase]: For 7289/7304 co-relation queries the response was YES. [2024-06-04 17:58:38,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9232 conditions, 2367 events. 1566/2367 cut-off events. For 7289/7304 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10957 event pairs, 574 based on Foata normal form. 11/2375 useless extension candidates. Maximal degree in co-relation 9203. Up to 2344 conditions per place. [2024-06-04 17:58:38,996 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 66 selfloop transitions, 8 changer transitions 0/78 dead transitions. [2024-06-04 17:58:38,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 663 flow [2024-06-04 17:58:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 17:58:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 17:58:38,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2024-06-04 17:58:38,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4195121951219512 [2024-06-04 17:58:38,997 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 487 flow. Second operand 5 states and 86 transitions. [2024-06-04 17:58:38,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 663 flow [2024-06-04 17:58:39,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 78 transitions, 590 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 17:58:39,004 INFO L231 Difference]: Finished difference. Result has 65 places, 67 transitions, 438 flow [2024-06-04 17:58:39,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=438, PETRI_PLACES=65, PETRI_TRANSITIONS=67} [2024-06-04 17:58:39,006 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-06-04 17:58:39,006 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 67 transitions, 438 flow [2024-06-04 17:58:39,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:58:39,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:39,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:39,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-04 17:58:39,007 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-04 17:58:39,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1081397346, now seen corresponding path program 1 times [2024-06-04 17:58:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:39,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011250585] [2024-06-04 17:58:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:46,160 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-04 17:58:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011250585] [2024-06-04 17:58:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011250585] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:46,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:46,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:58:46,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803189043] [2024-06-04 17:58:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:46,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:58:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:46,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:58:46,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:58:46,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:58:46,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 67 transitions, 438 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-04 17:58:46,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:46,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:58:46,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:47,046 INFO L124 PetriNetUnfolderBase]: 1813/2722 cut-off events. [2024-06-04 17:58:47,046 INFO L125 PetriNetUnfolderBase]: For 8294/8294 co-relation queries the response was YES. [2024-06-04 17:58:47,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10103 conditions, 2722 events. 1813/2722 cut-off events. For 8294/8294 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12764 event pairs, 681 based on Foata normal form. 4/2724 useless extension candidates. Maximal degree in co-relation 10072. Up to 2682 conditions per place. [2024-06-04 17:58:47,076 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 78 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2024-06-04 17:58:47,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 92 transitions, 719 flow [2024-06-04 17:58:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:58:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:58:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-04 17:58:47,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943089430894309 [2024-06-04 17:58:47,093 INFO L175 Difference]: Start difference. First operand has 65 places, 67 transitions, 438 flow. Second operand 6 states and 97 transitions. [2024-06-04 17:58:47,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 92 transitions, 719 flow [2024-06-04 17:58:47,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 687 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-04 17:58:47,100 INFO L231 Difference]: Finished difference. Result has 69 places, 76 transitions, 521 flow [2024-06-04 17:58:47,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=521, PETRI_PLACES=69, PETRI_TRANSITIONS=76} [2024-06-04 17:58:47,100 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2024-06-04 17:58:47,100 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 76 transitions, 521 flow [2024-06-04 17:58:47,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-04 17:58:47,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:47,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:47,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-04 17:58:47,101 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-04 17:58:47,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:47,101 INFO L85 PathProgramCache]: Analyzing trace with hash -807427385, now seen corresponding path program 1 times [2024-06-04 17:58:47,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:47,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700058393] [2024-06-04 17:58:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:51,565 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-04 17:58:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700058393] [2024-06-04 17:58:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700058393] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:51,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:51,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:58:51,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751070950] [2024-06-04 17:58:51,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:51,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:58:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:51,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:58:51,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:58:51,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:58:51,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 76 transitions, 521 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 17:58:51,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:51,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:58:51,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:52,419 INFO L124 PetriNetUnfolderBase]: 1720/2595 cut-off events. [2024-06-04 17:58:52,419 INFO L125 PetriNetUnfolderBase]: For 10178/10244 co-relation queries the response was YES. [2024-06-04 17:58:52,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10448 conditions, 2595 events. 1720/2595 cut-off events. For 10178/10244 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12119 event pairs, 617 based on Foata normal form. 26/2604 useless extension candidates. Maximal degree in co-relation 10415. Up to 2480 conditions per place. [2024-06-04 17:58:52,431 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 70 selfloop transitions, 22 changer transitions 0/99 dead transitions. [2024-06-04 17:58:52,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 99 transitions, 812 flow [2024-06-04 17:58:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 17:58:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 17:58:52,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 110 transitions. [2024-06-04 17:58:52,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44715447154471544 [2024-06-04 17:58:52,433 INFO L175 Difference]: Start difference. First operand has 69 places, 76 transitions, 521 flow. Second operand 6 states and 110 transitions. [2024-06-04 17:58:52,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 99 transitions, 812 flow [2024-06-04 17:58:52,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 806 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-04 17:58:52,442 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 600 flow [2024-06-04 17:58:52,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=600, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2024-06-04 17:58:52,442 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 32 predicate places. [2024-06-04 17:58:52,442 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 600 flow [2024-06-04 17:58:52,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 17:58:52,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:52,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:52,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-04 17:58:52,443 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-04 17:58:52,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash -767578745, now seen corresponding path program 2 times [2024-06-04 17:58:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:52,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849432379] [2024-06-04 17:58:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:58:56,743 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-04 17:58:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:58:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849432379] [2024-06-04 17:58:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849432379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:58:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:58:56,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 17:58:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088674645] [2024-06-04 17:58:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:58:56,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 17:58:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:58:56,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 17:58:56,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-04 17:58:56,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:58:56,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 600 flow. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 17:58:56,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:58:56,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:58:56,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:58:57,527 INFO L124 PetriNetUnfolderBase]: 1703/2567 cut-off events. [2024-06-04 17:58:57,527 INFO L125 PetriNetUnfolderBase]: For 11718/11796 co-relation queries the response was YES. [2024-06-04 17:58:57,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10624 conditions, 2567 events. 1703/2567 cut-off events. For 11718/11796 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11944 event pairs, 613 based on Foata normal form. 6/2560 useless extension candidates. Maximal degree in co-relation 10588. Up to 2521 conditions per place. [2024-06-04 17:58:57,540 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 71 selfloop transitions, 17 changer transitions 0/95 dead transitions. [2024-06-04 17:58:57,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 95 transitions, 832 flow [2024-06-04 17:58:57,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:58:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:58:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2024-06-04 17:58:57,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3832752613240418 [2024-06-04 17:58:57,553 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 600 flow. Second operand 7 states and 110 transitions. [2024-06-04 17:58:57,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 95 transitions, 832 flow [2024-06-04 17:58:57,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 95 transitions, 798 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-06-04 17:58:57,564 INFO L231 Difference]: Finished difference. Result has 79 places, 81 transitions, 634 flow [2024-06-04 17:58:57,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=634, PETRI_PLACES=79, PETRI_TRANSITIONS=81} [2024-06-04 17:58:57,564 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places. [2024-06-04 17:58:57,564 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 81 transitions, 634 flow [2024-06-04 17:58:57,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-04 17:58:57,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:58:57,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:58:57,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-04 17:58:57,565 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-04 17:58:57,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:58:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash -18086433, now seen corresponding path program 1 times [2024-06-04 17:58:57,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:58:57,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259086994] [2024-06-04 17:58:57,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:58:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:58:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:03,117 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-04 17:59:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259086994] [2024-06-04 17:59:03,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259086994] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:03,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:03,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:59:03,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498911972] [2024-06-04 17:59:03,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:03,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:59:03,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:59:03,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:59:03,201 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:03,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 81 transitions, 634 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:03,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:03,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:03,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:04,016 INFO L124 PetriNetUnfolderBase]: 1872/2805 cut-off events. [2024-06-04 17:59:04,016 INFO L125 PetriNetUnfolderBase]: For 14050/14052 co-relation queries the response was YES. [2024-06-04 17:59:04,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11506 conditions, 2805 events. 1872/2805 cut-off events. For 14050/14052 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13030 event pairs, 590 based on Foata normal form. 8/2811 useless extension candidates. Maximal degree in co-relation 11468. Up to 2589 conditions per place. [2024-06-04 17:59:04,027 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 101 selfloop transitions, 24 changer transitions 0/128 dead transitions. [2024-06-04 17:59:04,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 128 transitions, 1153 flow [2024-06-04 17:59:04,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-04 17:59:04,030 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-04 17:59:04,030 INFO L175 Difference]: Start difference. First operand has 79 places, 81 transitions, 634 flow. Second operand 7 states and 124 transitions. [2024-06-04 17:59:04,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 128 transitions, 1153 flow [2024-06-04 17:59:04,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 128 transitions, 1072 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-04 17:59:04,039 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 787 flow [2024-06-04 17:59:04,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=787, PETRI_PLACES=83, PETRI_TRANSITIONS=98} [2024-06-04 17:59:04,040 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places. [2024-06-04 17:59:04,040 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 787 flow [2024-06-04 17:59:04,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:04,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:04,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:04,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-04 17:59:04,041 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-04 17:59:04,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:04,041 INFO L85 PathProgramCache]: Analyzing trace with hash -344770917, now seen corresponding path program 2 times [2024-06-04 17:59:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:04,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598541093] [2024-06-04 17:59:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:04,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:04,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:09,494 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-04 17:59:09,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:09,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598541093] [2024-06-04 17:59:09,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598541093] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:09,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:09,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:59:09,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156736106] [2024-06-04 17:59:09,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:09,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:59:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:09,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:59:09,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:59:09,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:09,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 787 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:09,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:09,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:09,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:10,370 INFO L124 PetriNetUnfolderBase]: 1894/2836 cut-off events. [2024-06-04 17:59:10,370 INFO L125 PetriNetUnfolderBase]: For 16734/16734 co-relation queries the response was YES. [2024-06-04 17:59:10,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12646 conditions, 2836 events. 1894/2836 cut-off events. For 16734/16734 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13084 event pairs, 616 based on Foata normal form. 4/2838 useless extension candidates. Maximal degree in co-relation 12604. Up to 2787 conditions per place. [2024-06-04 17:59:10,384 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 102 selfloop transitions, 15 changer transitions 0/120 dead transitions. [2024-06-04 17:59:10,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 120 transitions, 1093 flow [2024-06-04 17:59:10,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:10,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-04 17:59:10,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-04 17:59:10,400 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 787 flow. Second operand 7 states and 111 transitions. [2024-06-04 17:59:10,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 120 transitions, 1093 flow [2024-06-04 17:59:10,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 120 transitions, 1073 flow, removed 9 selfloop flow, removed 1 redundant places. [2024-06-04 17:59:10,414 INFO L231 Difference]: Finished difference. Result has 89 places, 101 transitions, 833 flow [2024-06-04 17:59:10,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=833, PETRI_PLACES=89, PETRI_TRANSITIONS=101} [2024-06-04 17:59:10,415 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-04 17:59:10,415 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 101 transitions, 833 flow [2024-06-04 17:59:10,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:10,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:10,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:10,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-04 17:59:10,416 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-04 17:59:10,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash 159045087, now seen corresponding path program 3 times [2024-06-04 17:59:10,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:10,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068193331] [2024-06-04 17:59:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:15,904 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-04 17:59:15,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:15,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068193331] [2024-06-04 17:59:15,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068193331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:15,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:15,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:59:15,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11935019] [2024-06-04 17:59:15,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:15,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:59:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:15,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:59:15,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:59:15,997 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:15,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 101 transitions, 833 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:15,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:15,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:15,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:16,831 INFO L124 PetriNetUnfolderBase]: 1884/2822 cut-off events. [2024-06-04 17:59:16,832 INFO L125 PetriNetUnfolderBase]: For 19275/19275 co-relation queries the response was YES. [2024-06-04 17:59:16,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12904 conditions, 2822 events. 1884/2822 cut-off events. For 19275/19275 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12999 event pairs, 614 based on Foata normal form. 4/2824 useless extension candidates. Maximal degree in co-relation 12859. Up to 2746 conditions per place. [2024-06-04 17:59:16,876 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 104 selfloop transitions, 20 changer transitions 0/127 dead transitions. [2024-06-04 17:59:16,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 127 transitions, 1188 flow [2024-06-04 17:59:16,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 17:59:16,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-04 17:59:16,879 INFO L175 Difference]: Start difference. First operand has 89 places, 101 transitions, 833 flow. Second operand 7 states and 114 transitions. [2024-06-04 17:59:16,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 127 transitions, 1188 flow [2024-06-04 17:59:16,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 127 transitions, 1149 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 17:59:16,895 INFO L231 Difference]: Finished difference. Result has 92 places, 107 transitions, 913 flow [2024-06-04 17:59:16,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=913, PETRI_PLACES=92, PETRI_TRANSITIONS=107} [2024-06-04 17:59:16,897 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 50 predicate places. [2024-06-04 17:59:16,897 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 107 transitions, 913 flow [2024-06-04 17:59:16,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:16,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:16,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:16,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-04 17:59:16,898 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:59:16,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:16,898 INFO L85 PathProgramCache]: Analyzing trace with hash 159291165, now seen corresponding path program 1 times [2024-06-04 17:59:16,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:16,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512026621] [2024-06-04 17:59:16,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:16,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:24,195 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-04 17:59:24,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:24,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512026621] [2024-06-04 17:59:24,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512026621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:24,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:24,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:59:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93373091] [2024-06-04 17:59:24,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:24,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:59:24,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:24,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:59:24,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:59:24,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:24,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 107 transitions, 913 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-04 17:59:24,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:24,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:24,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:25,230 INFO L124 PetriNetUnfolderBase]: 1876/2810 cut-off events. [2024-06-04 17:59:25,231 INFO L125 PetriNetUnfolderBase]: For 21960/21960 co-relation queries the response was YES. [2024-06-04 17:59:25,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13207 conditions, 2810 events. 1876/2810 cut-off events. For 21960/21960 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12941 event pairs, 595 based on Foata normal form. 4/2812 useless extension candidates. Maximal degree in co-relation 13161. Up to 2752 conditions per place. [2024-06-04 17:59:25,246 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 109 selfloop transitions, 16 changer transitions 0/128 dead transitions. [2024-06-04 17:59:25,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 128 transitions, 1225 flow [2024-06-04 17:59:25,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:25,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-04 17:59:25,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-04 17:59:25,249 INFO L175 Difference]: Start difference. First operand has 92 places, 107 transitions, 913 flow. Second operand 7 states and 111 transitions. [2024-06-04 17:59:25,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 128 transitions, 1225 flow [2024-06-04 17:59:25,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 128 transitions, 1198 flow, removed 7 selfloop flow, removed 3 redundant places. [2024-06-04 17:59:25,263 INFO L231 Difference]: Finished difference. Result has 96 places, 109 transitions, 943 flow [2024-06-04 17:59:25,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=943, PETRI_PLACES=96, PETRI_TRANSITIONS=109} [2024-06-04 17:59:25,263 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2024-06-04 17:59:25,263 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 109 transitions, 943 flow [2024-06-04 17:59:25,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-04 17:59:25,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:25,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:25,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-04 17:59:25,264 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-04 17:59:25,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:25,265 INFO L85 PathProgramCache]: Analyzing trace with hash 273043504, now seen corresponding path program 1 times [2024-06-04 17:59:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:25,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139040098] [2024-06-04 17:59:25,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:25,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:31,231 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-04 17:59:31,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:31,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139040098] [2024-06-04 17:59:31,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139040098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:31,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:31,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:59:31,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948334876] [2024-06-04 17:59:31,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:31,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:59:31,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:59:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:59:31,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 17:59:31,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 109 transitions, 943 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:31,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:31,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 17:59:31,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:31,839 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][79], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1) (+ ~z$r_buff0_thd2~0 ~__unbuffered_cnt~0)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 132#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= 2 ~x~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (<= (+ (* (div ~z$flush_delayed~0 256) 256) ~z$read_delayed~0) (+ (* 256 (div ~z$read_delayed~0 256)) ~z$flush_delayed~0)) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 168#true, 8#L784true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff0_thd2~0) (+ (* 256 (div ~z$r_buff1_thd3~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 100#true, 71#true, 10#L823-5true, P0Thread1of1ForFork1InUse, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 182#true, P2Thread1of1ForFork2InUse, Black: 110#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 12#L754true, 31#L791true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 122#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-04 17:59:31,840 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,840 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,840 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,840 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][103], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1) (+ ~z$r_buff0_thd2~0 ~__unbuffered_cnt~0)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 132#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= 2 ~x~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (<= (+ (* (div ~z$flush_delayed~0 256) 256) ~z$read_delayed~0) (+ (* 256 (div ~z$read_delayed~0 256)) ~z$flush_delayed~0)) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 168#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff0_thd2~0) (+ (* 256 (div ~z$r_buff1_thd3~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 100#true, 71#true, 10#L823-5true, P0Thread1of1ForFork1InUse, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 182#true, P2Thread1of1ForFork2InUse, Black: 110#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 28#L761true, 31#L791true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 122#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-04 17:59:31,841 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,841 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,841 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,841 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][115], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1) (+ ~z$r_buff0_thd2~0 ~__unbuffered_cnt~0)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 132#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= 2 ~x~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (<= (+ (* (div ~z$flush_delayed~0 256) 256) ~z$read_delayed~0) (+ (* 256 (div ~z$read_delayed~0 256)) ~z$flush_delayed~0)) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 168#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff0_thd2~0) (+ (* 256 (div ~z$r_buff1_thd3~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0)), 37#L781true, 14#L794true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 100#true, 71#true, 10#L823-5true, P0Thread1of1ForFork1InUse, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 182#true, P2Thread1of1ForFork2InUse, Black: 110#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 12#L754true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 122#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-04 17:59:31,842 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,842 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,842 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,842 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2024-06-04 17:59:31,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([370] L781-->L784: Formula: (= v_~__unbuffered_cnt~0_3 (+ v_~__unbuffered_cnt~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_4} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_3} AuxVars[] AssignedVars[~__unbuffered_cnt~0][79], [139#true, 42#L824true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1) (+ ~z$r_buff0_thd2~0 ~__unbuffered_cnt~0)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 132#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= 2 ~x~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (<= (+ (* (div ~z$flush_delayed~0 256) 256) ~z$read_delayed~0) (+ (* 256 (div ~z$read_delayed~0 256)) ~z$flush_delayed~0)) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 168#true, 8#L784true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff0_thd2~0) (+ (* 256 (div ~z$r_buff1_thd3~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0)), Black: 160#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 100#true, 71#true, P0Thread1of1ForFork1InUse, 182#true, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 110#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 12#L754true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 31#L791true, 198#true, Black: 122#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-04 17:59:31,925 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,925 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,925 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,925 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([358] L824-->ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT: Formula: (let ((.cse22 (< v_~z$w_buff0~0_11 0)) (.cse39 (mod v_~z$r_buff0_thd2~0_13 256)) (.cse42 (mod v_~z$r_buff1_thd0~0_7 256)) (.cse38 (mod v_~z$r_buff1_thd3~0_11 256)) (.cse41 (mod v_~z$r_buff1_thd2~0_11 256)) (.cse37 (mod v_~z$r_buff0_thd3~0_13 256)) (.cse36 (mod v_~z$r_buff0_thd0~0_7 256)) (.cse43 (mod v_~z$read_delayed~0_6 256)) (.cse6 (< v_~z$w_buff1~0_10 0))) (let ((.cse2 (and (not (= v_~z~0_13 2)) (not (= v_~z~0_13 0)) (not (= v_~z~0_13 1)))) (.cse7 (not (= (let ((.cse79 (mod v_~z$w_buff1~0_10 2))) (ite (and .cse6 (not (= .cse79 0))) (+ (- 2) .cse79) .cse79)) 0))) (.cse15 (not (= .cse43 0))) (.cse0 (not (= .cse36 0))) (.cse3 (< v_~z~0_13 0)) (.cse11 (not (= v_~z$read_delayed_var~0.offset_6 0))) (.cse13 (and (not (= v_~x~0_8 0)) (not (= 2 v_~x~0_8)) (not (= v_~x~0_8 1)))) (.cse5 (< v_~__unbuffered_cnt~0_12 0)) (.cse8 (< 127 v_~z$w_buff1~0_10)) (.cse4 (< 127 v_~z~0_13)) (.cse12 (not (= v_~z$read_delayed_var~0.base_6 0))) (.cse9 (and (not (= 2 v_~z$w_buff1~0_10)) (not (= v_~z$w_buff1~0_10 0)))) (.cse10 (< 2 v_~z$w_buff1~0_10)) (.cse14 (< v_~x~0_8 0)) (.cse17 (not (= .cse37 0))) (.cse19 (and (not (= v_~z$mem_tmp~0_6 1)) (not (= v_~z$mem_tmp~0_6 0)) (not (= 2 v_~z$mem_tmp~0_6)))) (.cse23 (< 127 v_~z$mem_tmp~0_6)) (.cse33 (< v_~z$mem_tmp~0_6 0)) (.cse34 (not (= .cse41 0))) (.cse25 (< 1 v_~__unbuffered_p2_EAX~0_7)) (.cse28 (and (not (= v_~__unbuffered_p2_EAX~0_7 1)) (not (= v_~__unbuffered_p2_EAX~0_7 0)))) (.cse31 (< v_~__unbuffered_p2_EAX~0_7 0)) (.cse16 (and (not (= v_~y~0_8 1)) (not (= v_~y~0_8 0)))) (.cse27 (< 1 v_~y~0_8)) (.cse35 (< v_~y~0_8 0)) (.cse21 (not (= .cse38 0))) (.cse18 (not (= .cse42 0))) (.cse29 (not (= .cse39 0))) (.cse32 (mod v_~z$flush_delayed~0_6 256)) (.cse20 (and (not (= v_~z$w_buff0~0_11 0)) (not (= 2 v_~z$w_buff0~0_11)))) (.cse24 (< 2 v_~z$w_buff0~0_11)) (.cse26 (< 127 v_~z$w_buff0~0_11)) (.cse30 (not (= (let ((.cse78 (mod v_~z$w_buff0~0_11 2))) (ite (and .cse22 (not (= .cse78 0))) (+ (- 2) .cse78) .cse78)) 0))) (.cse1 (not (= |v_#ghost~multithreaded_7| 0)))) (or (and .cse0 .cse1) (and .cse1 (or .cse2 .cse3 .cse4)) (and .cse5 .cse1) (and (or .cse6 .cse7 .cse8 .cse9 .cse10) .cse1) (and (or .cse11 .cse12) .cse1) (and .cse1 (or (< 127 v_~x~0_8) .cse13 (< 2 v_~x~0_8) .cse14)) (and .cse15 .cse1) (and (or .cse2 .cse6 .cse16 .cse17 .cse18 .cse19 .cse7 .cse15 .cse0 .cse20 .cse3 .cse11 .cse21 .cse22 .cse23 .cse13 .cse5 .cse24 .cse25 .cse26 .cse8 .cse27 .cse28 .cse29 .cse4 .cse12 .cse30 .cse31 .cse9 .cse10 (not (= .cse32 0)) .cse14 .cse33 .cse34 .cse35) .cse1) (and .cse17 .cse1) (and (or .cse19 .cse23 .cse33) .cse1) (and .cse1 .cse34) (and (or .cse25 .cse28 .cse31) .cse1) (and (or .cse16 .cse27 .cse35) .cse1) (and .cse21 .cse1) (and .cse18 .cse1) (and .cse29 .cse1) (and (let ((.cse40 (mod v_~weak$$choice2~0_6 256)) (.cse49 (mod v_~weak$$choice0~0_6 256)) (.cse50 (mod v_~main$tmp_guard1~0_6 256))) (let ((.cse46 (+ .cse38 2)) (.cse53 (+ v_~z~0_13 2)) (.cse52 (+ .cse41 v_~z$w_buff1~0_10)) (.cse57 (+ .cse37 v_~z$w_buff0~0_11)) (.cse59 (+ 2 v_~__unbuffered_cnt~0_12)) (.cse51 (+ 2 .cse32)) (.cse64 (+ .cse38 v_~z$w_buff1~0_10)) (.cse44 (+ 2 v_~z$mem_tmp~0_6)) (.cse65 (+ .cse41 v_~z$w_buff0~0_11)) (.cse62 (+ 2 v_~y~0_8)) (.cse47 (+ 2 .cse39)) (.cse61 (+ .cse36 v_~z$w_buff0~0_11)) (.cse58 (+ 2 .cse50)) (.cse71 (+ .cse42 v_~z$w_buff1~0_10)) (.cse66 (+ .cse41 2)) (.cse45 (+ .cse43 2)) (.cse54 (+ 2 .cse36)) (.cse48 (+ .cse38 v_~z$w_buff0~0_11)) (.cse67 (+ v_~z$w_buff1~0_10 .cse39)) (.cse56 (+ 2 .cse49)) (.cse63 (+ .cse42 v_~z$w_buff0~0_11)) (.cse73 (+ 2 .cse40)) (.cse69 (+ 2 .cse42)) (.cse74 (+ v_~__unbuffered_p2_EAX~0_7 2)) (.cse60 (+ .cse43 v_~z$w_buff0~0_11)) (.cse72 (+ v_~z$w_buff0~0_11 .cse39)) (.cse76 (+ .cse36 v_~z$w_buff1~0_10)) (.cse68 (+ 2 v_~x~0_8)) (.cse77 (+ v_~z$w_buff0~0_11 v_~z$w_buff1~0_10)) (.cse55 (+ .cse43 v_~z$w_buff1~0_10)) (.cse70 (+ .cse37 v_~z$w_buff1~0_10)) (.cse75 (+ 2 .cse37))) (or (< (+ .cse36 v_~z$mem_tmp~0_6) 0) (< (+ .cse37 v_~__unbuffered_cnt~0_12) 0) (< .cse36 .cse38) (< v_~__unbuffered_cnt~0_12 .cse39) (< .cse40 .cse32) (< .cse39 .cse41) (< v_~z$mem_tmp~0_6 .cse39) (< .cse40 .cse39) (< v_~__unbuffered_p2_EAX~0_7 .cse42) (< .cse32 .cse42) (< (+ v_~__unbuffered_cnt~0_12 .cse40) 0) (< (+ v_~y~0_8 v_~z$mem_tmp~0_6) 0) (< .cse43 .cse38) (< (+ .cse39 v_~x~0_8) 0) (< (+ v_~z~0_13 v_~z$w_buff1~0_10) 0) (< v_~x~0_8 .cse39) (< .cse42 .cse39) (< (+ v_~__unbuffered_cnt~0_12 v_~z$mem_tmp~0_6) 0) (< .cse44 v_~z$w_buff0~0_11) (< .cse45 v_~z$w_buff1~0_10) (< v_~__unbuffered_p2_EAX~0_7 .cse37) (< .cse46 v_~z$w_buff0~0_11) (< .cse47 v_~z$w_buff1~0_10) (< v_~__unbuffered_cnt~0_12 .cse37) (< v_~z$mem_tmp~0_6 .cse38) (< (+ v_~__unbuffered_cnt~0_12 .cse32) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~__unbuffered_cnt~0_12) 0) (< .cse38 .cse41) (< .cse41 .cse43) (< .cse48 0) (< v_~z$w_buff1~0_10 .cse43) (< v_~x~0_8 .cse36) (< .cse49 .cse39) (< v_~z~0_13 .cse41) (< v_~z~0_13 .cse43) (< (+ v_~z~0_13 .cse42) 0) (< .cse38 .cse43) (< .cse43 .cse42) (< .cse39 .cse42) (< (+ .cse38 v_~y~0_8) 0) (< (+ .cse40 v_~z$mem_tmp~0_6) 0) (< .cse32 .cse38) (< v_~z$w_buff1~0_10 .cse37) (< .cse42 .cse37) (< .cse50 .cse43) (< .cse43 .cse36) (< .cse51 v_~z$w_buff1~0_10) (< 2 .cse52) (< v_~y~0_8 .cse36) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z~0_13) 0) (< .cse46 v_~z$w_buff1~0_10) (< .cse53 v_~z$w_buff1~0_10) (< (+ v_~z$w_buff1~0_10 v_~z$mem_tmp~0_6) 0) (< .cse32 .cse37) (< (+ .cse43 v_~y~0_8) 0) (< .cse54 v_~z$w_buff0~0_11) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse36) 0) (< .cse55 0) (< (+ .cse41 v_~__unbuffered_cnt~0_12) 0) (< .cse39 .cse36) (< .cse41 .cse36) (< (+ v_~__unbuffered_cnt~0_12 v_~z$w_buff1~0_10) 0) (< .cse40 .cse41) (< v_~__unbuffered_cnt~0_12 .cse36) (< v_~z$w_buff0~0_11 .cse36) (< v_~z~0_13 .cse36) (< v_~z$w_buff1~0_10 .cse42) (< .cse53 v_~z$w_buff0~0_11) (< .cse37 .cse38) (< (+ v_~x~0_8 v_~z$mem_tmp~0_6) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z$mem_tmp~0_6) 0) (< 0 (+ .cse38 .cse36)) (< .cse56 v_~z$w_buff1~0_10) (< (+ .cse36 v_~__unbuffered_cnt~0_12) 0) (< .cse32 .cse36) (< (+ .cse50 v_~z$w_buff1~0_10) 0) (< v_~z$w_buff1~0_10 .cse36) (< v_~y~0_8 .cse37) (< v_~y~0_8 .cse42) (< 2 .cse57) (< .cse36 .cse41) (< .cse50 .cse36) (< 0 (+ .cse43 .cse38)) (< (+ v_~x~0_8 v_~y~0_8) 0) (< .cse41 .cse38) (< .cse42 .cse36) (< (+ 2 v_~z$w_buff1~0_10) v_~z$w_buff0~0_11) (< .cse58 v_~z$w_buff1~0_10) (< .cse40 .cse42) (< .cse43 .cse39) (< .cse59 v_~z$w_buff1~0_10) (< 0 (+ .cse41 .cse39)) (< .cse49 .cse37) (< .cse41 .cse42) (< (+ v_~z$w_buff0~0_11 .cse40) 0) (< (+ .cse38 v_~x~0_8) 0) (< .cse43 .cse37) (< 2 .cse60) (< .cse61 0) (< 0 (+ .cse37 .cse39)) (< (+ .cse37 v_~x~0_8) 0) (< (+ .cse43 v_~z~0_13) 0) (< .cse52 0) (< (+ .cse49 v_~z$w_buff1~0_10) 0) (< (+ .cse41 v_~y~0_8) 0) (< .cse57 0) (< .cse62 v_~z$w_buff0~0_11) (< 2 .cse63) (< .cse50 .cse38) (< (+ v_~z$w_buff0~0_11 v_~y~0_8) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse49) 0) (< (+ .cse50 v_~y~0_8) 0) (< (+ v_~__unbuffered_cnt~0_12 .cse39) 0) (< .cse37 .cse41) (< .cse59 v_~z$w_buff0~0_11) (< (+ v_~z$w_buff0~0_11 v_~x~0_8) 0) (< v_~__unbuffered_p2_EAX~0_7 .cse38) (< (+ v_~z~0_13 .cse50) 0) (< (+ .cse41 v_~x~0_8) 0) (< v_~z$w_buff1~0_10 .cse41) (< v_~__unbuffered_p2_EAX~0_7 .cse41) (< 2 .cse64) (< v_~z$mem_tmp~0_6 .cse43) (< (+ v_~z~0_13 v_~z$mem_tmp~0_6) 0) (< 2 .cse65) (< .cse51 v_~z$w_buff0~0_11) (< .cse64 0) (< (+ v_~z~0_13 .cse40) 0) (< .cse66 v_~z$w_buff0~0_11) (< (+ .cse42 v_~__unbuffered_cnt~0_12) 0) (< (+ .cse49 v_~z$w_buff0~0_11) 0) (< .cse44 v_~z$w_buff1~0_10) (< v_~z$w_buff0~0_11 v_~z$w_buff1~0_10) (< (+ v_~z$w_buff1~0_10 .cse32) 0) (< v_~__unbuffered_cnt~0_12 .cse38) (< (+ v_~z~0_13 v_~x~0_8) 0) (< .cse41 .cse39) (< .cse40 .cse37) (< (+ v_~z~0_13 .cse37) 0) (< 0 (+ .cse41 .cse38)) (< (+ .cse50 v_~z$w_buff0~0_11) 0) (< .cse36 .cse43) (< .cse49 .cse38) (< .cse37 .cse42) (< v_~z$mem_tmp~0_6 .cse42) (< .cse65 0) (< (+ v_~z$w_buff0~0_11 v_~z$mem_tmp~0_6) 0) (< (+ .cse43 v_~__unbuffered_p2_EAX~0_7) 0) (< .cse42 .cse43) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse37) 0) (< (+ .cse43 v_~__unbuffered_cnt~0_12) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse42) 0) (< 0 (+ .cse36 .cse42)) (< .cse62 v_~z$w_buff1~0_10) (< 2 .cse67) (< .cse47 v_~z$w_buff0~0_11) (< .cse41 .cse37) (< v_~z$mem_tmp~0_6 .cse37) (< .cse39 .cse38) (< .cse32 .cse41) (< .cse50 .cse37) (< v_~x~0_8 .cse43) (< (+ .cse36 v_~y~0_8) 0) (< 0 (+ .cse43 .cse37)) (< .cse68 v_~z$w_buff1~0_10) (< 2 .cse61) (< v_~z$w_buff0~0_11 .cse38) (< .cse38 .cse37) (< 0 (+ .cse43 .cse36)) (< .cse69 v_~z$w_buff0~0_11) (< 0 (+ .cse43 .cse41)) (< .cse36 .cse37) (< 2 .cse70) (< .cse37 .cse36) (< v_~y~0_8 .cse38) (< (+ v_~__unbuffered_cnt~0_12 v_~x~0_8) 0) (< .cse49 .cse41) (< .cse36 .cse42) (< .cse50 .cse42) (< v_~z~0_13 .cse39) (< (+ .cse50 v_~z$mem_tmp~0_6) 0) (< .cse71 0) (< (+ .cse38 v_~z~0_13) 0) (< .cse58 v_~z$w_buff0~0_11) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z$w_buff1~0_10) 0) (< 0 (+ .cse38 .cse42)) (< (+ .cse42 v_~x~0_8) 0) (< .cse50 .cse41) (< .cse39 .cse43) (< (+ v_~__unbuffered_cnt~0_12 v_~y~0_8) 0) (< .cse49 .cse42) (< v_~z$mem_tmp~0_6 .cse36) (< v_~y~0_8 .cse41) (< .cse32 .cse43) (< 0 (+ .cse43 .cse42)) (< 2 .cse71) (< (+ v_~z~0_13 v_~y~0_8) 0) (< v_~__unbuffered_p2_EAX~0_7 .cse39) (< (+ .cse39 v_~z$mem_tmp~0_6) 0) (< 0 (+ .cse41 .cse42)) (< (+ v_~z$w_buff0~0_11 .cse32) 0) (< (+ .cse38 v_~z$mem_tmp~0_6) 0) (< .cse72 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse50) 0) (< (+ v_~z~0_13 .cse39) 0) (< 0 (+ .cse38 .cse39)) (< .cse66 v_~z$w_buff1~0_10) (< (+ .cse50 v_~x~0_8) 0) (< (+ v_~__unbuffered_cnt~0_12 v_~z$w_buff0~0_11) 0) (< v_~y~0_8 .cse43) (< .cse73 v_~z$w_buff0~0_11) (< .cse45 v_~z$w_buff0~0_11) (< (+ v_~z~0_13 v_~z$w_buff0~0_11) 0) (< .cse54 v_~z$w_buff1~0_10) (< .cse32 .cse39) (< 2 .cse48) (< .cse67 0) (< 0 (+ .cse38 .cse37)) (< .cse56 v_~z$w_buff0~0_11) (< v_~z$w_buff0~0_11 .cse42) (< v_~x~0_8 .cse38) (< (+ .cse38 v_~__unbuffered_p2_EAX~0_7) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~x~0_8) 0) (< .cse43 .cse41) (< .cse74 v_~z$w_buff1~0_10) (< (+ .cse40 v_~y~0_8) 0) (< .cse63 0) (< 0 (+ .cse42 .cse39)) (< v_~z$mem_tmp~0_6 .cse41) (< (+ v_~z$w_buff1~0_10 v_~x~0_8) 0) (< 0 (+ .cse37 .cse42)) (< 0 (+ .cse41 .cse36)) (< v_~__unbuffered_cnt~0_12 .cse41) (< (+ v_~__unbuffered_cnt~0_12 .cse50) 0) (< v_~x~0_8 .cse37) (< (+ .cse42 v_~y~0_8) 0) (< v_~z~0_13 .cse37) (< (+ v_~z~0_13 .cse49) 0) (< .cse42 .cse38) (< .cse37 .cse43) (< .cse73 v_~z$w_buff1~0_10) (< .cse40 .cse43) (< .cse36 .cse39) (< v_~x~0_8 .cse41) (< (+ .cse40 v_~x~0_8) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~z$w_buff0~0_11) 0) (< .cse38 .cse39) (< (+ .cse38 v_~__unbuffered_cnt~0_12) 0) (< .cse38 .cse36) (< (+ .cse36 v_~x~0_8) 0) (< (+ v_~z~0_13 .cse36) 0) (< (+ .cse41 v_~z$mem_tmp~0_6) 0) (< .cse75 v_~z$w_buff1~0_10) (< (+ .cse49 v_~x~0_8) 0) (< .cse69 v_~z$w_buff1~0_10) (< .cse39 .cse37) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse39) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 v_~y~0_8) 0) (< .cse42 .cse41) (< (+ .cse41 v_~__unbuffered_p2_EAX~0_7) 0) (< .cse38 .cse42) (< v_~x~0_8 .cse42) (< v_~z$w_buff0~0_11 .cse39) (< v_~z~0_13 .cse38) (< .cse74 v_~z$w_buff0~0_11) (< 0 (+ .cse41 .cse37)) (< .cse40 .cse38) (< (+ v_~z~0_13 .cse32) 0) (< (+ .cse39 v_~y~0_8) 0) (< (+ .cse49 v_~z$mem_tmp~0_6) 0) (< .cse37 .cse39) (< v_~__unbuffered_p2_EAX~0_7 .cse43) (< v_~__unbuffered_cnt~0_12 .cse42) (< v_~y~0_8 .cse39) (< 0 (+ .cse43 .cse39)) (< .cse60 0) (< 0 (+ .cse36 .cse39)) (< v_~z$w_buff1~0_10 .cse39) (< (+ .cse32 v_~y~0_8) 0) (< .cse40 .cse36) (< 2 .cse72) (< v_~z~0_13 .cse42) (< (+ .cse32 v_~x~0_8) 0) (< (+ .cse41 v_~z~0_13) 0) (< v_~z$w_buff1~0_10 .cse38) (< (+ .cse32 v_~z$mem_tmp~0_6) 0) (< 0 (+ .cse37 .cse36)) (< (+ v_~z~0_13 v_~__unbuffered_cnt~0_12) 0) (< (+ v_~z$w_buff1~0_10 .cse40) 0) (< .cse49 .cse36) (< v_~__unbuffered_p2_EAX~0_7 .cse36) (< (+ .cse43 v_~z$mem_tmp~0_6) 0) (< (+ .cse49 v_~y~0_8) 0) (< (+ .cse43 v_~x~0_8) 0) (< v_~z$w_buff0~0_11 .cse41) (< (+ .cse37 v_~y~0_8) 0) (< 2 .cse76) (< v_~z$w_buff0~0_11 .cse43) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse40) 0) (< .cse77 0) (< (+ .cse42 v_~z$mem_tmp~0_6) 0) (< (+ v_~__unbuffered_p2_EAX~0_7 .cse32) 0) (< .cse50 .cse39) (< v_~__unbuffered_cnt~0_12 .cse43) (< .cse76 0) (< .cse68 v_~z$w_buff0~0_11) (< (+ v_~z$w_buff1~0_10 v_~y~0_8) 0) (< 4 .cse77) (< (+ .cse49 v_~__unbuffered_cnt~0_12) 0) (< 2 .cse55) (< (+ .cse37 v_~z$mem_tmp~0_6) 0) (< .cse49 .cse43) (< v_~z$w_buff0~0_11 .cse37) (< .cse70 0) (< .cse75 v_~z$w_buff0~0_11)))) .cse1) (and (or .cse20 .cse22 .cse24 .cse26 .cse30) .cse1)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$w_buff0~0=v_~z$w_buff0~0_11, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_13, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~z~0=v_~z~0_13, ~y~0=v_~y~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_6, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$w_buff0~0=v_~z$w_buff0~0_11, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_6, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_13, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, #ghost~multithreaded=|v_#ghost~multithreaded_7|, ~z~0=v_~z~0_13, ~y~0=v_~y~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_6, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_13} AuxVars[] AssignedVars[][108], [139#true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1) (+ ~z$r_buff0_thd2~0 ~__unbuffered_cnt~0)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 132#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= 2 ~x~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (<= (+ (* (div ~z$flush_delayed~0 256) 256) ~z$read_delayed~0) (+ (* 256 (div ~z$read_delayed~0 256)) ~z$flush_delayed~0)) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 168#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff0_thd2~0) (+ (* 256 (div ~z$r_buff1_thd3~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 100#true, 71#true, P0Thread1of1ForFork1InUse, 182#true, 34#ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P2Thread1of1ForFork2InUse, Black: 110#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), P1Thread1of1ForFork0InUse, Black: 175#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 12#L754true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 31#L791true, 198#true, Black: 122#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-04 17:59:31,928 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,928 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,928 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,928 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([363] L754-->L761: Formula: (let ((.cse2 (not (= (mod v_~z$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~z$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~z$r_buff0_thd1~0_25 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~z$w_buff0_used~0_52 256) 0)))) (.cse4 (and .cse3 (not (= (mod v_~z$w_buff1_used~0_41 256) 0)))) (.cse1 (and .cse5 .cse2))) (and (= v_~z$w_buff0_used~0_51 (ite .cse0 0 v_~z$w_buff0_used~0_52)) (= v_~z$r_buff0_thd1~0_24 (ite .cse1 0 v_~z$r_buff0_thd1~0_25)) (= (ite (or (and .cse2 (not (= (mod v_~z$r_buff0_thd1~0_24 256) 0))) (and .cse3 (not (= (mod v_~z$w_buff1_used~0_40 256) 0)))) 0 v_~z$r_buff1_thd1~0_20) v_~z$r_buff1_thd1~0_19) (= v_~z~0_23 (ite .cse0 v_~z$w_buff0~0_21 (ite .cse4 v_~z$w_buff1~0_18 v_~z~0_24))) (= (ite (or .cse4 .cse1) 0 v_~z$w_buff1_used~0_41) v_~z$w_buff1_used~0_40)))) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_52, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_20, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_41, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_24, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} OutVars{~z$w_buff0_used~0=v_~z$w_buff0_used~0_51, ~z$w_buff0~0=v_~z$w_buff0~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_40, ~z$w_buff1~0=v_~z$w_buff1~0_18, ~z~0=v_~z~0_23, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$r_buff1_thd1~0, ~z$w_buff1_used~0, ~z~0, ~z$r_buff0_thd1~0][103], [139#true, 42#L824true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1) (+ ~z$r_buff0_thd2~0 ~__unbuffered_cnt~0)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 132#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= 2 ~x~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (<= (+ (* (div ~z$flush_delayed~0 256) 256) ~z$read_delayed~0) (+ (* 256 (div ~z$read_delayed~0 256)) ~z$flush_delayed~0)) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 168#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff0_thd2~0) (+ (* 256 (div ~z$r_buff1_thd3~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 100#true, 71#true, P0Thread1of1ForFork1InUse, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 182#true, P2Thread1of1ForFork2InUse, Black: 110#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 28#L761true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 31#L791true, 198#true, Black: 122#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-04 17:59:31,929 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,929 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,929 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,929 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,929 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([374] L791-->L794: Formula: (= v_~z~0_5 1) InVars {} OutVars{~z~0=v_~z~0_5} AuxVars[] AssignedVars[~z~0][115], [139#true, 42#L824true, Black: 65#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 67#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 190#(and (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= (+ (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$read_delayed~0) (+ ~z$r_buff0_thd0~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ (* (div ~z$r_buff0_thd2~0 256) 256) 1) (+ ~z$r_buff0_thd2~0 ~__unbuffered_cnt~0)) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 66#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 63#true, Black: 132#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= 2 ~x~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (not (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 129#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 75#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 74#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff0_thd1~0 1) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 73#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 76#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 146#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 145#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 148#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$r_buff0_thd3~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (<= (+ (* (div ~z$flush_delayed~0 256) 256) ~z$read_delayed~0) (+ (* 256 (div ~z$read_delayed~0 256)) ~z$flush_delayed~0)) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), Black: 87#(and (= 0 ~z$flush_delayed~0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~x~0 1) (= ~z$r_buff0_thd0~0 0) (<= 1 ~__unbuffered_cnt~0) (= 2 ~z~0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 168#true, Black: 98#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (<= (+ ~z$r_buff1_thd3~0 ~z$r_buff0_thd2~0) (+ (* 256 (div ~z$r_buff1_thd3~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256))) (<= (+ ~z$r_buff0_thd3~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff0_thd3~0 256)))) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0)), 37#L781true, Black: 160#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 14#L794true, 100#true, 71#true, P0Thread1of1ForFork1InUse, Black: 112#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), 182#true, P2Thread1of1ForFork2InUse, Black: 110#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 108#(and (= ~__unbuffered_cnt~0 0) (= |#ghost~multithreaded| 1) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= (+ ~z$r_buff0_thd3~0 (* (div ~z$r_buff1_thd0~0 256) 256)) (+ ~z$r_buff1_thd0~0 (* 256 (div ~z$r_buff0_thd3~0 256)))) (= (+ (* 256 (div ~z$r_buff1_thd3~0 256)) ~z$read_delayed~0) (+ ~z$r_buff1_thd3~0 (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff1_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* 256 (div ~z$r_buff1_thd2~0 256)))) (= ~__unbuffered_p2_EAX~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 175#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), P1Thread1of1ForFork0InUse, Black: 174#(and (= ~__unbuffered_cnt~0 0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (<= (+ ~z$read_delayed~0 ~z$r_buff0_thd3~0) (+ (* 256 (div ~z$r_buff0_thd3~0 256)) (* 256 (div ~z$read_delayed~0 256)))) (<= (+ ~z$r_buff0_thd2~0 ~z$r_buff0_thd0~0) (+ (* 256 (div ~z$r_buff0_thd0~0 256)) (* (div ~z$r_buff0_thd2~0 256) 256)))), 12#L754true, Black: 56#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0)), 198#true, Black: 122#(and (= ~__unbuffered_cnt~0 0) (= (* 256 (div ~z$r_buff0_thd0~0 256)) ~z$r_buff0_thd0~0) (= 2 ~x~0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$w_buff0~0 2) (= ~z$read_delayed~0 (* 256 (div ~z$read_delayed~0 256))) (= (* 256 (div ~z$r_buff0_thd3~0 256)) ~z$r_buff0_thd3~0) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$mem_tmp~0 0) (= (* (div ~z$flush_delayed~0 256) 256) ~z$flush_delayed~0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0) (= (* (div ~z$r_buff0_thd2~0 256) 256) ~z$r_buff0_thd2~0)), Black: 61#(and (= ~__unbuffered_cnt~0 0) (= 0 ~z$flush_delayed~0) (= ~x~0 0) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff1~0 0) (= ~z$read_delayed_var~0.base 0) (= ~z$read_delayed~0 0) (= ~z$w_buff0~0 2) (= ~y~0 0) (= ~z$r_buff1_thd3~0 0) (= ~z$r_buff0_thd2~0 0) (= ~z$mem_tmp~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$read_delayed_var~0.offset 0) (= ~__unbuffered_p2_EAX~0 0) (= ~z$r_buff1_thd2~0 0) (= ~z$r_buff1_thd0~0 0))]) [2024-06-04 17:59:31,929 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,929 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,930 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:31,930 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2024-06-04 17:59:32,202 INFO L124 PetriNetUnfolderBase]: 1823/2742 cut-off events. [2024-06-04 17:59:32,203 INFO L125 PetriNetUnfolderBase]: For 27390/27479 co-relation queries the response was YES. [2024-06-04 17:59:32,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13556 conditions, 2742 events. 1823/2742 cut-off events. For 27390/27479 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12893 event pairs, 541 based on Foata normal form. 40/2718 useless extension candidates. Maximal degree in co-relation 13508. Up to 2524 conditions per place. [2024-06-04 17:59:32,216 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 91 selfloop transitions, 37 changer transitions 0/143 dead transitions. [2024-06-04 17:59:32,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 143 transitions, 1316 flow [2024-06-04 17:59:32,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 17:59:32,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 17:59:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-04 17:59:32,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4329268292682927 [2024-06-04 17:59:32,219 INFO L175 Difference]: Start difference. First operand has 96 places, 109 transitions, 943 flow. Second operand 8 states and 142 transitions. [2024-06-04 17:59:32,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 143 transitions, 1316 flow [2024-06-04 17:59:32,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 143 transitions, 1277 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-04 17:59:32,232 INFO L231 Difference]: Finished difference. Result has 100 places, 115 transitions, 1047 flow [2024-06-04 17:59:32,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1047, PETRI_PLACES=100, PETRI_TRANSITIONS=115} [2024-06-04 17:59:32,233 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 58 predicate places. [2024-06-04 17:59:32,233 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 115 transitions, 1047 flow [2024-06-04 17:59:32,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:32,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:32,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:32,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-04 17:59:32,234 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-04 17:59:32,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:32,234 INFO L85 PathProgramCache]: Analyzing trace with hash -560683501, now seen corresponding path program 1 times [2024-06-04 17:59:32,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:32,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407929031] [2024-06-04 17:59:32,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:32,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:38,158 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-04 17:59:38,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:38,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407929031] [2024-06-04 17:59:38,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407929031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:38,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:38,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:59:38,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329392810] [2024-06-04 17:59:38,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:38,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:59:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:38,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:59:38,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:59:38,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:38,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 115 transitions, 1047 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:38,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:38,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:38,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:39,094 INFO L124 PetriNetUnfolderBase]: 1890/2832 cut-off events. [2024-06-04 17:59:39,094 INFO L125 PetriNetUnfolderBase]: For 28065/28067 co-relation queries the response was YES. [2024-06-04 17:59:39,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14304 conditions, 2832 events. 1890/2832 cut-off events. For 28065/28067 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13141 event pairs, 567 based on Foata normal form. 4/2834 useless extension candidates. Maximal degree in co-relation 14254. Up to 2590 conditions per place. [2024-06-04 17:59:39,106 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 111 selfloop transitions, 36 changer transitions 0/150 dead transitions. [2024-06-04 17:59:39,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 150 transitions, 1538 flow [2024-06-04 17:59:39,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-06-04 17:59:39,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445993031358885 [2024-06-04 17:59:39,109 INFO L175 Difference]: Start difference. First operand has 100 places, 115 transitions, 1047 flow. Second operand 7 states and 128 transitions. [2024-06-04 17:59:39,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 150 transitions, 1538 flow [2024-06-04 17:59:39,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 150 transitions, 1456 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 17:59:39,126 INFO L231 Difference]: Finished difference. Result has 104 places, 121 transitions, 1142 flow [2024-06-04 17:59:39,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=967, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1142, PETRI_PLACES=104, PETRI_TRANSITIONS=121} [2024-06-04 17:59:39,127 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2024-06-04 17:59:39,127 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 121 transitions, 1142 flow [2024-06-04 17:59:39,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:39,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:39,127 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:39,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-04 17:59:39,127 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-04 17:59:39,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:39,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1451417421, now seen corresponding path program 2 times [2024-06-04 17:59:39,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:39,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137256919] [2024-06-04 17:59:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:39,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:44,644 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-04 17:59:44,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:44,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137256919] [2024-06-04 17:59:44,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137256919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:44,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:44,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:59:44,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858266763] [2024-06-04 17:59:44,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:44,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:59:44,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:44,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:59:44,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:59:44,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:44,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 121 transitions, 1142 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:44,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:44,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:44,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:45,579 INFO L124 PetriNetUnfolderBase]: 1912/2864 cut-off events. [2024-06-04 17:59:45,580 INFO L125 PetriNetUnfolderBase]: For 31685/31687 co-relation queries the response was YES. [2024-06-04 17:59:45,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14937 conditions, 2864 events. 1912/2864 cut-off events. For 31685/31687 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13345 event pairs, 574 based on Foata normal form. 4/2866 useless extension candidates. Maximal degree in co-relation 14884. Up to 2609 conditions per place. [2024-06-04 17:59:45,595 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 111 selfloop transitions, 36 changer transitions 0/150 dead transitions. [2024-06-04 17:59:45,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 150 transitions, 1606 flow [2024-06-04 17:59:45,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:45,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-04 17:59:45,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43205574912891986 [2024-06-04 17:59:45,598 INFO L175 Difference]: Start difference. First operand has 104 places, 121 transitions, 1142 flow. Second operand 7 states and 124 transitions. [2024-06-04 17:59:45,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 150 transitions, 1606 flow [2024-06-04 17:59:45,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 150 transitions, 1551 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-04 17:59:45,620 INFO L231 Difference]: Finished difference. Result has 108 places, 124 transitions, 1206 flow [2024-06-04 17:59:45,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1092, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1206, PETRI_PLACES=108, PETRI_TRANSITIONS=124} [2024-06-04 17:59:45,621 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2024-06-04 17:59:45,621 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 124 transitions, 1206 flow [2024-06-04 17:59:45,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:45,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:45,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:45,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-04 17:59:45,621 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-04 17:59:45,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2097695206, now seen corresponding path program 1 times [2024-06-04 17:59:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891859910] [2024-06-04 17:59:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:50,878 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-04 17:59:50,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:50,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891859910] [2024-06-04 17:59:50,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891859910] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:50,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:50,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 17:59:50,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778660710] [2024-06-04 17:59:50,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:50,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 17:59:50,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:50,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 17:59:50,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 17:59:51,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:51,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 124 transitions, 1206 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-04 17:59:51,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:51,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:51,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:51,894 INFO L124 PetriNetUnfolderBase]: 1907/2856 cut-off events. [2024-06-04 17:59:51,894 INFO L125 PetriNetUnfolderBase]: For 34801/34801 co-relation queries the response was YES. [2024-06-04 17:59:51,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15110 conditions, 2856 events. 1907/2856 cut-off events. For 34801/34801 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13239 event pairs, 594 based on Foata normal form. 2/2856 useless extension candidates. Maximal degree in co-relation 15056. Up to 2789 conditions per place. [2024-06-04 17:59:51,916 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 123 selfloop transitions, 20 changer transitions 0/146 dead transitions. [2024-06-04 17:59:51,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 146 transitions, 1568 flow [2024-06-04 17:59:51,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-04 17:59:51,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 17:59:51,920 INFO L175 Difference]: Start difference. First operand has 108 places, 124 transitions, 1206 flow. Second operand 7 states and 112 transitions. [2024-06-04 17:59:51,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 146 transitions, 1568 flow [2024-06-04 17:59:51,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 146 transitions, 1506 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-04 17:59:51,952 INFO L231 Difference]: Finished difference. Result has 111 places, 127 transitions, 1228 flow [2024-06-04 17:59:51,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1144, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1228, PETRI_PLACES=111, PETRI_TRANSITIONS=127} [2024-06-04 17:59:51,952 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 69 predicate places. [2024-06-04 17:59:51,952 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 127 transitions, 1228 flow [2024-06-04 17:59:51,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 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-04 17:59:51,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:51,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:51,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-04 17:59:51,954 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-04 17:59:51,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash 642783553, now seen corresponding path program 3 times [2024-06-04 17:59:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422179348] [2024-06-04 17:59:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 17:59:57,904 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-04 17:59:57,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 17:59:57,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422179348] [2024-06-04 17:59:57,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422179348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 17:59:57,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 17:59:57,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 17:59:57,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60814] [2024-06-04 17:59:57,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 17:59:57,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 17:59:57,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 17:59:57,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 17:59:57,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 17:59:57,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 17:59:57,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 127 transitions, 1228 flow. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:57,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 17:59:57,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 17:59:57,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 17:59:58,847 INFO L124 PetriNetUnfolderBase]: 1897/2843 cut-off events. [2024-06-04 17:59:58,847 INFO L125 PetriNetUnfolderBase]: For 38256/38258 co-relation queries the response was YES. [2024-06-04 17:59:58,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15360 conditions, 2843 events. 1897/2843 cut-off events. For 38256/38258 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13210 event pairs, 596 based on Foata normal form. 6/2847 useless extension candidates. Maximal degree in co-relation 15305. Up to 2770 conditions per place. [2024-06-04 17:59:58,860 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 128 selfloop transitions, 17 changer transitions 0/148 dead transitions. [2024-06-04 17:59:58,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 148 transitions, 1582 flow [2024-06-04 17:59:58,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 17:59:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 17:59:58,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2024-06-04 17:59:58,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39372822299651566 [2024-06-04 17:59:58,862 INFO L175 Difference]: Start difference. First operand has 111 places, 127 transitions, 1228 flow. Second operand 7 states and 113 transitions. [2024-06-04 17:59:58,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 148 transitions, 1582 flow [2024-06-04 17:59:58,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 148 transitions, 1526 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-04 17:59:58,885 INFO L231 Difference]: Finished difference. Result has 113 places, 128 transitions, 1226 flow [2024-06-04 17:59:58,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1174, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1226, PETRI_PLACES=113, PETRI_TRANSITIONS=128} [2024-06-04 17:59:58,886 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-04 17:59:58,886 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 128 transitions, 1226 flow [2024-06-04 17:59:58,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 17:59:58,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 17:59:58,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 17:59:58,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-04 17:59:58,886 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 17:59:58,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 17:59:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash -962710473, now seen corresponding path program 1 times [2024-06-04 17:59:58,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 17:59:58,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126448313] [2024-06-04 17:59:58,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 17:59:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 17:59:58,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:07,946 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-04 18:00:07,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:07,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126448313] [2024-06-04 18:00:07,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126448313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:07,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:07,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-04 18:00:07,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567520336] [2024-06-04 18:00:07,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:07,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-04 18:00:07,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:07,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-04 18:00:07,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-06-04 18:00:08,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:00:08,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 128 transitions, 1226 flow. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-04 18:00:08,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:08,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:00:08,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:08,953 INFO L124 PetriNetUnfolderBase]: 1891/2834 cut-off events. [2024-06-04 18:00:08,953 INFO L125 PetriNetUnfolderBase]: For 40977/40977 co-relation queries the response was YES. [2024-06-04 18:00:08,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15472 conditions, 2834 events. 1891/2834 cut-off events. For 40977/40977 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 13116 event pairs, 596 based on Foata normal form. 2/2834 useless extension candidates. Maximal degree in co-relation 15416. Up to 2812 conditions per place. [2024-06-04 18:00:08,969 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 125 selfloop transitions, 11 changer transitions 0/139 dead transitions. [2024-06-04 18:00:08,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 139 transitions, 1547 flow [2024-06-04 18:00:08,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-04 18:00:08,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-04 18:00:08,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-04 18:00:08,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 18:00:08,970 INFO L175 Difference]: Start difference. First operand has 113 places, 128 transitions, 1226 flow. Second operand 5 states and 80 transitions. [2024-06-04 18:00:08,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 139 transitions, 1547 flow [2024-06-04 18:00:08,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 139 transitions, 1513 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-04 18:00:08,998 INFO L231 Difference]: Finished difference. Result has 113 places, 131 transitions, 1255 flow [2024-06-04 18:00:08,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1192, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1255, PETRI_PLACES=113, PETRI_TRANSITIONS=131} [2024-06-04 18:00:08,998 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 71 predicate places. [2024-06-04 18:00:08,998 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 131 transitions, 1255 flow [2024-06-04 18:00:08,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-04 18:00:08,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:08,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:08,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-04 18:00:08,999 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-04 18:00:09,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:09,000 INFO L85 PathProgramCache]: Analyzing trace with hash -319470718, now seen corresponding path program 1 times [2024-06-04 18:00:09,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:09,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285223600] [2024-06-04 18:00:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:09,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:16,355 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-04 18:00:16,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:16,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285223600] [2024-06-04 18:00:16,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285223600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:16,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:16,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:00:16,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237131581] [2024-06-04 18:00:16,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:16,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:00:16,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:16,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:00:16,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:00:16,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:00:16,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 131 transitions, 1255 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:16,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:16,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:00:16,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:17,571 INFO L124 PetriNetUnfolderBase]: 1857/2800 cut-off events. [2024-06-04 18:00:17,572 INFO L125 PetriNetUnfolderBase]: For 50247/50333 co-relation queries the response was YES. [2024-06-04 18:00:17,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15885 conditions, 2800 events. 1857/2800 cut-off events. For 50247/50333 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 13219 event pairs, 406 based on Foata normal form. 26/2766 useless extension candidates. Maximal degree in co-relation 15828. Up to 2466 conditions per place. [2024-06-04 18:00:17,595 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 111 selfloop transitions, 38 changer transitions 0/169 dead transitions. [2024-06-04 18:00:17,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 169 transitions, 1771 flow [2024-06-04 18:00:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:17,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 18:00:17,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 18:00:17,598 INFO L175 Difference]: Start difference. First operand has 113 places, 131 transitions, 1255 flow. Second operand 8 states and 144 transitions. [2024-06-04 18:00:17,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 169 transitions, 1771 flow [2024-06-04 18:00:17,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 169 transitions, 1737 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-04 18:00:17,639 INFO L231 Difference]: Finished difference. Result has 119 places, 137 transitions, 1379 flow [2024-06-04 18:00:17,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1379, PETRI_PLACES=119, PETRI_TRANSITIONS=137} [2024-06-04 18:00:17,640 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 77 predicate places. [2024-06-04 18:00:17,640 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 137 transitions, 1379 flow [2024-06-04 18:00:17,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:17,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:17,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:17,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-04 18:00:17,641 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:00:17,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash -319410268, now seen corresponding path program 2 times [2024-06-04 18:00:17,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:17,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50420] [2024-06-04 18:00:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:17,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:25,114 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-04 18:00:25,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:25,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50420] [2024-06-04 18:00:25,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:25,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:25,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:00:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313448410] [2024-06-04 18:00:25,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:25,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:00:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:25,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:00:25,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:00:25,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:00:25,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 137 transitions, 1379 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:25,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:25,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:00:25,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:26,275 INFO L124 PetriNetUnfolderBase]: 1870/2824 cut-off events. [2024-06-04 18:00:26,276 INFO L125 PetriNetUnfolderBase]: For 55700/55787 co-relation queries the response was YES. [2024-06-04 18:00:26,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16606 conditions, 2824 events. 1870/2824 cut-off events. For 55700/55787 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13417 event pairs, 514 based on Foata normal form. 40/2803 useless extension candidates. Maximal degree in co-relation 16547. Up to 2572 conditions per place. [2024-06-04 18:00:26,295 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 114 selfloop transitions, 37 changer transitions 0/171 dead transitions. [2024-06-04 18:00:26,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 171 transitions, 1808 flow [2024-06-04 18:00:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:26,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 18:00:26,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 18:00:26,298 INFO L175 Difference]: Start difference. First operand has 119 places, 137 transitions, 1379 flow. Second operand 8 states and 141 transitions. [2024-06-04 18:00:26,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 171 transitions, 1808 flow [2024-06-04 18:00:26,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 171 transitions, 1730 flow, removed 17 selfloop flow, removed 4 redundant places. [2024-06-04 18:00:26,334 INFO L231 Difference]: Finished difference. Result has 123 places, 142 transitions, 1435 flow [2024-06-04 18:00:26,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1435, PETRI_PLACES=123, PETRI_TRANSITIONS=142} [2024-06-04 18:00:26,334 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 81 predicate places. [2024-06-04 18:00:26,334 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 142 transitions, 1435 flow [2024-06-04 18:00:26,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:26,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:26,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:26,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-04 18:00:26,335 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-04 18:00:26,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:26,335 INFO L85 PathProgramCache]: Analyzing trace with hash -319410144, now seen corresponding path program 1 times [2024-06-04 18:00:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:26,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413793762] [2024-06-04 18:00:26,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:33,109 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-04 18:00:33,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:33,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413793762] [2024-06-04 18:00:33,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413793762] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:33,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:33,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:00:33,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502550808] [2024-06-04 18:00:33,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:33,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:00:33,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:33,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:00:33,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:00:33,189 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:00:33,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 142 transitions, 1435 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:33,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:33,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:00:33,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:34,206 INFO L124 PetriNetUnfolderBase]: 1995/2991 cut-off events. [2024-06-04 18:00:34,206 INFO L125 PetriNetUnfolderBase]: For 55614/55616 co-relation queries the response was YES. [2024-06-04 18:00:34,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17280 conditions, 2991 events. 1995/2991 cut-off events. For 55614/55616 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14036 event pairs, 509 based on Foata normal form. 4/2993 useless extension candidates. Maximal degree in co-relation 17219. Up to 2613 conditions per place. [2024-06-04 18:00:34,227 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 145 selfloop transitions, 50 changer transitions 0/198 dead transitions. [2024-06-04 18:00:34,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 198 transitions, 2146 flow [2024-06-04 18:00:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:00:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:00:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-04 18:00:34,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4219512195121951 [2024-06-04 18:00:34,230 INFO L175 Difference]: Start difference. First operand has 123 places, 142 transitions, 1435 flow. Second operand 10 states and 173 transitions. [2024-06-04 18:00:34,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 198 transitions, 2146 flow [2024-06-04 18:00:34,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 198 transitions, 2071 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-04 18:00:34,267 INFO L231 Difference]: Finished difference. Result has 131 places, 155 transitions, 1618 flow [2024-06-04 18:00:34,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1618, PETRI_PLACES=131, PETRI_TRANSITIONS=155} [2024-06-04 18:00:34,267 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 89 predicate places. [2024-06-04 18:00:34,267 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 155 transitions, 1618 flow [2024-06-04 18:00:34,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:34,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:34,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:34,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-04 18:00:34,268 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-04 18:00:34,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:34,269 INFO L85 PathProgramCache]: Analyzing trace with hash -316613758, now seen corresponding path program 3 times [2024-06-04 18:00:34,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:34,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901546259] [2024-06-04 18:00:34,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:34,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:41,311 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-04 18:00:41,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:41,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901546259] [2024-06-04 18:00:41,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901546259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:41,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:41,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:00:41,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122807313] [2024-06-04 18:00:41,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:41,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:00:41,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:41,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:00:41,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:00:41,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 41 [2024-06-04 18:00:41,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 155 transitions, 1618 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:41,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:41,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 41 [2024-06-04 18:00:41,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:42,499 INFO L124 PetriNetUnfolderBase]: 1924/2899 cut-off events. [2024-06-04 18:00:42,500 INFO L125 PetriNetUnfolderBase]: For 66048/66117 co-relation queries the response was YES. [2024-06-04 18:00:42,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17789 conditions, 2899 events. 1924/2899 cut-off events. For 66048/66117 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13796 event pairs, 504 based on Foata normal form. 8/2846 useless extension candidates. Maximal degree in co-relation 17725. Up to 2669 conditions per place. [2024-06-04 18:00:42,524 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 120 selfloop transitions, 38 changer transitions 0/181 dead transitions. [2024-06-04 18:00:42,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 181 transitions, 2002 flow [2024-06-04 18:00:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:42,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2024-06-04 18:00:42,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2024-06-04 18:00:42,526 INFO L175 Difference]: Start difference. First operand has 131 places, 155 transitions, 1618 flow. Second operand 8 states and 138 transitions. [2024-06-04 18:00:42,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 181 transitions, 2002 flow [2024-06-04 18:00:42,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 181 transitions, 1909 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-04 18:00:42,585 INFO L231 Difference]: Finished difference. Result has 134 places, 155 transitions, 1609 flow [2024-06-04 18:00:42,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1609, PETRI_PLACES=134, PETRI_TRANSITIONS=155} [2024-06-04 18:00:42,586 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 92 predicate places. [2024-06-04 18:00:42,586 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 155 transitions, 1609 flow [2024-06-04 18:00:42,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:42,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:42,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:42,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-04 18:00:42,587 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-04 18:00:42,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1702575436, now seen corresponding path program 2 times [2024-06-04 18:00:42,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:42,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386999335] [2024-06-04 18:00:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:42,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:49,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:00:49,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:49,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386999335] [2024-06-04 18:00:49,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386999335] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:49,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:49,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:00:49,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409214292] [2024-06-04 18:00:49,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:49,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:00:49,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:49,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:00:49,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:00:50,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:00:50,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 155 transitions, 1609 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:50,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:50,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:00:50,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:51,196 INFO L124 PetriNetUnfolderBase]: 2004/3004 cut-off events. [2024-06-04 18:00:51,197 INFO L125 PetriNetUnfolderBase]: For 64061/64063 co-relation queries the response was YES. [2024-06-04 18:00:51,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18103 conditions, 3004 events. 2004/3004 cut-off events. For 64061/64063 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14071 event pairs, 505 based on Foata normal form. 4/3006 useless extension candidates. Maximal degree in co-relation 18037. Up to 2622 conditions per place. [2024-06-04 18:00:51,218 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 142 selfloop transitions, 59 changer transitions 0/204 dead transitions. [2024-06-04 18:00:51,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 204 transitions, 2397 flow [2024-06-04 18:00:51,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 151 transitions. [2024-06-04 18:00:51,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603658536585366 [2024-06-04 18:00:51,221 INFO L175 Difference]: Start difference. First operand has 134 places, 155 transitions, 1609 flow. Second operand 8 states and 151 transitions. [2024-06-04 18:00:51,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 204 transitions, 2397 flow [2024-06-04 18:00:51,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 204 transitions, 2294 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-04 18:00:51,280 INFO L231 Difference]: Finished difference. Result has 137 places, 165 transitions, 1774 flow [2024-06-04 18:00:51,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1774, PETRI_PLACES=137, PETRI_TRANSITIONS=165} [2024-06-04 18:00:51,281 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 95 predicate places. [2024-06-04 18:00:51,281 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 165 transitions, 1774 flow [2024-06-04 18:00:51,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:00:51,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:51,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:51,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-04 18:00:51,283 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-04 18:00:51,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash -201137890, now seen corresponding path program 1 times [2024-06-04 18:00:51,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:51,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153624165] [2024-06-04 18:00:51,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:00:58,661 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-04 18:00:58,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:00:58,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153624165] [2024-06-04 18:00:58,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153624165] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:00:58,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:00:58,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:00:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261511746] [2024-06-04 18:00:58,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:00:58,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:00:58,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:00:58,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:00:58,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:00:58,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:00:58,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 165 transitions, 1774 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-04 18:00:58,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:00:58,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:00:58,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:00:59,825 INFO L124 PetriNetUnfolderBase]: 2038/3058 cut-off events. [2024-06-04 18:00:59,825 INFO L125 PetriNetUnfolderBase]: For 72363/72365 co-relation queries the response was YES. [2024-06-04 18:00:59,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19258 conditions, 3058 events. 2038/3058 cut-off events. For 72363/72365 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 14445 event pairs, 500 based on Foata normal form. 8/3064 useless extension candidates. Maximal degree in co-relation 19189. Up to 2773 conditions per place. [2024-06-04 18:00:59,844 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 153 selfloop transitions, 40 changer transitions 0/196 dead transitions. [2024-06-04 18:00:59,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 196 transitions, 2274 flow [2024-06-04 18:00:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:00:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:00:59,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-04 18:00:59,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176829268292683 [2024-06-04 18:00:59,846 INFO L175 Difference]: Start difference. First operand has 137 places, 165 transitions, 1774 flow. Second operand 8 states and 137 transitions. [2024-06-04 18:00:59,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 196 transitions, 2274 flow [2024-06-04 18:00:59,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 196 transitions, 2200 flow, removed 12 selfloop flow, removed 4 redundant places. [2024-06-04 18:00:59,902 INFO L231 Difference]: Finished difference. Result has 141 places, 168 transitions, 1832 flow [2024-06-04 18:00:59,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1702, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1832, PETRI_PLACES=141, PETRI_TRANSITIONS=168} [2024-06-04 18:00:59,903 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 99 predicate places. [2024-06-04 18:00:59,903 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 168 transitions, 1832 flow [2024-06-04 18:00:59,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-04 18:00:59,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:00:59,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:00:59,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-04 18:00:59,903 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-04 18:00:59,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:00:59,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2044268624, now seen corresponding path program 3 times [2024-06-04 18:00:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:00:59,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406061816] [2024-06-04 18:00:59,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:00:59,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:00:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:05,737 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-04 18:01:05,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:05,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406061816] [2024-06-04 18:01:05,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406061816] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:05,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:05,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:01:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796106717] [2024-06-04 18:01:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:05,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:01:05,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:05,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:01:05,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:01:05,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:01:05,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 168 transitions, 1832 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:05,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:05,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:01:05,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:06,806 INFO L124 PetriNetUnfolderBase]: 2060/3090 cut-off events. [2024-06-04 18:01:06,806 INFO L125 PetriNetUnfolderBase]: For 76714/76716 co-relation queries the response was YES. [2024-06-04 18:01:06,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19949 conditions, 3090 events. 2060/3090 cut-off events. For 76714/76716 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14572 event pairs, 506 based on Foata normal form. 4/3092 useless extension candidates. Maximal degree in co-relation 19879. Up to 2789 conditions per place. [2024-06-04 18:01:06,831 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 152 selfloop transitions, 47 changer transitions 0/202 dead transitions. [2024-06-04 18:01:06,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 202 transitions, 2450 flow [2024-06-04 18:01:06,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:01:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:01:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-04 18:01:06,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-04 18:01:06,835 INFO L175 Difference]: Start difference. First operand has 141 places, 168 transitions, 1832 flow. Second operand 8 states and 140 transitions. [2024-06-04 18:01:06,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 202 transitions, 2450 flow [2024-06-04 18:01:06,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 202 transitions, 2344 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-04 18:01:06,911 INFO L231 Difference]: Finished difference. Result has 143 places, 171 transitions, 1870 flow [2024-06-04 18:01:06,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1726, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1870, PETRI_PLACES=143, PETRI_TRANSITIONS=171} [2024-06-04 18:01:06,912 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 101 predicate places. [2024-06-04 18:01:06,912 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 171 transitions, 1870 flow [2024-06-04 18:01:06,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:06,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:06,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:06,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-04 18:01:06,913 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:01:06,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:06,913 INFO L85 PathProgramCache]: Analyzing trace with hash -201317814, now seen corresponding path program 4 times [2024-06-04 18:01:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:06,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334469019] [2024-06-04 18:01:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:13,727 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-04 18:01:13,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:13,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334469019] [2024-06-04 18:01:13,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334469019] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:13,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:13,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:01:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331795040] [2024-06-04 18:01:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:13,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:01:13,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:13,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:01:13,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:01:13,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:01:13,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 171 transitions, 1870 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:13,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:13,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:01:13,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:14,875 INFO L124 PetriNetUnfolderBase]: 2082/3122 cut-off events. [2024-06-04 18:01:14,875 INFO L125 PetriNetUnfolderBase]: For 81875/81877 co-relation queries the response was YES. [2024-06-04 18:01:14,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20307 conditions, 3122 events. 2082/3122 cut-off events. For 81875/81877 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14759 event pairs, 501 based on Foata normal form. 4/3124 useless extension candidates. Maximal degree in co-relation 20236. Up to 2821 conditions per place. [2024-06-04 18:01:14,896 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 154 selfloop transitions, 51 changer transitions 0/208 dead transitions. [2024-06-04 18:01:14,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 208 transitions, 2520 flow [2024-06-04 18:01:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:01:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:01:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 18:01:14,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 18:01:14,900 INFO L175 Difference]: Start difference. First operand has 143 places, 171 transitions, 1870 flow. Second operand 8 states and 144 transitions. [2024-06-04 18:01:14,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 208 transitions, 2520 flow [2024-06-04 18:01:14,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 208 transitions, 2442 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 18:01:14,974 INFO L231 Difference]: Finished difference. Result has 146 places, 174 transitions, 1950 flow [2024-06-04 18:01:14,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1792, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1950, PETRI_PLACES=146, PETRI_TRANSITIONS=174} [2024-06-04 18:01:14,974 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 104 predicate places. [2024-06-04 18:01:14,975 INFO L495 AbstractCegarLoop]: Abstraction has has 146 places, 174 transitions, 1950 flow [2024-06-04 18:01:14,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:14,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:14,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:14,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-04 18:01:14,975 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-04 18:01:14,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:14,976 INFO L85 PathProgramCache]: Analyzing trace with hash -530831184, now seen corresponding path program 2 times [2024-06-04 18:01:14,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:14,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361841245] [2024-06-04 18:01:14,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:14,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:21,671 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-04 18:01:21,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:21,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361841245] [2024-06-04 18:01:21,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361841245] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:21,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:21,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:01:21,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498951077] [2024-06-04 18:01:21,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:21,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:01:21,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:21,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:01:21,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:01:21,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:01:21,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 174 transitions, 1950 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:21,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:21,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:01:21,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:22,897 INFO L124 PetriNetUnfolderBase]: 2099/3148 cut-off events. [2024-06-04 18:01:22,898 INFO L125 PetriNetUnfolderBase]: For 88052/88052 co-relation queries the response was YES. [2024-06-04 18:01:22,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20731 conditions, 3148 events. 2099/3148 cut-off events. For 88052/88052 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14918 event pairs, 543 based on Foata normal form. 4/3150 useless extension candidates. Maximal degree in co-relation 20659. Up to 3054 conditions per place. [2024-06-04 18:01:22,923 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 176 selfloop transitions, 22 changer transitions 0/201 dead transitions. [2024-06-04 18:01:22,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 201 transitions, 2442 flow [2024-06-04 18:01:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:01:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:01:22,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-04 18:01:22,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 18:01:22,926 INFO L175 Difference]: Start difference. First operand has 146 places, 174 transitions, 1950 flow. Second operand 8 states and 128 transitions. [2024-06-04 18:01:22,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 201 transitions, 2442 flow [2024-06-04 18:01:23,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 201 transitions, 2324 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-06-04 18:01:23,005 INFO L231 Difference]: Finished difference. Result has 148 places, 176 transitions, 1917 flow [2024-06-04 18:01:23,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1832, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1917, PETRI_PLACES=148, PETRI_TRANSITIONS=176} [2024-06-04 18:01:23,010 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 106 predicate places. [2024-06-04 18:01:23,010 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 176 transitions, 1917 flow [2024-06-04 18:01:23,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:23,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:23,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:23,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-04 18:01:23,011 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-04 18:01:23,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash 408898482, now seen corresponding path program 3 times [2024-06-04 18:01:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:23,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819442052] [2024-06-04 18:01:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:23,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:30,180 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-04 18:01:30,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:30,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819442052] [2024-06-04 18:01:30,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819442052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:30,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:30,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:01:30,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17839789] [2024-06-04 18:01:30,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:30,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:01:30,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:30,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:01:30,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:01:30,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:01:30,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 176 transitions, 1917 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:30,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:30,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:01:30,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:31,428 INFO L124 PetriNetUnfolderBase]: 2116/3175 cut-off events. [2024-06-04 18:01:31,428 INFO L125 PetriNetUnfolderBase]: For 94378/94378 co-relation queries the response was YES. [2024-06-04 18:01:31,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21040 conditions, 3175 events. 2116/3175 cut-off events. For 94378/94378 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15021 event pairs, 543 based on Foata normal form. 4/3177 useless extension candidates. Maximal degree in co-relation 20967. Up to 3108 conditions per place. [2024-06-04 18:01:31,454 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 182 selfloop transitions, 17 changer transitions 0/202 dead transitions. [2024-06-04 18:01:31,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 202 transitions, 2411 flow [2024-06-04 18:01:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:01:31,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:01:31,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 18:01:31,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-04 18:01:31,458 INFO L175 Difference]: Start difference. First operand has 148 places, 176 transitions, 1917 flow. Second operand 8 states and 125 transitions. [2024-06-04 18:01:31,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 202 transitions, 2411 flow [2024-06-04 18:01:31,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 202 transitions, 2344 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 18:01:31,540 INFO L231 Difference]: Finished difference. Result has 150 places, 178 transitions, 1929 flow [2024-06-04 18:01:31,540 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1929, PETRI_PLACES=150, PETRI_TRANSITIONS=178} [2024-06-04 18:01:31,543 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 108 predicate places. [2024-06-04 18:01:31,543 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 178 transitions, 1929 flow [2024-06-04 18:01:31,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:31,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:31,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:31,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-04 18:01:31,544 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-04 18:01:31,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:31,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1548544804, now seen corresponding path program 5 times [2024-06-04 18:01:31,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:31,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064193959] [2024-06-04 18:01:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:38,520 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-04 18:01:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064193959] [2024-06-04 18:01:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064193959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:01:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3289514] [2024-06-04 18:01:38,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:38,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:01:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:01:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:01:38,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:01:38,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 178 transitions, 1929 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:38,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:38,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:01:38,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:39,839 INFO L124 PetriNetUnfolderBase]: 2104/3160 cut-off events. [2024-06-04 18:01:39,839 INFO L125 PetriNetUnfolderBase]: For 99040/99042 co-relation queries the response was YES. [2024-06-04 18:01:39,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21024 conditions, 3160 events. 2104/3160 cut-off events. For 99040/99042 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 14961 event pairs, 538 based on Foata normal form. 8/3166 useless extension candidates. Maximal degree in co-relation 20950. Up to 3024 conditions per place. [2024-06-04 18:01:39,864 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 172 selfloop transitions, 31 changer transitions 0/206 dead transitions. [2024-06-04 18:01:39,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 206 transitions, 2537 flow [2024-06-04 18:01:39,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:01:39,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:01:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-04 18:01:39,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-04 18:01:39,880 INFO L175 Difference]: Start difference. First operand has 150 places, 178 transitions, 1929 flow. Second operand 8 states and 131 transitions. [2024-06-04 18:01:39,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 206 transitions, 2537 flow [2024-06-04 18:01:39,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 206 transitions, 2452 flow, removed 27 selfloop flow, removed 6 redundant places. [2024-06-04 18:01:39,998 INFO L231 Difference]: Finished difference. Result has 152 places, 179 transitions, 1936 flow [2024-06-04 18:01:39,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1936, PETRI_PLACES=152, PETRI_TRANSITIONS=179} [2024-06-04 18:01:39,999 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-04 18:01:39,999 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 179 transitions, 1936 flow [2024-06-04 18:01:39,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:39,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:39,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:40,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-04 18:01:40,000 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:01:40,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash -604040444, now seen corresponding path program 1 times [2024-06-04 18:01:40,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:40,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810553391] [2024-06-04 18:01:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:46,467 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-04 18:01:46,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:46,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810553391] [2024-06-04 18:01:46,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810553391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:46,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:46,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:01:46,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261097745] [2024-06-04 18:01:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:46,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:01:46,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:46,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:01:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:01:46,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:01:46,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 179 transitions, 1936 flow. Second operand has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:46,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:46,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:01:46,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:47,644 INFO L124 PetriNetUnfolderBase]: 2096/3148 cut-off events. [2024-06-04 18:01:47,644 INFO L125 PetriNetUnfolderBase]: For 101851/101853 co-relation queries the response was YES. [2024-06-04 18:01:47,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21026 conditions, 3148 events. 2096/3148 cut-off events. For 101851/101853 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 14914 event pairs, 543 based on Foata normal form. 4/3150 useless extension candidates. Maximal degree in co-relation 20951. Up to 3048 conditions per place. [2024-06-04 18:01:47,671 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 171 selfloop transitions, 25 changer transitions 0/199 dead transitions. [2024-06-04 18:01:47,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 199 transitions, 2382 flow [2024-06-04 18:01:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:01:47,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:01:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 18:01:47,673 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-04 18:01:47,673 INFO L175 Difference]: Start difference. First operand has 152 places, 179 transitions, 1936 flow. Second operand 7 states and 114 transitions. [2024-06-04 18:01:47,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 199 transitions, 2382 flow [2024-06-04 18:01:47,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 199 transitions, 2264 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 18:01:47,763 INFO L231 Difference]: Finished difference. Result has 152 places, 179 transitions, 1880 flow [2024-06-04 18:01:47,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1880, PETRI_PLACES=152, PETRI_TRANSITIONS=179} [2024-06-04 18:01:47,764 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 110 predicate places. [2024-06-04 18:01:47,764 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 179 transitions, 1880 flow [2024-06-04 18:01:47,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.555555555555555) internal successors, (77), 9 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:01:47,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:47,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:47,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-04 18:01:47,764 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:01:47,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:47,765 INFO L85 PathProgramCache]: Analyzing trace with hash -603743526, now seen corresponding path program 4 times [2024-06-04 18:01:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:47,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10558559] [2024-06-04 18:01:47,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:47,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:01:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:01:54,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:01:54,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10558559] [2024-06-04 18:01:54,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10558559] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:01:54,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:01:54,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:01:54,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634756030] [2024-06-04 18:01:54,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:01:54,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:01:54,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:01:54,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:01:54,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:01:54,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:01:54,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 179 transitions, 1880 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-04 18:01:54,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:01:54,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:01:54,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:01:55,916 INFO L124 PetriNetUnfolderBase]: 2113/3174 cut-off events. [2024-06-04 18:01:55,916 INFO L125 PetriNetUnfolderBase]: For 108575/108575 co-relation queries the response was YES. [2024-06-04 18:01:55,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21279 conditions, 3174 events. 2113/3174 cut-off events. For 108575/108575 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 15029 event pairs, 529 based on Foata normal form. 4/3176 useless extension candidates. Maximal degree in co-relation 21203. Up to 3093 conditions per place. [2024-06-04 18:01:55,943 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 184 selfloop transitions, 18 changer transitions 0/205 dead transitions. [2024-06-04 18:01:55,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 205 transitions, 2382 flow [2024-06-04 18:01:55,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:01:55,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:01:55,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 125 transitions. [2024-06-04 18:01:55,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38109756097560976 [2024-06-04 18:01:55,945 INFO L175 Difference]: Start difference. First operand has 152 places, 179 transitions, 1880 flow. Second operand 8 states and 125 transitions. [2024-06-04 18:01:55,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 205 transitions, 2382 flow [2024-06-04 18:01:56,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 205 transitions, 2332 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-04 18:01:56,039 INFO L231 Difference]: Finished difference. Result has 154 places, 181 transitions, 1915 flow [2024-06-04 18:01:56,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1830, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1915, PETRI_PLACES=154, PETRI_TRANSITIONS=181} [2024-06-04 18:01:56,040 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 112 predicate places. [2024-06-04 18:01:56,040 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 181 transitions, 1915 flow [2024-06-04 18:01:56,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-04 18:01:56,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:01:56,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:01:56,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-04 18:01:56,041 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-04 18:01:56,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:01:56,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1540263650, now seen corresponding path program 5 times [2024-06-04 18:01:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:01:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357444826] [2024-06-04 18:01:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:01:56,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:01:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:02,507 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-04 18:02:02,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:02,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357444826] [2024-06-04 18:02:02,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357444826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:02,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:02,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:02:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838309415] [2024-06-04 18:02:02,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:02,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:02:02,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:02,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:02:02,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:02:02,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:02,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 181 transitions, 1915 flow. Second operand has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-04 18:02:02,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:02,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:02,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:03,673 INFO L124 PetriNetUnfolderBase]: 2105/3162 cut-off events. [2024-06-04 18:02:03,674 INFO L125 PetriNetUnfolderBase]: For 113832/113832 co-relation queries the response was YES. [2024-06-04 18:02:03,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21401 conditions, 3162 events. 2105/3162 cut-off events. For 113832/113832 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14958 event pairs, 542 based on Foata normal form. 4/3164 useless extension candidates. Maximal degree in co-relation 21324. Up to 3059 conditions per place. [2024-06-04 18:02:03,703 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 180 selfloop transitions, 24 changer transitions 0/207 dead transitions. [2024-06-04 18:02:03,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 207 transitions, 2427 flow [2024-06-04 18:02:03,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:02:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:02:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-04 18:02:03,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-04 18:02:03,706 INFO L175 Difference]: Start difference. First operand has 154 places, 181 transitions, 1915 flow. Second operand 8 states and 126 transitions. [2024-06-04 18:02:03,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 207 transitions, 2427 flow [2024-06-04 18:02:03,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 207 transitions, 2360 flow, removed 17 selfloop flow, removed 6 redundant places. [2024-06-04 18:02:03,809 INFO L231 Difference]: Finished difference. Result has 156 places, 183 transitions, 1952 flow [2024-06-04 18:02:03,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1952, PETRI_PLACES=156, PETRI_TRANSITIONS=183} [2024-06-04 18:02:03,810 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 114 predicate places. [2024-06-04 18:02:03,810 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 183 transitions, 1952 flow [2024-06-04 18:02:03,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.4) internal successors, (84), 10 states have internal predecessors, (84), 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-04 18:02:03,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:03,810 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:03,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-04 18:02:03,810 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:02:03,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1313655978, now seen corresponding path program 1 times [2024-06-04 18:02:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:03,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640252005] [2024-06-04 18:02:03,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:11,104 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-04 18:02:11,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:11,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640252005] [2024-06-04 18:02:11,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640252005] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:11,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:11,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:02:11,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342424007] [2024-06-04 18:02:11,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:11,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:02:11,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:11,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:02:11,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:02:11,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:11,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 183 transitions, 1952 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:11,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:11,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:11,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:12,495 INFO L124 PetriNetUnfolderBase]: 2249/3403 cut-off events. [2024-06-04 18:02:12,496 INFO L125 PetriNetUnfolderBase]: For 136776/136778 co-relation queries the response was YES. [2024-06-04 18:02:12,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23288 conditions, 3403 events. 2249/3403 cut-off events. For 136776/136778 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 16519 event pairs, 343 based on Foata normal form. 16/3417 useless extension candidates. Maximal degree in co-relation 23210. Up to 2537 conditions per place. [2024-06-04 18:02:12,525 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 177 selfloop transitions, 57 changer transitions 0/237 dead transitions. [2024-06-04 18:02:12,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 237 transitions, 2800 flow [2024-06-04 18:02:12,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:02:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:02:12,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 162 transitions. [2024-06-04 18:02:12,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 18:02:12,528 INFO L175 Difference]: Start difference. First operand has 156 places, 183 transitions, 1952 flow. Second operand 9 states and 162 transitions. [2024-06-04 18:02:12,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 237 transitions, 2800 flow [2024-06-04 18:02:12,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 237 transitions, 2706 flow, removed 26 selfloop flow, removed 6 redundant places. [2024-06-04 18:02:12,636 INFO L231 Difference]: Finished difference. Result has 161 places, 188 transitions, 2085 flow [2024-06-04 18:02:12,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1868, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2085, PETRI_PLACES=161, PETRI_TRANSITIONS=188} [2024-06-04 18:02:12,637 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 119 predicate places. [2024-06-04 18:02:12,637 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 188 transitions, 2085 flow [2024-06-04 18:02:12,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:12,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:12,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:12,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-04 18:02:12,638 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:02:12,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash -423441566, now seen corresponding path program 2 times [2024-06-04 18:02:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:12,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942486927] [2024-06-04 18:02:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:20,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-04 18:02:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:20,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942486927] [2024-06-04 18:02:20,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942486927] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:20,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:20,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:02:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432201809] [2024-06-04 18:02:20,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:20,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:02:20,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:20,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:02:20,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:02:20,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:20,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 188 transitions, 2085 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:20,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:20,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:20,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:21,595 INFO L124 PetriNetUnfolderBase]: 2440/3714 cut-off events. [2024-06-04 18:02:21,595 INFO L125 PetriNetUnfolderBase]: For 147911/147913 co-relation queries the response was YES. [2024-06-04 18:02:21,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25484 conditions, 3714 events. 2440/3714 cut-off events. For 147911/147913 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 18721 event pairs, 538 based on Foata normal form. 16/3728 useless extension candidates. Maximal degree in co-relation 25403. Up to 3014 conditions per place. [2024-06-04 18:02:21,627 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 178 selfloop transitions, 60 changer transitions 0/241 dead transitions. [2024-06-04 18:02:21,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 241 transitions, 2926 flow [2024-06-04 18:02:21,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:02:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:02:21,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-04 18:02:21,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44173441734417346 [2024-06-04 18:02:21,630 INFO L175 Difference]: Start difference. First operand has 161 places, 188 transitions, 2085 flow. Second operand 9 states and 163 transitions. [2024-06-04 18:02:21,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 241 transitions, 2926 flow [2024-06-04 18:02:21,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 241 transitions, 2831 flow, removed 14 selfloop flow, removed 4 redundant places. [2024-06-04 18:02:21,770 INFO L231 Difference]: Finished difference. Result has 167 places, 195 transitions, 2208 flow [2024-06-04 18:02:21,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=1994, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2208, PETRI_PLACES=167, PETRI_TRANSITIONS=195} [2024-06-04 18:02:21,771 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 125 predicate places. [2024-06-04 18:02:21,771 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 195 transitions, 2208 flow [2024-06-04 18:02:21,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:21,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:21,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:21,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-04 18:02:21,772 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-04 18:02:21,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -423437846, now seen corresponding path program 3 times [2024-06-04 18:02:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:21,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710892511] [2024-06-04 18:02:21,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:21,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:29,290 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-04 18:02:29,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:29,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710892511] [2024-06-04 18:02:29,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710892511] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:29,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:29,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:02:29,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767353754] [2024-06-04 18:02:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:29,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:02:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:29,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:02:29,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:02:29,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:29,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 195 transitions, 2208 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:29,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:29,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:29,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:30,988 INFO L124 PetriNetUnfolderBase]: 2520/3854 cut-off events. [2024-06-04 18:02:30,989 INFO L125 PetriNetUnfolderBase]: For 167642/167644 co-relation queries the response was YES. [2024-06-04 18:02:31,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25973 conditions, 3854 events. 2520/3854 cut-off events. For 167642/167644 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 19763 event pairs, 576 based on Foata normal form. 52/3904 useless extension candidates. Maximal degree in co-relation 25889. Up to 3085 conditions per place. [2024-06-04 18:02:31,016 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 175 selfloop transitions, 69 changer transitions 0/247 dead transitions. [2024-06-04 18:02:31,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 247 transitions, 2921 flow [2024-06-04 18:02:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-04 18:02:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-04 18:02:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 190 transitions. [2024-06-04 18:02:31,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212860310421286 [2024-06-04 18:02:31,020 INFO L175 Difference]: Start difference. First operand has 167 places, 195 transitions, 2208 flow. Second operand 11 states and 190 transitions. [2024-06-04 18:02:31,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 247 transitions, 2921 flow [2024-06-04 18:02:31,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 247 transitions, 2854 flow, removed 15 selfloop flow, removed 3 redundant places. [2024-06-04 18:02:31,187 INFO L231 Difference]: Finished difference. Result has 175 places, 198 transitions, 2372 flow [2024-06-04 18:02:31,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2151, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2372, PETRI_PLACES=175, PETRI_TRANSITIONS=198} [2024-06-04 18:02:31,187 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 133 predicate places. [2024-06-04 18:02:31,187 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 198 transitions, 2372 flow [2024-06-04 18:02:31,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:31,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:31,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:31,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-04 18:02:31,188 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-04 18:02:31,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:31,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1225090218, now seen corresponding path program 4 times [2024-06-04 18:02:31,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:31,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352543290] [2024-06-04 18:02:31,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:38,533 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-04 18:02:38,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:38,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352543290] [2024-06-04 18:02:38,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352543290] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:38,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:38,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:02:38,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399914981] [2024-06-04 18:02:38,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:38,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:02:38,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:38,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:02:38,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:02:38,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:38,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 198 transitions, 2372 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:38,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:38,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:38,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:39,971 INFO L124 PetriNetUnfolderBase]: 2578/3952 cut-off events. [2024-06-04 18:02:39,971 INFO L125 PetriNetUnfolderBase]: For 155809/155811 co-relation queries the response was YES. [2024-06-04 18:02:39,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27018 conditions, 3952 events. 2578/3952 cut-off events. For 155809/155811 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 20433 event pairs, 609 based on Foata normal form. 16/3966 useless extension candidates. Maximal degree in co-relation 26932. Up to 3409 conditions per place. [2024-06-04 18:02:40,005 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 187 selfloop transitions, 52 changer transitions 0/242 dead transitions. [2024-06-04 18:02:40,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 242 transitions, 3049 flow [2024-06-04 18:02:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:02:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:02:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-04 18:02:40,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 18:02:40,008 INFO L175 Difference]: Start difference. First operand has 175 places, 198 transitions, 2372 flow. Second operand 9 states and 159 transitions. [2024-06-04 18:02:40,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 242 transitions, 3049 flow [2024-06-04 18:02:40,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 242 transitions, 2905 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-04 18:02:40,182 INFO L231 Difference]: Finished difference. Result has 176 places, 201 transitions, 2409 flow [2024-06-04 18:02:40,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2228, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2409, PETRI_PLACES=176, PETRI_TRANSITIONS=201} [2024-06-04 18:02:40,182 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 134 predicate places. [2024-06-04 18:02:40,182 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 201 transitions, 2409 flow [2024-06-04 18:02:40,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:40,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:40,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:40,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-04 18:02:40,183 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-04 18:02:40,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:40,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1946031244, now seen corresponding path program 5 times [2024-06-04 18:02:40,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:40,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250788031] [2024-06-04 18:02:40,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:40,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:47,118 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-04 18:02:47,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:47,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250788031] [2024-06-04 18:02:47,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250788031] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:47,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:47,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:02:47,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257530722] [2024-06-04 18:02:47,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:47,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:02:47,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:47,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:02:47,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:02:47,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:47,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 201 transitions, 2409 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:47,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:47,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:47,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:48,651 INFO L124 PetriNetUnfolderBase]: 2722/4192 cut-off events. [2024-06-04 18:02:48,652 INFO L125 PetriNetUnfolderBase]: For 175214/175216 co-relation queries the response was YES. [2024-06-04 18:02:48,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28848 conditions, 4192 events. 2722/4192 cut-off events. For 175214/175216 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 22150 event pairs, 533 based on Foata normal form. 16/4206 useless extension candidates. Maximal degree in co-relation 28760. Up to 3348 conditions per place. [2024-06-04 18:02:48,692 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 192 selfloop transitions, 59 changer transitions 0/254 dead transitions. [2024-06-04 18:02:48,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 254 transitions, 3287 flow [2024-06-04 18:02:48,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:02:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:02:48,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-04 18:02:48,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45799457994579945 [2024-06-04 18:02:48,694 INFO L175 Difference]: Start difference. First operand has 176 places, 201 transitions, 2409 flow. Second operand 9 states and 169 transitions. [2024-06-04 18:02:48,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 254 transitions, 3287 flow [2024-06-04 18:02:48,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 254 transitions, 3178 flow, removed 15 selfloop flow, removed 5 redundant places. [2024-06-04 18:02:48,920 INFO L231 Difference]: Finished difference. Result has 181 places, 204 transitions, 2504 flow [2024-06-04 18:02:48,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2300, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2504, PETRI_PLACES=181, PETRI_TRANSITIONS=204} [2024-06-04 18:02:48,921 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 139 predicate places. [2024-06-04 18:02:48,921 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 204 transitions, 2504 flow [2024-06-04 18:02:48,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:48,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:48,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:48,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-04 18:02:48,922 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:02:48,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:48,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1946027524, now seen corresponding path program 6 times [2024-06-04 18:02:48,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:48,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914442821] [2024-06-04 18:02:48,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:48,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:02:55,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-04 18:02:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:02:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914442821] [2024-06-04 18:02:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914442821] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:02:55,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:02:55,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:02:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889095177] [2024-06-04 18:02:55,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:02:55,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:02:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:02:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:02:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:02:55,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:02:55,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 204 transitions, 2504 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:55,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:02:55,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:02:55,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:02:57,203 INFO L124 PetriNetUnfolderBase]: 2797/4317 cut-off events. [2024-06-04 18:02:57,203 INFO L125 PetriNetUnfolderBase]: For 187917/187919 co-relation queries the response was YES. [2024-06-04 18:02:57,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30026 conditions, 4317 events. 2797/4317 cut-off events. For 187917/187919 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 23073 event pairs, 682 based on Foata normal form. 20/4335 useless extension candidates. Maximal degree in co-relation 29935. Up to 3801 conditions per place. [2024-06-04 18:02:57,236 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 179 selfloop transitions, 67 changer transitions 0/249 dead transitions. [2024-06-04 18:02:57,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 249 transitions, 3170 flow [2024-06-04 18:02:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:02:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:02:57,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-04 18:02:57,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-06-04 18:02:57,238 INFO L175 Difference]: Start difference. First operand has 181 places, 204 transitions, 2504 flow. Second operand 9 states and 164 transitions. [2024-06-04 18:02:57,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 249 transitions, 3170 flow [2024-06-04 18:02:57,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 249 transitions, 2964 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-06-04 18:02:57,436 INFO L231 Difference]: Finished difference. Result has 182 places, 205 transitions, 2473 flow [2024-06-04 18:02:57,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2303, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2473, PETRI_PLACES=182, PETRI_TRANSITIONS=205} [2024-06-04 18:02:57,436 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 140 predicate places. [2024-06-04 18:02:57,437 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 205 transitions, 2473 flow [2024-06-04 18:02:57,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:02:57,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:02:57,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:02:57,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-04 18:02:57,437 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-04 18:02:57,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:02:57,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1945877422, now seen corresponding path program 1 times [2024-06-04 18:02:57,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:02:57,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000620408] [2024-06-04 18:02:57,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:02:57,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:02:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:04,090 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-04 18:03:04,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:04,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000620408] [2024-06-04 18:03:04,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000620408] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:04,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:04,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:03:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453150379] [2024-06-04 18:03:04,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:04,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:03:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:04,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:03:04,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:03:04,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:04,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 205 transitions, 2473 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-04 18:03:04,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:04,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:04,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:05,584 INFO L124 PetriNetUnfolderBase]: 2814/4344 cut-off events. [2024-06-04 18:03:05,584 INFO L125 PetriNetUnfolderBase]: For 184420/184422 co-relation queries the response was YES. [2024-06-04 18:03:05,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29820 conditions, 4344 events. 2814/4344 cut-off events. For 184420/184422 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 23275 event pairs, 688 based on Foata normal form. 4/4346 useless extension candidates. Maximal degree in co-relation 29730. Up to 4077 conditions per place. [2024-06-04 18:03:05,621 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 194 selfloop transitions, 42 changer transitions 0/239 dead transitions. [2024-06-04 18:03:05,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 239 transitions, 3073 flow [2024-06-04 18:03:05,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:03:05,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:03:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2024-06-04 18:03:05,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4268292682926829 [2024-06-04 18:03:05,624 INFO L175 Difference]: Start difference. First operand has 182 places, 205 transitions, 2473 flow. Second operand 8 states and 140 transitions. [2024-06-04 18:03:05,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 239 transitions, 3073 flow [2024-06-04 18:03:05,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 239 transitions, 2930 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-04 18:03:05,862 INFO L231 Difference]: Finished difference. Result has 183 places, 207 transitions, 2463 flow [2024-06-04 18:03:05,862 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2330, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2463, PETRI_PLACES=183, PETRI_TRANSITIONS=207} [2024-06-04 18:03:05,863 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 141 predicate places. [2024-06-04 18:03:05,863 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 207 transitions, 2463 flow [2024-06-04 18:03:05,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-04 18:03:05,863 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:05,863 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:05,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-04 18:03:05,863 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-04 18:03:05,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:05,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1940313232, now seen corresponding path program 2 times [2024-06-04 18:03:05,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:05,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23064713] [2024-06-04 18:03:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:12,552 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-04 18:03:12,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23064713] [2024-06-04 18:03:12,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23064713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:12,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:12,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:03:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710935523] [2024-06-04 18:03:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:12,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:03:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:03:12,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:03:12,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:12,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 207 transitions, 2463 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:12,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:12,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:12,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:14,075 INFO L124 PetriNetUnfolderBase]: 2831/4371 cut-off events. [2024-06-04 18:03:14,075 INFO L125 PetriNetUnfolderBase]: For 192625/192627 co-relation queries the response was YES. [2024-06-04 18:03:14,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30101 conditions, 4371 events. 2831/4371 cut-off events. For 192625/192627 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 23449 event pairs, 689 based on Foata normal form. 4/4373 useless extension candidates. Maximal degree in co-relation 30010. Up to 4104 conditions per place. [2024-06-04 18:03:14,110 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 196 selfloop transitions, 39 changer transitions 0/238 dead transitions. [2024-06-04 18:03:14,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 238 transitions, 3055 flow [2024-06-04 18:03:14,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:03:14,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:03:14,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-04 18:03:14,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:03:14,112 INFO L175 Difference]: Start difference. First operand has 183 places, 207 transitions, 2463 flow. Second operand 8 states and 136 transitions. [2024-06-04 18:03:14,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 238 transitions, 3055 flow [2024-06-04 18:03:14,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 238 transitions, 2942 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-06-04 18:03:14,350 INFO L231 Difference]: Finished difference. Result has 185 places, 209 transitions, 2481 flow [2024-06-04 18:03:14,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2350, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2481, PETRI_PLACES=185, PETRI_TRANSITIONS=209} [2024-06-04 18:03:14,350 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 143 predicate places. [2024-06-04 18:03:14,350 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 209 transitions, 2481 flow [2024-06-04 18:03:14,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:14,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:14,351 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:14,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-04 18:03:14,351 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-04 18:03:14,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:14,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1945883374, now seen corresponding path program 7 times [2024-06-04 18:03:14,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:14,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734121954] [2024-06-04 18:03:14,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:14,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:21,583 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-04 18:03:21,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734121954] [2024-06-04 18:03:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734121954] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:21,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:21,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:03:21,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742839247] [2024-06-04 18:03:21,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:21,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:03:21,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:21,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:03:21,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:03:21,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:21,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 209 transitions, 2481 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:21,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:21,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:21,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:23,314 INFO L124 PetriNetUnfolderBase]: 2947/4567 cut-off events. [2024-06-04 18:03:23,315 INFO L125 PetriNetUnfolderBase]: For 225819/225821 co-relation queries the response was YES. [2024-06-04 18:03:23,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31369 conditions, 4567 events. 2947/4567 cut-off events. For 225819/225821 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 24886 event pairs, 709 based on Foata normal form. 32/4597 useless extension candidates. Maximal degree in co-relation 31277. Up to 4088 conditions per place. [2024-06-04 18:03:23,353 INFO L140 encePairwiseOnDemand]: 28/41 looper letters, 203 selfloop transitions, 46 changer transitions 0/252 dead transitions. [2024-06-04 18:03:23,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 252 transitions, 3170 flow [2024-06-04 18:03:23,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:03:23,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:03:23,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-04 18:03:23,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43089430894308944 [2024-06-04 18:03:23,356 INFO L175 Difference]: Start difference. First operand has 185 places, 209 transitions, 2481 flow. Second operand 9 states and 159 transitions. [2024-06-04 18:03:23,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 252 transitions, 3170 flow [2024-06-04 18:03:23,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 252 transitions, 3059 flow, removed 18 selfloop flow, removed 6 redundant places. [2024-06-04 18:03:23,627 INFO L231 Difference]: Finished difference. Result has 188 places, 211 transitions, 2535 flow [2024-06-04 18:03:23,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2370, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2535, PETRI_PLACES=188, PETRI_TRANSITIONS=211} [2024-06-04 18:03:23,628 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 146 predicate places. [2024-06-04 18:03:23,628 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 211 transitions, 2535 flow [2024-06-04 18:03:23,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:23,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:23,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:23,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-04 18:03:23,628 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:03:23,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:23,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1940520994, now seen corresponding path program 8 times [2024-06-04 18:03:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:23,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655206539] [2024-06-04 18:03:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:30,873 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-04 18:03:30,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:30,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655206539] [2024-06-04 18:03:30,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655206539] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:30,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:30,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:03:30,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387178078] [2024-06-04 18:03:30,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:30,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:03:30,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:30,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:03:30,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:03:31,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:31,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 211 transitions, 2535 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:31,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:31,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:31,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:32,513 INFO L124 PetriNetUnfolderBase]: 3063/4763 cut-off events. [2024-06-04 18:03:32,513 INFO L125 PetriNetUnfolderBase]: For 239885/239887 co-relation queries the response was YES. [2024-06-04 18:03:32,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32692 conditions, 4763 events. 3063/4763 cut-off events. For 239885/239887 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26355 event pairs, 743 based on Foata normal form. 32/4793 useless extension candidates. Maximal degree in co-relation 32599. Up to 4284 conditions per place. [2024-06-04 18:03:32,560 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 205 selfloop transitions, 43 changer transitions 0/251 dead transitions. [2024-06-04 18:03:32,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 251 transitions, 3216 flow [2024-06-04 18:03:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:03:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:03:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 155 transitions. [2024-06-04 18:03:32,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42005420054200543 [2024-06-04 18:03:32,564 INFO L175 Difference]: Start difference. First operand has 188 places, 211 transitions, 2535 flow. Second operand 9 states and 155 transitions. [2024-06-04 18:03:32,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 251 transitions, 3216 flow [2024-06-04 18:03:32,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 251 transitions, 3102 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 18:03:32,821 INFO L231 Difference]: Finished difference. Result has 190 places, 213 transitions, 2584 flow [2024-06-04 18:03:32,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2421, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2584, PETRI_PLACES=190, PETRI_TRANSITIONS=213} [2024-06-04 18:03:32,821 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 148 predicate places. [2024-06-04 18:03:32,821 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 213 transitions, 2584 flow [2024-06-04 18:03:32,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:32,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:32,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:32,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-04 18:03:32,822 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:03:32,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1940305792, now seen corresponding path program 3 times [2024-06-04 18:03:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:32,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373918807] [2024-06-04 18:03:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:39,254 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-04 18:03:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:39,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373918807] [2024-06-04 18:03:39,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373918807] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:39,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:39,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:03:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112860216] [2024-06-04 18:03:39,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:39,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:03:39,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:39,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:03:39,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:03:39,442 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:39,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 213 transitions, 2584 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:39,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:39,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:39,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:40,800 INFO L124 PetriNetUnfolderBase]: 3080/4790 cut-off events. [2024-06-04 18:03:40,801 INFO L125 PetriNetUnfolderBase]: For 226526/226528 co-relation queries the response was YES. [2024-06-04 18:03:40,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32969 conditions, 4790 events. 3080/4790 cut-off events. For 226526/226528 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26590 event pairs, 720 based on Foata normal form. 4/4792 useless extension candidates. Maximal degree in co-relation 32875. Up to 4418 conditions per place. [2024-06-04 18:03:40,845 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 195 selfloop transitions, 46 changer transitions 0/244 dead transitions. [2024-06-04 18:03:40,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 244 transitions, 3186 flow [2024-06-04 18:03:40,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:03:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:03:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2024-06-04 18:03:40,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4146341463414634 [2024-06-04 18:03:40,848 INFO L175 Difference]: Start difference. First operand has 190 places, 213 transitions, 2584 flow. Second operand 8 states and 136 transitions. [2024-06-04 18:03:40,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 244 transitions, 3186 flow [2024-06-04 18:03:41,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 244 transitions, 3074 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 18:03:41,110 INFO L231 Difference]: Finished difference. Result has 191 places, 215 transitions, 2618 flow [2024-06-04 18:03:41,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2472, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2618, PETRI_PLACES=191, PETRI_TRANSITIONS=215} [2024-06-04 18:03:41,111 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 149 predicate places. [2024-06-04 18:03:41,111 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 215 transitions, 2618 flow [2024-06-04 18:03:41,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:03:41,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:41,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:41,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-04 18:03:41,111 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:03:41,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1739753016, now seen corresponding path program 1 times [2024-06-04 18:03:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:41,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850686530] [2024-06-04 18:03:41,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:49,013 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-04 18:03:49,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:49,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850686530] [2024-06-04 18:03:49,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850686530] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:49,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:49,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:03:49,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781477236] [2024-06-04 18:03:49,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:49,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:03:49,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:49,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:03:49,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:03:49,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:49,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 215 transitions, 2618 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:03:49,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:49,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:49,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:50,489 INFO L124 PetriNetUnfolderBase]: 3095/4810 cut-off events. [2024-06-04 18:03:50,490 INFO L125 PetriNetUnfolderBase]: For 231587/231587 co-relation queries the response was YES. [2024-06-04 18:03:50,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33226 conditions, 4810 events. 3095/4810 cut-off events. For 231587/231587 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26619 event pairs, 836 based on Foata normal form. 2/4810 useless extension candidates. Maximal degree in co-relation 33131. Up to 4748 conditions per place. [2024-06-04 18:03:50,525 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 216 selfloop transitions, 24 changer transitions 0/243 dead transitions. [2024-06-04 18:03:50,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 243 transitions, 3322 flow [2024-06-04 18:03:50,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:03:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:03:50,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-04 18:03:50,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397212543554007 [2024-06-04 18:03:50,526 INFO L175 Difference]: Start difference. First operand has 191 places, 215 transitions, 2618 flow. Second operand 7 states and 114 transitions. [2024-06-04 18:03:50,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 243 transitions, 3322 flow [2024-06-04 18:03:50,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 243 transitions, 3196 flow, removed 19 selfloop flow, removed 6 redundant places. [2024-06-04 18:03:50,763 INFO L231 Difference]: Finished difference. Result has 193 places, 224 transitions, 2648 flow [2024-06-04 18:03:50,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2492, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2648, PETRI_PLACES=193, PETRI_TRANSITIONS=224} [2024-06-04 18:03:50,764 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 151 predicate places. [2024-06-04 18:03:50,764 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 224 transitions, 2648 flow [2024-06-04 18:03:50,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:03:50,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:50,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:50,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-04 18:03:50,765 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:03:50,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:50,765 INFO L85 PathProgramCache]: Analyzing trace with hash -760039342, now seen corresponding path program 4 times [2024-06-04 18:03:50,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676304946] [2024-06-04 18:03:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:50,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:03:57,252 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-04 18:03:57,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:03:57,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676304946] [2024-06-04 18:03:57,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676304946] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:03:57,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:03:57,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:03:57,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266605023] [2024-06-04 18:03:57,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:03:57,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:03:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:03:57,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:03:57,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:03:57,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:03:57,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 224 transitions, 2648 flow. Second operand has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-04 18:03:57,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:03:57,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:03:57,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:03:58,717 INFO L124 PetriNetUnfolderBase]: 3087/4799 cut-off events. [2024-06-04 18:03:58,717 INFO L125 PetriNetUnfolderBase]: For 238699/238701 co-relation queries the response was YES. [2024-06-04 18:03:58,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32962 conditions, 4799 events. 3087/4799 cut-off events. For 238699/238701 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26614 event pairs, 819 based on Foata normal form. 6/4803 useless extension candidates. Maximal degree in co-relation 32865. Up to 4708 conditions per place. [2024-06-04 18:03:58,758 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 229 selfloop transitions, 19 changer transitions 0/251 dead transitions. [2024-06-04 18:03:58,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 251 transitions, 3262 flow [2024-06-04 18:03:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:03:58,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:03:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-04 18:03:58,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-04 18:03:58,760 INFO L175 Difference]: Start difference. First operand has 193 places, 224 transitions, 2648 flow. Second operand 8 states and 127 transitions. [2024-06-04 18:03:58,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 251 transitions, 3262 flow [2024-06-04 18:03:59,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 251 transitions, 3210 flow, removed 13 selfloop flow, removed 3 redundant places. [2024-06-04 18:03:59,036 INFO L231 Difference]: Finished difference. Result has 198 places, 226 transitions, 2697 flow [2024-06-04 18:03:59,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2596, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2697, PETRI_PLACES=198, PETRI_TRANSITIONS=226} [2024-06-04 18:03:59,036 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 156 predicate places. [2024-06-04 18:03:59,036 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 226 transitions, 2697 flow [2024-06-04 18:03:59,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.666666666666666) internal successors, (78), 9 states have internal predecessors, (78), 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-04 18:03:59,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:03:59,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:03:59,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-04 18:03:59,037 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:03:59,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:03:59,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1801875900, now seen corresponding path program 5 times [2024-06-04 18:03:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:03:59,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325567675] [2024-06-04 18:03:59,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:03:59,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:03:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:05,553 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-04 18:04:05,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325567675] [2024-06-04 18:04:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325567675] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:05,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:05,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:04:05,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929645002] [2024-06-04 18:04:05,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:05,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:04:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:05,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:04:05,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:04:05,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:05,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 226 transitions, 2697 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:05,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:05,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:05,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:07,244 INFO L124 PetriNetUnfolderBase]: 3104/4826 cut-off events. [2024-06-04 18:04:07,244 INFO L125 PetriNetUnfolderBase]: For 250291/250293 co-relation queries the response was YES. [2024-06-04 18:04:07,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33475 conditions, 4826 events. 3104/4826 cut-off events. For 250291/250293 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 26765 event pairs, 824 based on Foata normal form. 6/4830 useless extension candidates. Maximal degree in co-relation 33377. Up to 4694 conditions per place. [2024-06-04 18:04:07,280 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 228 selfloop transitions, 22 changer transitions 0/253 dead transitions. [2024-06-04 18:04:07,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 253 transitions, 3309 flow [2024-06-04 18:04:07,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:04:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:04:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-04 18:04:07,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 18:04:07,282 INFO L175 Difference]: Start difference. First operand has 198 places, 226 transitions, 2697 flow. Second operand 8 states and 128 transitions. [2024-06-04 18:04:07,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 253 transitions, 3309 flow [2024-06-04 18:04:07,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 253 transitions, 3228 flow, removed 23 selfloop flow, removed 6 redundant places. [2024-06-04 18:04:07,567 INFO L231 Difference]: Finished difference. Result has 200 places, 228 transitions, 2719 flow [2024-06-04 18:04:07,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2616, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2719, PETRI_PLACES=200, PETRI_TRANSITIONS=228} [2024-06-04 18:04:07,568 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 158 predicate places. [2024-06-04 18:04:07,568 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 228 transitions, 2719 flow [2024-06-04 18:04:07,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:07,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:07,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:07,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-04 18:04:07,568 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:07,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:07,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1545375390, now seen corresponding path program 6 times [2024-06-04 18:04:07,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:07,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786088469] [2024-06-04 18:04:07,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:07,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:07,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:13,879 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-04 18:04:13,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:13,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786088469] [2024-06-04 18:04:13,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786088469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:13,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:13,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:04:13,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318610967] [2024-06-04 18:04:13,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:13,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:04:13,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:13,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:04:13,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:04:13,994 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:13,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 228 transitions, 2719 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:13,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:13,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:13,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:15,501 INFO L124 PetriNetUnfolderBase]: 3146/4892 cut-off events. [2024-06-04 18:04:15,501 INFO L125 PetriNetUnfolderBase]: For 266467/266469 co-relation queries the response was YES. [2024-06-04 18:04:15,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34409 conditions, 4892 events. 3146/4892 cut-off events. For 266467/266469 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27208 event pairs, 826 based on Foata normal form. 6/4896 useless extension candidates. Maximal degree in co-relation 34310. Up to 4668 conditions per place. [2024-06-04 18:04:15,542 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 221 selfloop transitions, 35 changer transitions 0/259 dead transitions. [2024-06-04 18:04:15,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 259 transitions, 3583 flow [2024-06-04 18:04:15,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:04:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:04:15,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 131 transitions. [2024-06-04 18:04:15,545 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39939024390243905 [2024-06-04 18:04:15,545 INFO L175 Difference]: Start difference. First operand has 200 places, 228 transitions, 2719 flow. Second operand 8 states and 131 transitions. [2024-06-04 18:04:15,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 259 transitions, 3583 flow [2024-06-04 18:04:15,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 259 transitions, 3498 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-04 18:04:15,778 INFO L231 Difference]: Finished difference. Result has 202 places, 232 transitions, 2822 flow [2024-06-04 18:04:15,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2634, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2822, PETRI_PLACES=202, PETRI_TRANSITIONS=232} [2024-06-04 18:04:15,779 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 160 predicate places. [2024-06-04 18:04:15,779 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 232 transitions, 2822 flow [2024-06-04 18:04:15,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:15,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:15,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:15,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-04 18:04:15,780 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:15,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:15,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1505779978, now seen corresponding path program 7 times [2024-06-04 18:04:15,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:15,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105017240] [2024-06-04 18:04:15,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:15,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:22,001 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-04 18:04:22,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:22,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105017240] [2024-06-04 18:04:22,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105017240] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:22,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:22,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:04:22,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066057774] [2024-06-04 18:04:22,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:22,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:04:22,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:22,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:04:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:04:22,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:22,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 232 transitions, 2822 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:22,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:22,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:22,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:23,617 INFO L124 PetriNetUnfolderBase]: 3138/4880 cut-off events. [2024-06-04 18:04:23,617 INFO L125 PetriNetUnfolderBase]: For 273404/273406 co-relation queries the response was YES. [2024-06-04 18:04:23,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34438 conditions, 4880 events. 3138/4880 cut-off events. For 273404/273406 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27155 event pairs, 829 based on Foata normal form. 6/4884 useless extension candidates. Maximal degree in co-relation 34338. Up to 4744 conditions per place. [2024-06-04 18:04:23,661 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 225 selfloop transitions, 29 changer transitions 0/257 dead transitions. [2024-06-04 18:04:23,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 257 transitions, 3396 flow [2024-06-04 18:04:23,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:04:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:04:23,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2024-06-04 18:04:23,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 18:04:23,664 INFO L175 Difference]: Start difference. First operand has 202 places, 232 transitions, 2822 flow. Second operand 8 states and 128 transitions. [2024-06-04 18:04:23,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 257 transitions, 3396 flow [2024-06-04 18:04:23,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 257 transitions, 3283 flow, removed 43 selfloop flow, removed 4 redundant places. [2024-06-04 18:04:23,941 INFO L231 Difference]: Finished difference. Result has 206 places, 232 transitions, 2777 flow [2024-06-04 18:04:23,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2709, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2777, PETRI_PLACES=206, PETRI_TRANSITIONS=232} [2024-06-04 18:04:23,942 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 164 predicate places. [2024-06-04 18:04:23,942 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 232 transitions, 2777 flow [2024-06-04 18:04:23,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:23,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:23,942 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:23,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-04 18:04:23,942 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:23,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1506046888, now seen corresponding path program 8 times [2024-06-04 18:04:23,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:23,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871027738] [2024-06-04 18:04:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:23,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:30,071 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-04 18:04:30,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:30,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871027738] [2024-06-04 18:04:30,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871027738] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:30,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:30,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:04:30,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905142769] [2024-06-04 18:04:30,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:30,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:04:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:30,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:04:30,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:04:30,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:30,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 232 transitions, 2777 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:30,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:30,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:30,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:31,707 INFO L124 PetriNetUnfolderBase]: 3130/4868 cut-off events. [2024-06-04 18:04:31,707 INFO L125 PetriNetUnfolderBase]: For 277266/277268 co-relation queries the response was YES. [2024-06-04 18:04:31,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34238 conditions, 4868 events. 3130/4868 cut-off events. For 277266/277268 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 27012 event pairs, 817 based on Foata normal form. 6/4872 useless extension candidates. Maximal degree in co-relation 34136. Up to 4763 conditions per place. [2024-06-04 18:04:31,742 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 237 selfloop transitions, 19 changer transitions 0/259 dead transitions. [2024-06-04 18:04:31,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 259 transitions, 3407 flow [2024-06-04 18:04:31,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:04:31,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:04:31,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-04 18:04:31,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-04 18:04:31,744 INFO L175 Difference]: Start difference. First operand has 206 places, 232 transitions, 2777 flow. Second operand 8 states and 126 transitions. [2024-06-04 18:04:31,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 259 transitions, 3407 flow [2024-06-04 18:04:32,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 259 transitions, 3341 flow, removed 1 selfloop flow, removed 7 redundant places. [2024-06-04 18:04:32,021 INFO L231 Difference]: Finished difference. Result has 207 places, 234 transitions, 2816 flow [2024-06-04 18:04:32,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2816, PETRI_PLACES=207, PETRI_TRANSITIONS=234} [2024-06-04 18:04:32,022 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 165 predicate places. [2024-06-04 18:04:32,022 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 234 transitions, 2816 flow [2024-06-04 18:04:32,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:32,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:32,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:32,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-04 18:04:32,023 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:32,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1802091102, now seen corresponding path program 9 times [2024-06-04 18:04:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:32,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39552964] [2024-06-04 18:04:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:39,161 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-04 18:04:39,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:39,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39552964] [2024-06-04 18:04:39,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39552964] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:39,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:39,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:04:39,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505734629] [2024-06-04 18:04:39,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:39,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:04:39,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:39,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:04:39,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:04:39,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:39,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 234 transitions, 2816 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:39,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:39,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:39,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:40,793 INFO L124 PetriNetUnfolderBase]: 3074/4780 cut-off events. [2024-06-04 18:04:40,793 INFO L125 PetriNetUnfolderBase]: For 283704/283706 co-relation queries the response was YES. [2024-06-04 18:04:40,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32473 conditions, 4780 events. 3074/4780 cut-off events. For 283704/283706 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26464 event pairs, 786 based on Foata normal form. 34/4812 useless extension candidates. Maximal degree in co-relation 32370. Up to 4477 conditions per place. [2024-06-04 18:04:40,838 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 243 selfloop transitions, 23 changer transitions 0/269 dead transitions. [2024-06-04 18:04:40,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 269 transitions, 3489 flow [2024-06-04 18:04:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:04:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:04:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-04 18:04:40,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3956639566395664 [2024-06-04 18:04:40,841 INFO L175 Difference]: Start difference. First operand has 207 places, 234 transitions, 2816 flow. Second operand 9 states and 146 transitions. [2024-06-04 18:04:40,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 269 transitions, 3489 flow [2024-06-04 18:04:41,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 269 transitions, 3366 flow, removed 44 selfloop flow, removed 6 redundant places. [2024-06-04 18:04:41,179 INFO L231 Difference]: Finished difference. Result has 210 places, 235 transitions, 2784 flow [2024-06-04 18:04:41,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2705, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2784, PETRI_PLACES=210, PETRI_TRANSITIONS=235} [2024-06-04 18:04:41,180 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 168 predicate places. [2024-06-04 18:04:41,180 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 235 transitions, 2784 flow [2024-06-04 18:04:41,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:04:41,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:41,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:41,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-04 18:04:41,180 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:41,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:41,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1353683110, now seen corresponding path program 2 times [2024-06-04 18:04:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:41,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719551478] [2024-06-04 18:04:41,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:48,254 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-04 18:04:48,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:48,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719551478] [2024-06-04 18:04:48,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719551478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:48,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:48,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:04:48,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252363565] [2024-06-04 18:04:48,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:48,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:04:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:48,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:04:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:04:48,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:48,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 235 transitions, 2784 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:04:48,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:48,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:48,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:49,634 INFO L124 PetriNetUnfolderBase]: 3084/4793 cut-off events. [2024-06-04 18:04:49,634 INFO L125 PetriNetUnfolderBase]: For 255616/255616 co-relation queries the response was YES. [2024-06-04 18:04:49,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32427 conditions, 4793 events. 3084/4793 cut-off events. For 255616/255616 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26522 event pairs, 801 based on Foata normal form. 2/4793 useless extension candidates. Maximal degree in co-relation 32323. Up to 4765 conditions per place. [2024-06-04 18:04:49,679 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 230 selfloop transitions, 17 changer transitions 0/250 dead transitions. [2024-06-04 18:04:49,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 250 transitions, 3351 flow [2024-06-04 18:04:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:04:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:04:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 92 transitions. [2024-06-04 18:04:49,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37398373983739835 [2024-06-04 18:04:49,681 INFO L175 Difference]: Start difference. First operand has 210 places, 235 transitions, 2784 flow. Second operand 6 states and 92 transitions. [2024-06-04 18:04:49,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 250 transitions, 3351 flow [2024-06-04 18:04:50,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 250 transitions, 3301 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-04 18:04:50,013 INFO L231 Difference]: Finished difference. Result has 211 places, 241 transitions, 2837 flow [2024-06-04 18:04:50,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2734, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2837, PETRI_PLACES=211, PETRI_TRANSITIONS=241} [2024-06-04 18:04:50,013 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 169 predicate places. [2024-06-04 18:04:50,014 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 241 transitions, 2837 flow [2024-06-04 18:04:50,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:04:50,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:50,014 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:50,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-04 18:04:50,014 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:50,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash 2043715990, now seen corresponding path program 3 times [2024-06-04 18:04:50,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477381452] [2024-06-04 18:04:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:50,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:04:57,564 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-04 18:04:57,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:04:57,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477381452] [2024-06-04 18:04:57,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477381452] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:04:57,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:04:57,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:04:57,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671143530] [2024-06-04 18:04:57,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:04:57,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:04:57,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:04:57,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:04:57,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:04:57,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:04:57,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 241 transitions, 2837 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:04:57,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:04:57,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:04:57,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:04:59,094 INFO L124 PetriNetUnfolderBase]: 3086/4796 cut-off events. [2024-06-04 18:04:59,094 INFO L125 PetriNetUnfolderBase]: For 262507/262507 co-relation queries the response was YES. [2024-06-04 18:04:59,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32578 conditions, 4796 events. 3086/4796 cut-off events. For 262507/262507 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26564 event pairs, 802 based on Foata normal form. 2/4796 useless extension candidates. Maximal degree in co-relation 32472. Up to 4731 conditions per place. [2024-06-04 18:04:59,128 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 226 selfloop transitions, 32 changer transitions 0/261 dead transitions. [2024-06-04 18:04:59,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 261 transitions, 3544 flow [2024-06-04 18:04:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:04:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:04:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-06-04 18:04:59,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186991869918699 [2024-06-04 18:04:59,130 INFO L175 Difference]: Start difference. First operand has 211 places, 241 transitions, 2837 flow. Second operand 6 states and 103 transitions. [2024-06-04 18:04:59,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 261 transitions, 3544 flow [2024-06-04 18:04:59,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 261 transitions, 3513 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-04 18:04:59,406 INFO L231 Difference]: Finished difference. Result has 215 places, 244 transitions, 2921 flow [2024-06-04 18:04:59,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2806, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2921, PETRI_PLACES=215, PETRI_TRANSITIONS=244} [2024-06-04 18:04:59,407 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 173 predicate places. [2024-06-04 18:04:59,407 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 244 transitions, 2921 flow [2024-06-04 18:04:59,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:04:59,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:04:59,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:04:59,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-04 18:04:59,408 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:04:59,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:04:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1924265316, now seen corresponding path program 1 times [2024-06-04 18:04:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:04:59,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456722952] [2024-06-04 18:04:59,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:04:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:04:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:08,887 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-04 18:05:08,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:08,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456722952] [2024-06-04 18:05:08,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456722952] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:08,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:08,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:05:08,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992273538] [2024-06-04 18:05:08,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:08,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:05:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:08,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:05:08,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:05:08,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:05:08,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 244 transitions, 2921 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:08,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:08,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:05:08,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:10,429 INFO L124 PetriNetUnfolderBase]: 3096/4810 cut-off events. [2024-06-04 18:05:10,429 INFO L125 PetriNetUnfolderBase]: For 272718/272718 co-relation queries the response was YES. [2024-06-04 18:05:10,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32883 conditions, 4810 events. 3096/4810 cut-off events. For 272718/272718 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26607 event pairs, 799 based on Foata normal form. 2/4810 useless extension candidates. Maximal degree in co-relation 32775. Up to 4745 conditions per place. [2024-06-04 18:05:10,471 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 241 selfloop transitions, 24 changer transitions 0/268 dead transitions. [2024-06-04 18:05:10,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 268 transitions, 3679 flow [2024-06-04 18:05:10,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:05:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:05:10,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 112 transitions. [2024-06-04 18:05:10,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 18:05:10,474 INFO L175 Difference]: Start difference. First operand has 215 places, 244 transitions, 2921 flow. Second operand 7 states and 112 transitions. [2024-06-04 18:05:10,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 268 transitions, 3679 flow [2024-06-04 18:05:10,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 268 transitions, 3612 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-04 18:05:10,826 INFO L231 Difference]: Finished difference. Result has 218 places, 250 transitions, 2993 flow [2024-06-04 18:05:10,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2856, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2993, PETRI_PLACES=218, PETRI_TRANSITIONS=250} [2024-06-04 18:05:10,826 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 176 predicate places. [2024-06-04 18:05:10,827 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 250 transitions, 2993 flow [2024-06-04 18:05:10,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:10,827 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:10,827 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:10,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-04 18:05:10,827 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:05:10,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1753442730, now seen corresponding path program 1 times [2024-06-04 18:05:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:10,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563801823] [2024-06-04 18:05:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:20,049 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-04 18:05:20,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:20,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563801823] [2024-06-04 18:05:20,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563801823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:20,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:20,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:05:20,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405639395] [2024-06-04 18:05:20,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:20,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:05:20,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:20,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:05:20,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:05:20,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:05:20,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 250 transitions, 2993 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:20,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:20,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:05:20,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:21,587 INFO L124 PetriNetUnfolderBase]: 3111/4831 cut-off events. [2024-06-04 18:05:21,587 INFO L125 PetriNetUnfolderBase]: For 274256/274256 co-relation queries the response was YES. [2024-06-04 18:05:21,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33302 conditions, 4831 events. 3111/4831 cut-off events. For 274256/274256 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26730 event pairs, 800 based on Foata normal form. 2/4831 useless extension candidates. Maximal degree in co-relation 33194. Up to 4775 conditions per place. [2024-06-04 18:05:21,633 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 242 selfloop transitions, 26 changer transitions 0/271 dead transitions. [2024-06-04 18:05:21,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 271 transitions, 3738 flow [2024-06-04 18:05:21,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:05:21,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:05:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2024-06-04 18:05:21,635 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3867595818815331 [2024-06-04 18:05:21,636 INFO L175 Difference]: Start difference. First operand has 218 places, 250 transitions, 2993 flow. Second operand 7 states and 111 transitions. [2024-06-04 18:05:21,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 271 transitions, 3738 flow [2024-06-04 18:05:21,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 271 transitions, 3681 flow, removed 19 selfloop flow, removed 3 redundant places. [2024-06-04 18:05:21,994 INFO L231 Difference]: Finished difference. Result has 223 places, 256 transitions, 3065 flow [2024-06-04 18:05:21,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=2939, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3065, PETRI_PLACES=223, PETRI_TRANSITIONS=256} [2024-06-04 18:05:21,995 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 181 predicate places. [2024-06-04 18:05:21,995 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 256 transitions, 3065 flow [2024-06-04 18:05:21,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:21,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:21,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:21,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-04 18:05:21,996 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:05:21,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1924145346, now seen corresponding path program 2 times [2024-06-04 18:05:21,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:21,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55068058] [2024-06-04 18:05:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:31,675 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-04 18:05:31,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:31,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55068058] [2024-06-04 18:05:31,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55068058] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:31,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:31,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:05:31,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444485087] [2024-06-04 18:05:31,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:31,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:05:31,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:31,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:05:31,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:05:31,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:05:31,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 256 transitions, 3065 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:31,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:31,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:05:31,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:33,233 INFO L124 PetriNetUnfolderBase]: 3121/4845 cut-off events. [2024-06-04 18:05:33,233 INFO L125 PetriNetUnfolderBase]: For 283942/283942 co-relation queries the response was YES. [2024-06-04 18:05:33,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33575 conditions, 4845 events. 3121/4845 cut-off events. For 283942/283942 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26797 event pairs, 798 based on Foata normal form. 2/4845 useless extension candidates. Maximal degree in co-relation 33464. Up to 4808 conditions per place. [2024-06-04 18:05:33,273 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 249 selfloop transitions, 20 changer transitions 0/272 dead transitions. [2024-06-04 18:05:33,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 272 transitions, 3675 flow [2024-06-04 18:05:33,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:05:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:05:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2024-06-04 18:05:33,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693379790940767 [2024-06-04 18:05:33,275 INFO L175 Difference]: Start difference. First operand has 223 places, 256 transitions, 3065 flow. Second operand 7 states and 106 transitions. [2024-06-04 18:05:33,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 272 transitions, 3675 flow [2024-06-04 18:05:33,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 272 transitions, 3610 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-04 18:05:33,688 INFO L231 Difference]: Finished difference. Result has 226 places, 259 transitions, 3090 flow [2024-06-04 18:05:33,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3000, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3090, PETRI_PLACES=226, PETRI_TRANSITIONS=259} [2024-06-04 18:05:33,688 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places. [2024-06-04 18:05:33,688 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 259 transitions, 3090 flow [2024-06-04 18:05:33,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:33,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:33,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:33,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-04 18:05:33,690 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:05:33,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash 2044137652, now seen corresponding path program 2 times [2024-06-04 18:05:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291346430] [2024-06-04 18:05:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:43,401 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-04 18:05:43,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:43,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291346430] [2024-06-04 18:05:43,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291346430] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:43,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:43,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:05:43,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759217713] [2024-06-04 18:05:43,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:43,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:05:43,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:43,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:05:43,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:05:43,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:05:43,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 259 transitions, 3090 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:43,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:43,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:05:43,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:44,914 INFO L124 PetriNetUnfolderBase]: 3131/4860 cut-off events. [2024-06-04 18:05:44,914 INFO L125 PetriNetUnfolderBase]: For 293395/293397 co-relation queries the response was YES. [2024-06-04 18:05:44,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33816 conditions, 4860 events. 3131/4860 cut-off events. For 293395/293397 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 26912 event pairs, 804 based on Foata normal form. 4/4862 useless extension candidates. Maximal degree in co-relation 33705. Up to 4799 conditions per place. [2024-06-04 18:05:44,963 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 242 selfloop transitions, 28 changer transitions 0/273 dead transitions. [2024-06-04 18:05:44,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 273 transitions, 3794 flow [2024-06-04 18:05:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:05:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:05:44,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2024-06-04 18:05:44,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861788617886179 [2024-06-04 18:05:44,965 INFO L175 Difference]: Start difference. First operand has 226 places, 259 transitions, 3090 flow. Second operand 6 states and 95 transitions. [2024-06-04 18:05:44,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 273 transitions, 3794 flow [2024-06-04 18:05:45,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 273 transitions, 3724 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-06-04 18:05:45,401 INFO L231 Difference]: Finished difference. Result has 226 places, 262 transitions, 3109 flow [2024-06-04 18:05:45,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3020, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3109, PETRI_PLACES=226, PETRI_TRANSITIONS=262} [2024-06-04 18:05:45,402 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 184 predicate places. [2024-06-04 18:05:45,402 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 262 transitions, 3109 flow [2024-06-04 18:05:45,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:45,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:45,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:45,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-04 18:05:45,402 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:05:45,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:45,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2043900316, now seen corresponding path program 3 times [2024-06-04 18:05:45,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:45,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934213094] [2024-06-04 18:05:45,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:45,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:05:54,891 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-04 18:05:54,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:05:54,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934213094] [2024-06-04 18:05:54,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934213094] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:05:54,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:05:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:05:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103053778] [2024-06-04 18:05:54,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:05:54,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:05:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:05:54,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:05:54,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:05:54,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:05:54,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 262 transitions, 3109 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:54,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:05:54,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:05:54,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:05:56,433 INFO L124 PetriNetUnfolderBase]: 3125/4851 cut-off events. [2024-06-04 18:05:56,433 INFO L125 PetriNetUnfolderBase]: For 299695/299695 co-relation queries the response was YES. [2024-06-04 18:05:56,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33820 conditions, 4851 events. 3125/4851 cut-off events. For 299695/299695 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26836 event pairs, 797 based on Foata normal form. 2/4851 useless extension candidates. Maximal degree in co-relation 33709. Up to 4790 conditions per place. [2024-06-04 18:05:56,473 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 247 selfloop transitions, 27 changer transitions 0/277 dead transitions. [2024-06-04 18:05:56,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 277 transitions, 3697 flow [2024-06-04 18:05:56,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:05:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:05:56,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-04 18:05:56,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-04 18:05:56,476 INFO L175 Difference]: Start difference. First operand has 226 places, 262 transitions, 3109 flow. Second operand 6 states and 99 transitions. [2024-06-04 18:05:56,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 277 transitions, 3697 flow [2024-06-04 18:05:56,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 277 transitions, 3617 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 18:05:56,896 INFO L231 Difference]: Finished difference. Result has 228 places, 262 transitions, 3099 flow [2024-06-04 18:05:56,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3029, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3099, PETRI_PLACES=228, PETRI_TRANSITIONS=262} [2024-06-04 18:05:56,897 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 186 predicate places. [2024-06-04 18:05:56,897 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 262 transitions, 3099 flow [2024-06-04 18:05:56,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:05:56,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:05:56,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:05:56,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-04 18:05:56,898 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:05:56,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:05:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2043900502, now seen corresponding path program 3 times [2024-06-04 18:05:56,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:05:56,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488966406] [2024-06-04 18:05:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:05:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:05:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:06:06,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-04 18:06:06,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:06:06,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488966406] [2024-06-04 18:06:06,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488966406] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:06:06,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:06:06,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:06:06,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961083204] [2024-06-04 18:06:06,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:06:06,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:06:06,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:06:06,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:06:06,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:06:06,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:06:06,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 262 transitions, 3099 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:06:06,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:06:06,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:06:06,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:06:07,873 INFO L124 PetriNetUnfolderBase]: 3119/4843 cut-off events. [2024-06-04 18:06:07,874 INFO L125 PetriNetUnfolderBase]: For 306033/306033 co-relation queries the response was YES. [2024-06-04 18:06:07,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33805 conditions, 4843 events. 3119/4843 cut-off events. For 306033/306033 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 26795 event pairs, 798 based on Foata normal form. 2/4843 useless extension candidates. Maximal degree in co-relation 33694. Up to 4786 conditions per place. [2024-06-04 18:06:07,920 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 243 selfloop transitions, 29 changer transitions 0/275 dead transitions. [2024-06-04 18:06:07,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 275 transitions, 3679 flow [2024-06-04 18:06:07,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:06:07,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:06:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2024-06-04 18:06:07,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024390243902439 [2024-06-04 18:06:07,922 INFO L175 Difference]: Start difference. First operand has 228 places, 262 transitions, 3099 flow. Second operand 6 states and 99 transitions. [2024-06-04 18:06:07,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 275 transitions, 3679 flow [2024-06-04 18:06:08,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 275 transitions, 3617 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-06-04 18:06:08,318 INFO L231 Difference]: Finished difference. Result has 229 places, 262 transitions, 3105 flow [2024-06-04 18:06:08,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3037, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3105, PETRI_PLACES=229, PETRI_TRANSITIONS=262} [2024-06-04 18:06:08,318 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2024-06-04 18:06:08,318 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 262 transitions, 3105 flow [2024-06-04 18:06:08,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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-04 18:06:08,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:06:08,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:06:08,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-04 18:06:08,319 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:06:08,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:06:08,319 INFO L85 PathProgramCache]: Analyzing trace with hash 2044146580, now seen corresponding path program 1 times [2024-06-04 18:06:08,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:06:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071992841] [2024-06-04 18:06:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:06:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:06:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:06:18,081 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-04 18:06:18,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:06:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071992841] [2024-06-04 18:06:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071992841] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:06:18,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:06:18,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-04 18:06:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296909212] [2024-06-04 18:06:18,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:06:18,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-04 18:06:18,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:06:18,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-04 18:06:18,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-04 18:06:18,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:06:18,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 262 transitions, 3105 flow. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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-04 18:06:18,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:06:18,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:06:18,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:06:19,597 INFO L124 PetriNetUnfolderBase]: 3114/4836 cut-off events. [2024-06-04 18:06:19,597 INFO L125 PetriNetUnfolderBase]: For 302871/302871 co-relation queries the response was YES. [2024-06-04 18:06:19,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33663 conditions, 4836 events. 3114/4836 cut-off events. For 302871/302871 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26653 event pairs, 795 based on Foata normal form. 2/4836 useless extension candidates. Maximal degree in co-relation 33551. Up to 4808 conditions per place. [2024-06-04 18:06:19,638 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 255 selfloop transitions, 15 changer transitions 0/273 dead transitions. [2024-06-04 18:06:19,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 273 transitions, 3697 flow [2024-06-04 18:06:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:06:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:06:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-06-04 18:06:19,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2024-06-04 18:06:19,640 INFO L175 Difference]: Start difference. First operand has 229 places, 262 transitions, 3105 flow. Second operand 6 states and 91 transitions. [2024-06-04 18:06:19,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 273 transitions, 3697 flow [2024-06-04 18:06:20,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 273 transitions, 3627 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-04 18:06:20,025 INFO L231 Difference]: Finished difference. Result has 229 places, 264 transitions, 3104 flow [2024-06-04 18:06:20,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3035, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3104, PETRI_PLACES=229, PETRI_TRANSITIONS=264} [2024-06-04 18:06:20,026 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 187 predicate places. [2024-06-04 18:06:20,026 INFO L495 AbstractCegarLoop]: Abstraction has has 229 places, 264 transitions, 3104 flow [2024-06-04 18:06:20,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 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-04 18:06:20,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:06:20,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:06:20,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-04 18:06:20,026 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:06:20,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:06:20,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1902559160, now seen corresponding path program 1 times [2024-06-04 18:06:20,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:06:20,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218306985] [2024-06-04 18:06:20,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:06:20,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:06:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:06:27,989 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-04 18:06:27,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:06:27,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218306985] [2024-06-04 18:06:27,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218306985] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:06:27,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:06:27,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:06:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331247671] [2024-06-04 18:06:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:06:27,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:06:27,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:06:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:06:27,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:06:28,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:06:28,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 264 transitions, 3104 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:06:28,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:06:28,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:06:28,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:06:29,486 INFO L124 PetriNetUnfolderBase]: 3210/4971 cut-off events. [2024-06-04 18:06:29,486 INFO L125 PetriNetUnfolderBase]: For 315239/315241 co-relation queries the response was YES. [2024-06-04 18:06:29,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34520 conditions, 4971 events. 3210/4971 cut-off events. For 315239/315241 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 27471 event pairs, 782 based on Foata normal form. 10/4979 useless extension candidates. Maximal degree in co-relation 34408. Up to 4494 conditions per place. [2024-06-04 18:06:29,538 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 219 selfloop transitions, 98 changer transitions 0/320 dead transitions. [2024-06-04 18:06:29,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 320 transitions, 4311 flow [2024-06-04 18:06:29,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:06:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:06:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-04 18:06:29,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4481707317073171 [2024-06-04 18:06:29,540 INFO L175 Difference]: Start difference. First operand has 229 places, 264 transitions, 3104 flow. Second operand 8 states and 147 transitions. [2024-06-04 18:06:29,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 320 transitions, 4311 flow [2024-06-04 18:06:29,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 320 transitions, 4258 flow, removed 13 selfloop flow, removed 4 redundant places. [2024-06-04 18:06:29,949 INFO L231 Difference]: Finished difference. Result has 234 places, 290 transitions, 3539 flow [2024-06-04 18:06:29,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3051, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3539, PETRI_PLACES=234, PETRI_TRANSITIONS=290} [2024-06-04 18:06:29,949 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 192 predicate places. [2024-06-04 18:06:29,949 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 290 transitions, 3539 flow [2024-06-04 18:06:29,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:06:29,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:06:29,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:06:29,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-04 18:06:29,950 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:06:29,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:06:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1748814671, now seen corresponding path program 1 times [2024-06-04 18:06:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:06:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749026912] [2024-06-04 18:06:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:06:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:06:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:06:36,390 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-04 18:06:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:06:36,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749026912] [2024-06-04 18:06:36,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749026912] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:06:36,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:06:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-04 18:06:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913924155] [2024-06-04 18:06:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:06:36,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-04 18:06:36,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:06:36,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-04 18:06:36,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-04 18:06:36,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:06:36,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 290 transitions, 3539 flow. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:06:36,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:06:36,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:06:36,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:06:38,312 INFO L124 PetriNetUnfolderBase]: 3251/5042 cut-off events. [2024-06-04 18:06:38,312 INFO L125 PetriNetUnfolderBase]: For 332703/332705 co-relation queries the response was YES. [2024-06-04 18:06:38,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35899 conditions, 5042 events. 3251/5042 cut-off events. For 332703/332705 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 28063 event pairs, 697 based on Foata normal form. 12/5052 useless extension candidates. Maximal degree in co-relation 35785. Up to 4574 conditions per place. [2024-06-04 18:06:38,354 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 270 selfloop transitions, 54 changer transitions 0/327 dead transitions. [2024-06-04 18:06:38,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 327 transitions, 4325 flow [2024-06-04 18:06:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:06:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:06:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-04 18:06:38,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41192411924119243 [2024-06-04 18:06:38,356 INFO L175 Difference]: Start difference. First operand has 234 places, 290 transitions, 3539 flow. Second operand 9 states and 152 transitions. [2024-06-04 18:06:38,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 327 transitions, 4325 flow [2024-06-04 18:06:38,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 327 transitions, 4243 flow, removed 29 selfloop flow, removed 2 redundant places. [2024-06-04 18:06:38,716 INFO L231 Difference]: Finished difference. Result has 241 places, 291 transitions, 3607 flow [2024-06-04 18:06:38,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3457, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3607, PETRI_PLACES=241, PETRI_TRANSITIONS=291} [2024-06-04 18:06:38,717 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 199 predicate places. [2024-06-04 18:06:38,717 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 291 transitions, 3607 flow [2024-06-04 18:06:38,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:06:38,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:06:38,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:06:38,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-04 18:06:38,718 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:06:38,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:06:38,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1902230870, now seen corresponding path program 2 times [2024-06-04 18:06:38,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:06:38,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542203500] [2024-06-04 18:06:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:06:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:06:38,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:06:46,208 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-04 18:06:46,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:06:46,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542203500] [2024-06-04 18:06:46,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542203500] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:06:46,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:06:46,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:06:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705681576] [2024-06-04 18:06:46,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:06:46,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:06:46,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:06:46,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:06:46,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:06:46,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:06:46,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 291 transitions, 3607 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:06:46,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:06:46,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:06:46,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:06:47,797 INFO L124 PetriNetUnfolderBase]: 3476/5355 cut-off events. [2024-06-04 18:06:47,797 INFO L125 PetriNetUnfolderBase]: For 360401/360403 co-relation queries the response was YES. [2024-06-04 18:06:47,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38876 conditions, 5355 events. 3476/5355 cut-off events. For 360401/360403 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 29837 event pairs, 826 based on Foata normal form. 6/5359 useless extension candidates. Maximal degree in co-relation 38760. Up to 4706 conditions per place. [2024-06-04 18:06:47,847 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 240 selfloop transitions, 119 changer transitions 0/362 dead transitions. [2024-06-04 18:06:47,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 362 transitions, 5246 flow [2024-06-04 18:06:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:06:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:06:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 18:06:47,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 18:06:47,848 INFO L175 Difference]: Start difference. First operand has 241 places, 291 transitions, 3607 flow. Second operand 8 states and 141 transitions. [2024-06-04 18:06:47,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 362 transitions, 5246 flow [2024-06-04 18:06:48,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 362 transitions, 5110 flow, removed 15 selfloop flow, removed 7 redundant places. [2024-06-04 18:06:48,330 INFO L231 Difference]: Finished difference. Result has 244 places, 329 transitions, 4187 flow [2024-06-04 18:06:48,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=3471, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4187, PETRI_PLACES=244, PETRI_TRANSITIONS=329} [2024-06-04 18:06:48,331 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 202 predicate places. [2024-06-04 18:06:48,331 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 329 transitions, 4187 flow [2024-06-04 18:06:48,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:06:48,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:06:48,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:06:48,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-04 18:06:48,331 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:06:48,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:06:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1902242030, now seen corresponding path program 3 times [2024-06-04 18:06:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:06:48,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041204190] [2024-06-04 18:06:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:06:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:06:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:06:56,262 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-04 18:06:56,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:06:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041204190] [2024-06-04 18:06:56,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041204190] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:06:56,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:06:56,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:06:56,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738172217] [2024-06-04 18:06:56,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:06:56,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:06:56,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:06:56,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:06:56,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:06:56,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:06:56,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 329 transitions, 4187 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:06:56,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:06:56,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:06:56,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:06:57,880 INFO L124 PetriNetUnfolderBase]: 3448/5317 cut-off events. [2024-06-04 18:06:57,881 INFO L125 PetriNetUnfolderBase]: For 363198/363200 co-relation queries the response was YES. [2024-06-04 18:06:57,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38737 conditions, 5317 events. 3448/5317 cut-off events. For 363198/363200 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 29598 event pairs, 823 based on Foata normal form. 10/5325 useless extension candidates. Maximal degree in co-relation 38618. Up to 4691 conditions per place. [2024-06-04 18:06:57,924 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 242 selfloop transitions, 117 changer transitions 0/362 dead transitions. [2024-06-04 18:06:57,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 362 transitions, 5349 flow [2024-06-04 18:06:57,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:06:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:06:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 18:06:57,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 18:06:57,925 INFO L175 Difference]: Start difference. First operand has 244 places, 329 transitions, 4187 flow. Second operand 8 states and 141 transitions. [2024-06-04 18:06:57,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 362 transitions, 5349 flow [2024-06-04 18:06:58,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 362 transitions, 5187 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-04 18:06:58,462 INFO L231 Difference]: Finished difference. Result has 251 places, 336 transitions, 4452 flow [2024-06-04 18:06:58,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4025, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4452, PETRI_PLACES=251, PETRI_TRANSITIONS=336} [2024-06-04 18:06:58,463 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 209 predicate places. [2024-06-04 18:06:58,463 INFO L495 AbstractCegarLoop]: Abstraction has has 251 places, 336 transitions, 4452 flow [2024-06-04 18:06:58,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:06:58,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:06:58,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:06:58,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-04 18:06:58,463 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:06:58,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:06:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash -376895431, now seen corresponding path program 2 times [2024-06-04 18:06:58,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:06:58,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997983067] [2024-06-04 18:06:58,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:06:58,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:06:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:07:05,223 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-04 18:07:05,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:07:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997983067] [2024-06-04 18:07:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997983067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:07:05,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:07:05,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:07:05,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955423144] [2024-06-04 18:07:05,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:07:05,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:07:05,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:07:05,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:07:05,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:07:05,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:07:05,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 336 transitions, 4452 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:05,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:07:05,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:07:05,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:07:07,131 INFO L124 PetriNetUnfolderBase]: 3489/5388 cut-off events. [2024-06-04 18:07:07,132 INFO L125 PetriNetUnfolderBase]: For 380590/380592 co-relation queries the response was YES. [2024-06-04 18:07:07,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39546 conditions, 5388 events. 3489/5388 cut-off events. For 380590/380592 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 30134 event pairs, 812 based on Foata normal form. 14/5400 useless extension candidates. Maximal degree in co-relation 39424. Up to 5214 conditions per place. [2024-06-04 18:07:07,303 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 346 selfloop transitions, 20 changer transitions 0/369 dead transitions. [2024-06-04 18:07:07,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 369 transitions, 5308 flow [2024-06-04 18:07:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:07:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:07:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-04 18:07:07,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3821138211382114 [2024-06-04 18:07:07,306 INFO L175 Difference]: Start difference. First operand has 251 places, 336 transitions, 4452 flow. Second operand 9 states and 141 transitions. [2024-06-04 18:07:07,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 369 transitions, 5308 flow [2024-06-04 18:07:07,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 369 transitions, 5090 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-06-04 18:07:07,801 INFO L231 Difference]: Finished difference. Result has 255 places, 337 transitions, 4318 flow [2024-06-04 18:07:07,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4234, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4318, PETRI_PLACES=255, PETRI_TRANSITIONS=337} [2024-06-04 18:07:07,801 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 213 predicate places. [2024-06-04 18:07:07,801 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 337 transitions, 4318 flow [2024-06-04 18:07:07,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:07,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:07:07,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:07:07,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-04 18:07:07,802 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:07:07,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:07:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash -661995301, now seen corresponding path program 3 times [2024-06-04 18:07:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:07:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639171354] [2024-06-04 18:07:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:07:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:07:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:07:14,778 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-04 18:07:14,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:07:14,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639171354] [2024-06-04 18:07:14,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639171354] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:07:14,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:07:14,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:07:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333548735] [2024-06-04 18:07:14,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:07:14,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:07:14,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:07:14,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:07:14,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:07:14,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:07:14,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 337 transitions, 4318 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:14,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:07:14,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:07:14,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:07:16,566 INFO L124 PetriNetUnfolderBase]: 3530/5459 cut-off events. [2024-06-04 18:07:16,567 INFO L125 PetriNetUnfolderBase]: For 393769/393771 co-relation queries the response was YES. [2024-06-04 18:07:16,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39730 conditions, 5459 events. 3530/5459 cut-off events. For 393769/393771 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 30801 event pairs, 840 based on Foata normal form. 14/5471 useless extension candidates. Maximal degree in co-relation 39608. Up to 5162 conditions per place. [2024-06-04 18:07:16,623 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 331 selfloop transitions, 36 changer transitions 0/370 dead transitions. [2024-06-04 18:07:16,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 370 transitions, 5180 flow [2024-06-04 18:07:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:07:16,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:07:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2024-06-04 18:07:16,626 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3902439024390244 [2024-06-04 18:07:16,626 INFO L175 Difference]: Start difference. First operand has 255 places, 337 transitions, 4318 flow. Second operand 9 states and 144 transitions. [2024-06-04 18:07:16,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 370 transitions, 5180 flow [2024-06-04 18:07:17,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 370 transitions, 5110 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-04 18:07:17,338 INFO L231 Difference]: Finished difference. Result has 257 places, 338 transitions, 4367 flow [2024-06-04 18:07:17,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4248, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4367, PETRI_PLACES=257, PETRI_TRANSITIONS=338} [2024-06-04 18:07:17,339 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2024-06-04 18:07:17,339 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 338 transitions, 4367 flow [2024-06-04 18:07:17,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:17,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:07:17,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:07:17,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-04 18:07:17,339 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:07:17,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:07:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash -662225941, now seen corresponding path program 4 times [2024-06-04 18:07:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:07:17,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941899758] [2024-06-04 18:07:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:07:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:07:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:07:24,911 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-04 18:07:24,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:07:24,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941899758] [2024-06-04 18:07:24,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941899758] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:07:24,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:07:24,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:07:24,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668960868] [2024-06-04 18:07:24,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:07:24,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:07:24,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:07:24,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:07:24,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:07:25,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:07:25,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 338 transitions, 4367 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:25,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:07:25,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:07:25,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:07:26,890 INFO L124 PetriNetUnfolderBase]: 3571/5530 cut-off events. [2024-06-04 18:07:26,890 INFO L125 PetriNetUnfolderBase]: For 406893/406895 co-relation queries the response was YES. [2024-06-04 18:07:26,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40293 conditions, 5530 events. 3571/5530 cut-off events. For 406893/406895 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 31352 event pairs, 850 based on Foata normal form. 14/5542 useless extension candidates. Maximal degree in co-relation 40170. Up to 5256 conditions per place. [2024-06-04 18:07:26,937 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 337 selfloop transitions, 31 changer transitions 0/371 dead transitions. [2024-06-04 18:07:26,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 371 transitions, 5235 flow [2024-06-04 18:07:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:07:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:07:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 143 transitions. [2024-06-04 18:07:26,940 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3875338753387534 [2024-06-04 18:07:26,940 INFO L175 Difference]: Start difference. First operand has 257 places, 338 transitions, 4367 flow. Second operand 9 states and 143 transitions. [2024-06-04 18:07:26,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 371 transitions, 5235 flow [2024-06-04 18:07:27,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 371 transitions, 5132 flow, removed 17 selfloop flow, removed 7 redundant places. [2024-06-04 18:07:27,477 INFO L231 Difference]: Finished difference. Result has 259 places, 339 transitions, 4376 flow [2024-06-04 18:07:27,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4264, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4376, PETRI_PLACES=259, PETRI_TRANSITIONS=339} [2024-06-04 18:07:27,477 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 217 predicate places. [2024-06-04 18:07:27,478 INFO L495 AbstractCegarLoop]: Abstraction has has 259 places, 339 transitions, 4376 flow [2024-06-04 18:07:27,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:27,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:07:27,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:07:27,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-04 18:07:27,478 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:07:27,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:07:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash -662232451, now seen corresponding path program 5 times [2024-06-04 18:07:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:07:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35628118] [2024-06-04 18:07:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:07:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:07:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:07:34,329 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-04 18:07:34,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:07:34,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35628118] [2024-06-04 18:07:34,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35628118] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:07:34,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:07:34,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:07:34,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650923965] [2024-06-04 18:07:34,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:07:34,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:07:34,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:07:34,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:07:34,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:07:34,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:07:34,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 339 transitions, 4376 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:34,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:07:34,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:07:34,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:07:36,197 INFO L124 PetriNetUnfolderBase]: 3543/5486 cut-off events. [2024-06-04 18:07:36,198 INFO L125 PetriNetUnfolderBase]: For 397901/397903 co-relation queries the response was YES. [2024-06-04 18:07:36,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39104 conditions, 5486 events. 3543/5486 cut-off events. For 397901/397903 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 31021 event pairs, 854 based on Foata normal form. 18/5502 useless extension candidates. Maximal degree in co-relation 38980. Up to 5142 conditions per place. [2024-06-04 18:07:36,257 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 336 selfloop transitions, 33 changer transitions 0/372 dead transitions. [2024-06-04 18:07:36,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 372 transitions, 5120 flow [2024-06-04 18:07:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:07:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:07:36,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 145 transitions. [2024-06-04 18:07:36,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39295392953929537 [2024-06-04 18:07:36,259 INFO L175 Difference]: Start difference. First operand has 259 places, 339 transitions, 4376 flow. Second operand 9 states and 145 transitions. [2024-06-04 18:07:36,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 372 transitions, 5120 flow [2024-06-04 18:07:37,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 372 transitions, 5018 flow, removed 22 selfloop flow, removed 7 redundant places. [2024-06-04 18:07:37,009 INFO L231 Difference]: Finished difference. Result has 260 places, 338 transitions, 4242 flow [2024-06-04 18:07:37,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4168, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4242, PETRI_PLACES=260, PETRI_TRANSITIONS=338} [2024-06-04 18:07:37,010 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 218 predicate places. [2024-06-04 18:07:37,010 INFO L495 AbstractCegarLoop]: Abstraction has has 260 places, 338 transitions, 4242 flow [2024-06-04 18:07:37,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:37,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:07:37,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:07:37,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-04 18:07:37,011 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:07:37,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:07:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash -192199914, now seen corresponding path program 4 times [2024-06-04 18:07:37,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:07:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489719000] [2024-06-04 18:07:37,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:07:37,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:07:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:07:44,475 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-04 18:07:44,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:07:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489719000] [2024-06-04 18:07:44,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489719000] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:07:44,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:07:44,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:07:44,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019768075] [2024-06-04 18:07:44,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:07:44,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:07:44,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:07:44,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:07:44,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:07:44,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:07:44,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 338 transitions, 4242 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:44,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:07:44,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:07:44,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:07:46,164 INFO L124 PetriNetUnfolderBase]: 3599/5564 cut-off events. [2024-06-04 18:07:46,164 INFO L125 PetriNetUnfolderBase]: For 396295/396297 co-relation queries the response was YES. [2024-06-04 18:07:46,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39765 conditions, 5564 events. 3599/5564 cut-off events. For 396295/396297 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31535 event pairs, 862 based on Foata normal form. 6/5568 useless extension candidates. Maximal degree in co-relation 39640. Up to 5453 conditions per place. [2024-06-04 18:07:46,215 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 318 selfloop transitions, 44 changer transitions 0/365 dead transitions. [2024-06-04 18:07:46,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 365 transitions, 5277 flow [2024-06-04 18:07:46,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:07:46,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:07:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2024-06-04 18:07:46,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797909407665505 [2024-06-04 18:07:46,217 INFO L175 Difference]: Start difference. First operand has 260 places, 338 transitions, 4242 flow. Second operand 7 states and 109 transitions. [2024-06-04 18:07:46,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 365 transitions, 5277 flow [2024-06-04 18:07:46,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 365 transitions, 5189 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-06-04 18:07:46,849 INFO L231 Difference]: Finished difference. Result has 262 places, 353 transitions, 4442 flow [2024-06-04 18:07:46,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4154, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4442, PETRI_PLACES=262, PETRI_TRANSITIONS=353} [2024-06-04 18:07:46,849 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 220 predicate places. [2024-06-04 18:07:46,850 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 353 transitions, 4442 flow [2024-06-04 18:07:46,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:46,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:07:46,850 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:07:46,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-04 18:07:46,850 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:07:46,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:07:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1055980385, now seen corresponding path program 1 times [2024-06-04 18:07:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:07:46,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192199659] [2024-06-04 18:07:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:07:46,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:07:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:07:54,789 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-04 18:07:54,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:07:54,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192199659] [2024-06-04 18:07:54,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192199659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:07:54,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:07:54,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:07:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308799900] [2024-06-04 18:07:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:07:54,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:07:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:07:54,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:07:54,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:07:54,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:07:54,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 353 transitions, 4442 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:54,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:07:54,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:07:54,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:07:56,479 INFO L124 PetriNetUnfolderBase]: 3596/5559 cut-off events. [2024-06-04 18:07:56,479 INFO L125 PetriNetUnfolderBase]: For 396529/396529 co-relation queries the response was YES. [2024-06-04 18:07:56,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39944 conditions, 5559 events. 3596/5559 cut-off events. For 396529/396529 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 31491 event pairs, 861 based on Foata normal form. 1/5558 useless extension candidates. Maximal degree in co-relation 39816. Up to 5528 conditions per place. [2024-06-04 18:07:56,537 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 340 selfloop transitions, 19 changer transitions 0/362 dead transitions. [2024-06-04 18:07:56,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 362 transitions, 5186 flow [2024-06-04 18:07:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-04 18:07:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-04 18:07:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-06-04 18:07:56,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2024-06-04 18:07:56,539 INFO L175 Difference]: Start difference. First operand has 262 places, 353 transitions, 4442 flow. Second operand 6 states and 91 transitions. [2024-06-04 18:07:56,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 362 transitions, 5186 flow [2024-06-04 18:07:57,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 362 transitions, 5109 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-04 18:07:57,272 INFO L231 Difference]: Finished difference. Result has 266 places, 353 transitions, 4415 flow [2024-06-04 18:07:57,272 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4367, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4415, PETRI_PLACES=266, PETRI_TRANSITIONS=353} [2024-06-04 18:07:57,272 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 224 predicate places. [2024-06-04 18:07:57,272 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 353 transitions, 4415 flow [2024-06-04 18:07:57,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:07:57,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:07:57,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:07:57,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-04 18:07:57,273 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:07:57,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:07:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1069324428, now seen corresponding path program 5 times [2024-06-04 18:07:57,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:07:57,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640244682] [2024-06-04 18:07:57,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:07:57,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:07:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:08:05,317 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-04 18:08:05,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:08:05,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640244682] [2024-06-04 18:08:05,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640244682] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:08:05,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:08:05,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:08:05,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894222234] [2024-06-04 18:08:05,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:08:05,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:08:05,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:08:05,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:08:05,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:08:05,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:08:05,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 353 transitions, 4415 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:05,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:08:05,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:08:05,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:08:07,032 INFO L124 PetriNetUnfolderBase]: 3604/5572 cut-off events. [2024-06-04 18:08:07,033 INFO L125 PetriNetUnfolderBase]: For 414588/414590 co-relation queries the response was YES. [2024-06-04 18:08:07,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39619 conditions, 5572 events. 3604/5572 cut-off events. For 414588/414590 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 31555 event pairs, 831 based on Foata normal form. 10/5580 useless extension candidates. Maximal degree in co-relation 39489. Up to 4888 conditions per place. [2024-06-04 18:08:07,105 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 227 selfloop transitions, 153 changer transitions 0/383 dead transitions. [2024-06-04 18:08:07,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 383 transitions, 5569 flow [2024-06-04 18:08:07,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:08:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:08:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2024-06-04 18:08:07,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564459930313589 [2024-06-04 18:08:07,107 INFO L175 Difference]: Start difference. First operand has 266 places, 353 transitions, 4415 flow. Second operand 7 states and 131 transitions. [2024-06-04 18:08:07,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 383 transitions, 5569 flow [2024-06-04 18:08:07,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 383 transitions, 5508 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 18:08:07,951 INFO L231 Difference]: Finished difference. Result has 268 places, 357 transitions, 4754 flow [2024-06-04 18:08:07,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4358, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4754, PETRI_PLACES=268, PETRI_TRANSITIONS=357} [2024-06-04 18:08:07,953 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 226 predicate places. [2024-06-04 18:08:07,954 INFO L495 AbstractCegarLoop]: Abstraction has has 268 places, 357 transitions, 4754 flow [2024-06-04 18:08:07,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:07,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:08:07,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:08:07,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-04 18:08:07,954 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:08:07,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:08:07,955 INFO L85 PathProgramCache]: Analyzing trace with hash -210438738, now seen corresponding path program 6 times [2024-06-04 18:08:07,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:08:07,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230876575] [2024-06-04 18:08:07,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:08:07,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:08:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:08:15,374 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-04 18:08:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:08:15,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230876575] [2024-06-04 18:08:15,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230876575] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:08:15,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:08:15,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:08:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203723437] [2024-06-04 18:08:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:08:15,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:08:15,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:08:15,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:08:15,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:08:15,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:08:15,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 357 transitions, 4754 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:15,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:08:15,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:08:15,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:08:17,073 INFO L124 PetriNetUnfolderBase]: 3639/5620 cut-off events. [2024-06-04 18:08:17,073 INFO L125 PetriNetUnfolderBase]: For 411046/411048 co-relation queries the response was YES. [2024-06-04 18:08:17,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40808 conditions, 5620 events. 3639/5620 cut-off events. For 411046/411048 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 31886 event pairs, 844 based on Foata normal form. 6/5624 useless extension candidates. Maximal degree in co-relation 40677. Up to 4917 conditions per place. [2024-06-04 18:08:17,135 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 241 selfloop transitions, 144 changer transitions 0/388 dead transitions. [2024-06-04 18:08:17,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 388 transitions, 6006 flow [2024-06-04 18:08:17,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:08:17,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:08:17,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-06-04 18:08:17,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-04 18:08:17,138 INFO L175 Difference]: Start difference. First operand has 268 places, 357 transitions, 4754 flow. Second operand 7 states and 123 transitions. [2024-06-04 18:08:17,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 388 transitions, 6006 flow [2024-06-04 18:08:17,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 388 transitions, 5722 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-06-04 18:08:17,892 INFO L231 Difference]: Finished difference. Result has 272 places, 368 transitions, 5000 flow [2024-06-04 18:08:17,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4490, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5000, PETRI_PLACES=272, PETRI_TRANSITIONS=368} [2024-06-04 18:08:17,893 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 230 predicate places. [2024-06-04 18:08:17,893 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 368 transitions, 5000 flow [2024-06-04 18:08:17,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:17,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:08:17,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:08:17,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-04 18:08:17,894 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:08:17,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:08:17,894 INFO L85 PathProgramCache]: Analyzing trace with hash 365752762, now seen corresponding path program 1 times [2024-06-04 18:08:17,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:08:17,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145076863] [2024-06-04 18:08:17,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:08:17,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:08:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:08:29,613 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-04 18:08:29,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:08:29,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145076863] [2024-06-04 18:08:29,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145076863] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:08:29,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:08:29,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:08:29,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745413900] [2024-06-04 18:08:29,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:08:29,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:08:29,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:08:29,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:08:29,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:08:29,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:08:29,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 368 transitions, 5000 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:29,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:08:29,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:08:29,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:08:31,520 INFO L124 PetriNetUnfolderBase]: 3659/5647 cut-off events. [2024-06-04 18:08:31,520 INFO L125 PetriNetUnfolderBase]: For 412838/412838 co-relation queries the response was YES. [2024-06-04 18:08:31,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41134 conditions, 5647 events. 3659/5647 cut-off events. For 412838/412838 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 32016 event pairs, 865 based on Foata normal form. 4/5649 useless extension candidates. Maximal degree in co-relation 41001. Up to 5496 conditions per place. [2024-06-04 18:08:31,578 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 341 selfloop transitions, 52 changer transitions 0/396 dead transitions. [2024-06-04 18:08:31,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 396 transitions, 6048 flow [2024-06-04 18:08:31,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:08:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:08:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2024-06-04 18:08:31,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37398373983739835 [2024-06-04 18:08:31,580 INFO L175 Difference]: Start difference. First operand has 272 places, 368 transitions, 5000 flow. Second operand 9 states and 138 transitions. [2024-06-04 18:08:31,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 396 transitions, 6048 flow [2024-06-04 18:08:32,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 396 transitions, 5854 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-04 18:08:32,331 INFO L231 Difference]: Finished difference. Result has 277 places, 374 transitions, 4992 flow [2024-06-04 18:08:32,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4808, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4992, PETRI_PLACES=277, PETRI_TRANSITIONS=374} [2024-06-04 18:08:32,332 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 235 predicate places. [2024-06-04 18:08:32,332 INFO L495 AbstractCegarLoop]: Abstraction has has 277 places, 374 transitions, 4992 flow [2024-06-04 18:08:32,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:32,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:08:32,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:08:32,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-04 18:08:32,333 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:08:32,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:08:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash 481042852, now seen corresponding path program 2 times [2024-06-04 18:08:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:08:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888664724] [2024-06-04 18:08:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:08:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:08:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:08:42,772 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-04 18:08:42,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:08:42,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888664724] [2024-06-04 18:08:42,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888664724] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:08:42,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:08:42,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:08:42,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539828589] [2024-06-04 18:08:42,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:08:42,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:08:42,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:08:42,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:08:42,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:08:42,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:08:42,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 374 transitions, 4992 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:42,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:08:42,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:08:42,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:08:44,635 INFO L124 PetriNetUnfolderBase]: 3711/5719 cut-off events. [2024-06-04 18:08:44,636 INFO L125 PetriNetUnfolderBase]: For 423786/423786 co-relation queries the response was YES. [2024-06-04 18:08:44,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41661 conditions, 5719 events. 3711/5719 cut-off events. For 423786/423786 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 32408 event pairs, 871 based on Foata normal form. 4/5721 useless extension candidates. Maximal degree in co-relation 41528. Up to 5616 conditions per place. [2024-06-04 18:08:44,695 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 355 selfloop transitions, 44 changer transitions 0/402 dead transitions. [2024-06-04 18:08:44,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 402 transitions, 6067 flow [2024-06-04 18:08:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-04 18:08:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-04 18:08:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2024-06-04 18:08:44,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36097560975609755 [2024-06-04 18:08:44,697 INFO L175 Difference]: Start difference. First operand has 277 places, 374 transitions, 4992 flow. Second operand 10 states and 148 transitions. [2024-06-04 18:08:44,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 402 transitions, 6067 flow [2024-06-04 18:08:45,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 402 transitions, 5946 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-06-04 18:08:45,351 INFO L231 Difference]: Finished difference. Result has 281 places, 380 transitions, 5052 flow [2024-06-04 18:08:45,351 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4883, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5052, PETRI_PLACES=281, PETRI_TRANSITIONS=380} [2024-06-04 18:08:45,351 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 239 predicate places. [2024-06-04 18:08:45,351 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 380 transitions, 5052 flow [2024-06-04 18:08:45,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:45,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:08:45,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:08:45,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-04 18:08:45,352 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:08:45,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:08:45,352 INFO L85 PathProgramCache]: Analyzing trace with hash 481037272, now seen corresponding path program 3 times [2024-06-04 18:08:45,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:08:45,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049533443] [2024-06-04 18:08:45,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:08:45,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:08:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:08:55,555 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-04 18:08:55,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:08:55,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049533443] [2024-06-04 18:08:55,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049533443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:08:55,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:08:55,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:08:55,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800863469] [2024-06-04 18:08:55,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:08:55,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:08:55,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:08:55,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:08:55,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:08:55,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:08:55,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 380 transitions, 5052 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:55,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:08:55,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:08:55,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:08:57,470 INFO L124 PetriNetUnfolderBase]: 3699/5703 cut-off events. [2024-06-04 18:08:57,470 INFO L125 PetriNetUnfolderBase]: For 426185/426185 co-relation queries the response was YES. [2024-06-04 18:08:57,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41383 conditions, 5703 events. 3699/5703 cut-off events. For 426185/426185 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 32323 event pairs, 875 based on Foata normal form. 4/5705 useless extension candidates. Maximal degree in co-relation 41249. Up to 5608 conditions per place. [2024-06-04 18:08:57,532 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 352 selfloop transitions, 43 changer transitions 0/398 dead transitions. [2024-06-04 18:08:57,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 398 transitions, 5897 flow [2024-06-04 18:08:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:08:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:08:57,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-04 18:08:57,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-04 18:08:57,533 INFO L175 Difference]: Start difference. First operand has 281 places, 380 transitions, 5052 flow. Second operand 8 states and 126 transitions. [2024-06-04 18:08:57,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 398 transitions, 5897 flow [2024-06-04 18:08:58,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 398 transitions, 5807 flow, removed 22 selfloop flow, removed 6 redundant places. [2024-06-04 18:08:58,287 INFO L231 Difference]: Finished difference. Result has 283 places, 380 transitions, 5054 flow [2024-06-04 18:08:58,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4962, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5054, PETRI_PLACES=283, PETRI_TRANSITIONS=380} [2024-06-04 18:08:58,288 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 241 predicate places. [2024-06-04 18:08:58,288 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 380 transitions, 5054 flow [2024-06-04 18:08:58,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:08:58,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:08:58,288 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:08:58,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-04 18:08:58,288 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:08:58,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:08:58,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1063598790, now seen corresponding path program 4 times [2024-06-04 18:08:58,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:08:58,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403284363] [2024-06-04 18:08:58,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:08:58,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:08:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:08,445 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-04 18:09:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:08,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403284363] [2024-06-04 18:09:08,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403284363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:08,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:08,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:09:08,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868695926] [2024-06-04 18:09:08,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:08,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:09:08,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:08,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:09:08,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:09:08,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:09:08,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 380 transitions, 5054 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:08,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:08,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:09:08,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:10,334 INFO L124 PetriNetUnfolderBase]: 3719/5731 cut-off events. [2024-06-04 18:09:10,334 INFO L125 PetriNetUnfolderBase]: For 437725/437725 co-relation queries the response was YES. [2024-06-04 18:09:10,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41707 conditions, 5731 events. 3719/5731 cut-off events. For 437725/437725 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 32486 event pairs, 871 based on Foata normal form. 4/5733 useless extension candidates. Maximal degree in co-relation 41571. Up to 5568 conditions per place. [2024-06-04 18:09:10,393 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 344 selfloop transitions, 56 changer transitions 0/403 dead transitions. [2024-06-04 18:09:10,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 403 transitions, 6086 flow [2024-06-04 18:09:10,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-04 18:09:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-04 18:09:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-04 18:09:10,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41114982578397213 [2024-06-04 18:09:10,395 INFO L175 Difference]: Start difference. First operand has 283 places, 380 transitions, 5054 flow. Second operand 7 states and 118 transitions. [2024-06-04 18:09:10,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 403 transitions, 6086 flow [2024-06-04 18:09:11,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 403 transitions, 6000 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-04 18:09:11,049 INFO L231 Difference]: Finished difference. Result has 283 places, 383 transitions, 5130 flow [2024-06-04 18:09:11,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4968, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5130, PETRI_PLACES=283, PETRI_TRANSITIONS=383} [2024-06-04 18:09:11,050 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 241 predicate places. [2024-06-04 18:09:11,050 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 383 transitions, 5130 flow [2024-06-04 18:09:11,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:11,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:11,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:11,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-04 18:09:11,051 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:09:11,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:11,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1056241560, now seen corresponding path program 5 times [2024-06-04 18:09:11,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:11,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902448088] [2024-06-04 18:09:11,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:11,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:19,939 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-04 18:09:19,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:19,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902448088] [2024-06-04 18:09:19,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902448088] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:19,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:19,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:09:19,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828845706] [2024-06-04 18:09:19,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:19,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:09:19,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:19,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:09:19,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:09:20,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:09:20,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 383 transitions, 5130 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:20,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:20,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:09:20,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:21,818 INFO L124 PetriNetUnfolderBase]: 3739/5760 cut-off events. [2024-06-04 18:09:21,818 INFO L125 PetriNetUnfolderBase]: For 450838/450840 co-relation queries the response was YES. [2024-06-04 18:09:21,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42156 conditions, 5760 events. 3739/5760 cut-off events. For 450838/450840 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 32656 event pairs, 869 based on Foata normal form. 6/5764 useless extension candidates. Maximal degree in co-relation 42019. Up to 5584 conditions per place. [2024-06-04 18:09:21,881 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 344 selfloop transitions, 60 changer transitions 0/407 dead transitions. [2024-06-04 18:09:21,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 407 transitions, 6185 flow [2024-06-04 18:09:21,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:09:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:09:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 136 transitions. [2024-06-04 18:09:21,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3685636856368564 [2024-06-04 18:09:21,883 INFO L175 Difference]: Start difference. First operand has 283 places, 383 transitions, 5130 flow. Second operand 9 states and 136 transitions. [2024-06-04 18:09:21,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 407 transitions, 6185 flow [2024-06-04 18:09:22,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 407 transitions, 6041 flow, removed 13 selfloop flow, removed 6 redundant places. [2024-06-04 18:09:22,641 INFO L231 Difference]: Finished difference. Result has 286 places, 386 transitions, 5161 flow [2024-06-04 18:09:22,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4994, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5161, PETRI_PLACES=286, PETRI_TRANSITIONS=386} [2024-06-04 18:09:22,642 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 244 predicate places. [2024-06-04 18:09:22,642 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 386 transitions, 5161 flow [2024-06-04 18:09:22,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:22,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:22,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:22,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-04 18:09:22,642 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:09:22,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -842833668, now seen corresponding path program 6 times [2024-06-04 18:09:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:22,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234747069] [2024-06-04 18:09:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:32,802 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-04 18:09:32,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:32,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234747069] [2024-06-04 18:09:32,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234747069] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:32,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:32,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:09:32,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458000955] [2024-06-04 18:09:32,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:32,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:09:32,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:32,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:09:32,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:09:32,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:09:32,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 386 transitions, 5161 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:32,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:32,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:09:32,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:34,744 INFO L124 PetriNetUnfolderBase]: 3727/5743 cut-off events. [2024-06-04 18:09:34,744 INFO L125 PetriNetUnfolderBase]: For 440358/440358 co-relation queries the response was YES. [2024-06-04 18:09:34,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41730 conditions, 5743 events. 3727/5743 cut-off events. For 440358/440358 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 32545 event pairs, 869 based on Foata normal form. 4/5745 useless extension candidates. Maximal degree in co-relation 41593. Up to 5576 conditions per place. [2024-06-04 18:09:34,808 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 346 selfloop transitions, 61 changer transitions 0/410 dead transitions. [2024-06-04 18:09:34,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 410 transitions, 6048 flow [2024-06-04 18:09:34,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:09:34,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:09:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-06-04 18:09:34,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38482384823848237 [2024-06-04 18:09:34,810 INFO L175 Difference]: Start difference. First operand has 286 places, 386 transitions, 5161 flow. Second operand 9 states and 142 transitions. [2024-06-04 18:09:34,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 410 transitions, 6048 flow [2024-06-04 18:09:35,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 410 transitions, 5901 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-04 18:09:35,430 INFO L231 Difference]: Finished difference. Result has 289 places, 386 transitions, 5148 flow [2024-06-04 18:09:35,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5014, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5148, PETRI_PLACES=289, PETRI_TRANSITIONS=386} [2024-06-04 18:09:35,430 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 247 predicate places. [2024-06-04 18:09:35,430 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 386 transitions, 5148 flow [2024-06-04 18:09:35,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:35,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:35,431 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:35,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-04 18:09:35,431 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:09:35,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:35,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1047045795, now seen corresponding path program 1 times [2024-06-04 18:09:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:35,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237009180] [2024-06-04 18:09:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:35,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:42,867 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-04 18:09:42,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:42,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237009180] [2024-06-04 18:09:42,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237009180] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:42,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:42,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:09:42,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744589363] [2024-06-04 18:09:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:42,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:09:42,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:42,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:09:42,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:09:42,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:09:42,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 386 transitions, 5148 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:42,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:42,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:09:42,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:44,704 INFO L124 PetriNetUnfolderBase]: 3795/5838 cut-off events. [2024-06-04 18:09:44,705 INFO L125 PetriNetUnfolderBase]: For 468534/468536 co-relation queries the response was YES. [2024-06-04 18:09:44,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43037 conditions, 5838 events. 3795/5838 cut-off events. For 468534/468536 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 33167 event pairs, 794 based on Foata normal form. 4/5840 useless extension candidates. Maximal degree in co-relation 42899. Up to 5413 conditions per place. [2024-06-04 18:09:44,755 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 360 selfloop transitions, 69 changer transitions 0/432 dead transitions. [2024-06-04 18:09:44,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 432 transitions, 6675 flow [2024-06-04 18:09:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:09:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:09:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-06-04 18:09:44,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42378048780487804 [2024-06-04 18:09:44,756 INFO L175 Difference]: Start difference. First operand has 289 places, 386 transitions, 5148 flow. Second operand 8 states and 139 transitions. [2024-06-04 18:09:44,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 432 transitions, 6675 flow [2024-06-04 18:09:45,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 432 transitions, 6491 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-04 18:09:45,469 INFO L231 Difference]: Finished difference. Result has 289 places, 404 transitions, 5460 flow [2024-06-04 18:09:45,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=4982, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5460, PETRI_PLACES=289, PETRI_TRANSITIONS=404} [2024-06-04 18:09:45,470 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 247 predicate places. [2024-06-04 18:09:45,470 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 404 transitions, 5460 flow [2024-06-04 18:09:45,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:45,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:45,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:45,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-04 18:09:45,470 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:09:45,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:45,471 INFO L85 PathProgramCache]: Analyzing trace with hash 983020985, now seen corresponding path program 1 times [2024-06-04 18:09:45,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:45,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441324685] [2024-06-04 18:09:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:09:53,465 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-04 18:09:53,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:09:53,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441324685] [2024-06-04 18:09:53,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441324685] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:09:53,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:09:53,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:09:53,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907536078] [2024-06-04 18:09:53,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:09:53,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:09:53,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:09:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:09:53,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:09:53,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:09:53,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 404 transitions, 5460 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:53,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:09:53,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:09:53,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:09:55,487 INFO L124 PetriNetUnfolderBase]: 3917/6007 cut-off events. [2024-06-04 18:09:55,488 INFO L125 PetriNetUnfolderBase]: For 501363/501365 co-relation queries the response was YES. [2024-06-04 18:09:55,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45858 conditions, 6007 events. 3917/6007 cut-off events. For 501363/501365 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 34112 event pairs, 859 based on Foata normal form. 8/6013 useless extension candidates. Maximal degree in co-relation 45718. Up to 5217 conditions per place. [2024-06-04 18:09:55,542 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 279 selfloop transitions, 180 changer transitions 0/462 dead transitions. [2024-06-04 18:09:55,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 462 transitions, 7353 flow [2024-06-04 18:09:55,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:09:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:09:55,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-04 18:09:55,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43902439024390244 [2024-06-04 18:09:55,544 INFO L175 Difference]: Start difference. First operand has 289 places, 404 transitions, 5460 flow. Second operand 8 states and 144 transitions. [2024-06-04 18:09:55,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 462 transitions, 7353 flow [2024-06-04 18:09:56,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 462 transitions, 7230 flow, removed 50 selfloop flow, removed 2 redundant places. [2024-06-04 18:09:56,417 INFO L231 Difference]: Finished difference. Result has 297 places, 435 transitions, 6283 flow [2024-06-04 18:09:56,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5341, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6283, PETRI_PLACES=297, PETRI_TRANSITIONS=435} [2024-06-04 18:09:56,418 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 255 predicate places. [2024-06-04 18:09:56,419 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 435 transitions, 6283 flow [2024-06-04 18:09:56,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:09:56,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:09:56,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:09:56,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-04 18:09:56,419 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:09:56,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:09:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash 983020799, now seen corresponding path program 2 times [2024-06-04 18:09:56,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:09:56,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790236479] [2024-06-04 18:09:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:09:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:09:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:03,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-04 18:10:03,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:03,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790236479] [2024-06-04 18:10:03,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790236479] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:03,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:03,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:03,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308375059] [2024-06-04 18:10:03,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:03,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:03,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:03,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:03,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:04,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:10:04,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 435 transitions, 6283 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:04,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:04,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:10:04,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:05,878 INFO L124 PetriNetUnfolderBase]: 3937/6035 cut-off events. [2024-06-04 18:10:05,878 INFO L125 PetriNetUnfolderBase]: For 513830/513832 co-relation queries the response was YES. [2024-06-04 18:10:05,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47013 conditions, 6035 events. 3937/6035 cut-off events. For 513830/513832 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 34287 event pairs, 894 based on Foata normal form. 6/6039 useless extension candidates. Maximal degree in co-relation 46868. Up to 5862 conditions per place. [2024-06-04 18:10:05,946 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 401 selfloop transitions, 56 changer transitions 0/460 dead transitions. [2024-06-04 18:10:05,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 460 transitions, 7341 flow [2024-06-04 18:10:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:05,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-04 18:10:05,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3932926829268293 [2024-06-04 18:10:05,947 INFO L175 Difference]: Start difference. First operand has 297 places, 435 transitions, 6283 flow. Second operand 8 states and 129 transitions. [2024-06-04 18:10:05,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 460 transitions, 7341 flow [2024-06-04 18:10:06,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 460 transitions, 7039 flow, removed 15 selfloop flow, removed 4 redundant places. [2024-06-04 18:10:06,754 INFO L231 Difference]: Finished difference. Result has 301 places, 440 transitions, 6196 flow [2024-06-04 18:10:06,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=5981, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6196, PETRI_PLACES=301, PETRI_TRANSITIONS=440} [2024-06-04 18:10:06,755 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 259 predicate places. [2024-06-04 18:10:06,755 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 440 transitions, 6196 flow [2024-06-04 18:10:06,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:06,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:06,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:06,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-04 18:10:06,756 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:10:06,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:06,756 INFO L85 PathProgramCache]: Analyzing trace with hash -869556969, now seen corresponding path program 2 times [2024-06-04 18:10:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167530588] [2024-06-04 18:10:06,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:15,001 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-04 18:10:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167530588] [2024-06-04 18:10:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167530588] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:15,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:15,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:15,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909280545] [2024-06-04 18:10:15,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:15,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:15,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:15,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:15,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:15,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:10:15,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 440 transitions, 6196 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:15,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:15,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:10:15,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:16,898 INFO L124 PetriNetUnfolderBase]: 3967/6077 cut-off events. [2024-06-04 18:10:16,899 INFO L125 PetriNetUnfolderBase]: For 531434/531436 co-relation queries the response was YES. [2024-06-04 18:10:16,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47061 conditions, 6077 events. 3967/6077 cut-off events. For 531434/531436 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 34533 event pairs, 863 based on Foata normal form. 8/6083 useless extension candidates. Maximal degree in co-relation 46915. Up to 5267 conditions per place. [2024-06-04 18:10:16,964 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 296 selfloop transitions, 173 changer transitions 0/472 dead transitions. [2024-06-04 18:10:16,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 472 transitions, 7775 flow [2024-06-04 18:10:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 18:10:16,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 18:10:16,966 INFO L175 Difference]: Start difference. First operand has 301 places, 440 transitions, 6196 flow. Second operand 8 states and 141 transitions. [2024-06-04 18:10:16,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 472 transitions, 7775 flow [2024-06-04 18:10:17,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 472 transitions, 7604 flow, removed 31 selfloop flow, removed 5 redundant places. [2024-06-04 18:10:17,814 INFO L231 Difference]: Finished difference. Result has 304 places, 447 transitions, 6504 flow [2024-06-04 18:10:17,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6029, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6504, PETRI_PLACES=304, PETRI_TRANSITIONS=447} [2024-06-04 18:10:17,814 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 262 predicate places. [2024-06-04 18:10:17,814 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 447 transitions, 6504 flow [2024-06-04 18:10:17,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:17,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:17,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:17,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-04 18:10:17,815 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:10:17,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash -869794119, now seen corresponding path program 3 times [2024-06-04 18:10:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:17,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474294420] [2024-06-04 18:10:17,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:17,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:25,923 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-04 18:10:25,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:25,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474294420] [2024-06-04 18:10:25,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474294420] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:25,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:25,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:10:25,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438881691] [2024-06-04 18:10:25,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:25,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:10:25,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:25,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:10:25,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:10:26,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:10:26,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 447 transitions, 6504 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:26,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:26,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:10:26,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:27,881 INFO L124 PetriNetUnfolderBase]: 3949/6053 cut-off events. [2024-06-04 18:10:27,881 INFO L125 PetriNetUnfolderBase]: For 530401/530403 co-relation queries the response was YES. [2024-06-04 18:10:27,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47038 conditions, 6053 events. 3949/6053 cut-off events. For 530401/530403 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 34386 event pairs, 876 based on Foata normal form. 8/6059 useless extension candidates. Maximal degree in co-relation 46891. Up to 5256 conditions per place. [2024-06-04 18:10:27,942 INFO L140 encePairwiseOnDemand]: 29/41 looper letters, 301 selfloop transitions, 168 changer transitions 0/472 dead transitions. [2024-06-04 18:10:27,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 472 transitions, 7973 flow [2024-06-04 18:10:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-04 18:10:27,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2024-06-04 18:10:27,945 INFO L175 Difference]: Start difference. First operand has 304 places, 447 transitions, 6504 flow. Second operand 8 states and 141 transitions. [2024-06-04 18:10:27,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 472 transitions, 7973 flow [2024-06-04 18:10:28,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 472 transitions, 7677 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-04 18:10:28,805 INFO L231 Difference]: Finished difference. Result has 307 places, 447 transitions, 6556 flow [2024-06-04 18:10:28,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6208, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=168, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6556, PETRI_PLACES=307, PETRI_TRANSITIONS=447} [2024-06-04 18:10:28,805 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 265 predicate places. [2024-06-04 18:10:28,805 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 447 transitions, 6556 flow [2024-06-04 18:10:28,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:28,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:28,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:28,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-04 18:10:28,806 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:10:28,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:28,806 INFO L85 PathProgramCache]: Analyzing trace with hash -869794305, now seen corresponding path program 3 times [2024-06-04 18:10:28,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:28,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299721198] [2024-06-04 18:10:28,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:28,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:35,507 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-04 18:10:35,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:35,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299721198] [2024-06-04 18:10:35,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299721198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:35,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:35,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:10:35,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944159341] [2024-06-04 18:10:35,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:35,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:10:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:10:35,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:10:35,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:10:35,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 447 transitions, 6556 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:35,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:35,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:10:35,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:37,554 INFO L124 PetriNetUnfolderBase]: 4001/6125 cut-off events. [2024-06-04 18:10:37,555 INFO L125 PetriNetUnfolderBase]: For 551830/551832 co-relation queries the response was YES. [2024-06-04 18:10:37,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48178 conditions, 6125 events. 4001/6125 cut-off events. For 551830/551832 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 34821 event pairs, 888 based on Foata normal form. 6/6129 useless extension candidates. Maximal degree in co-relation 48030. Up to 5906 conditions per place. [2024-06-04 18:10:37,618 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 414 selfloop transitions, 60 changer transitions 0/477 dead transitions. [2024-06-04 18:10:37,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 477 transitions, 7907 flow [2024-06-04 18:10:37,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:10:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:10:37,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-04 18:10:37,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3794037940379404 [2024-06-04 18:10:37,621 INFO L175 Difference]: Start difference. First operand has 307 places, 447 transitions, 6556 flow. Second operand 9 states and 140 transitions. [2024-06-04 18:10:37,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 477 transitions, 7907 flow [2024-06-04 18:10:38,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 477 transitions, 7643 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-04 18:10:38,572 INFO L231 Difference]: Finished difference. Result has 312 places, 456 transitions, 6615 flow [2024-06-04 18:10:38,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6292, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6615, PETRI_PLACES=312, PETRI_TRANSITIONS=456} [2024-06-04 18:10:38,572 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 270 predicate places. [2024-06-04 18:10:38,572 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 456 transitions, 6615 flow [2024-06-04 18:10:38,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:38,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:38,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:38,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-04 18:10:38,573 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:10:38,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:38,573 INFO L85 PathProgramCache]: Analyzing trace with hash -869548041, now seen corresponding path program 1 times [2024-06-04 18:10:38,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:38,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464325653] [2024-06-04 18:10:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:38,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:46,662 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-04 18:10:46,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:46,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464325653] [2024-06-04 18:10:46,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464325653] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:46,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:46,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:10:46,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339860501] [2024-06-04 18:10:46,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:46,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:10:46,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:46,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:10:46,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:10:46,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:10:46,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 456 transitions, 6615 flow. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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-04 18:10:46,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:46,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:10:46,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:48,669 INFO L124 PetriNetUnfolderBase]: 4009/6136 cut-off events. [2024-06-04 18:10:48,670 INFO L125 PetriNetUnfolderBase]: For 559380/559380 co-relation queries the response was YES. [2024-06-04 18:10:48,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48157 conditions, 6136 events. 4009/6136 cut-off events. For 559380/559380 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 34910 event pairs, 867 based on Foata normal form. 2/6136 useless extension candidates. Maximal degree in co-relation 48008. Up to 6066 conditions per place. [2024-06-04 18:10:48,732 INFO L140 encePairwiseOnDemand]: 32/41 looper letters, 440 selfloop transitions, 34 changer transitions 0/477 dead transitions. [2024-06-04 18:10:48,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 477 transitions, 7659 flow [2024-06-04 18:10:48,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2024-06-04 18:10:48,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-04 18:10:48,734 INFO L175 Difference]: Start difference. First operand has 312 places, 456 transitions, 6615 flow. Second operand 8 states and 123 transitions. [2024-06-04 18:10:48,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 477 transitions, 7659 flow [2024-06-04 18:10:49,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 477 transitions, 7495 flow, removed 53 selfloop flow, removed 4 redundant places. [2024-06-04 18:10:49,694 INFO L231 Difference]: Finished difference. Result has 316 places, 458 transitions, 6572 flow [2024-06-04 18:10:49,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6451, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6572, PETRI_PLACES=316, PETRI_TRANSITIONS=458} [2024-06-04 18:10:49,695 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 274 predicate places. [2024-06-04 18:10:49,695 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 458 transitions, 6572 flow [2024-06-04 18:10:49,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 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-04 18:10:49,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:49,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:49,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-04 18:10:49,696 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:10:49,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:49,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1900521531, now seen corresponding path program 4 times [2024-06-04 18:10:49,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:49,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220483214] [2024-06-04 18:10:49,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:10:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:10:56,862 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-04 18:10:56,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:10:56,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220483214] [2024-06-04 18:10:56,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220483214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:10:56,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:10:56,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-04 18:10:56,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086533004] [2024-06-04 18:10:56,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:10:56,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-04 18:10:56,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:10:56,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-04 18:10:56,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-04 18:10:57,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:10:57,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 458 transitions, 6572 flow. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:57,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:10:57,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:10:57,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:10:58,856 INFO L124 PetriNetUnfolderBase]: 4035/6172 cut-off events. [2024-06-04 18:10:58,856 INFO L125 PetriNetUnfolderBase]: For 579972/579972 co-relation queries the response was YES. [2024-06-04 18:10:58,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48623 conditions, 6172 events. 4035/6172 cut-off events. For 579972/579972 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 35124 event pairs, 885 based on Foata normal form. 2/6172 useless extension candidates. Maximal degree in co-relation 48474. Up to 6084 conditions per place. [2024-06-04 18:10:58,927 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 449 selfloop transitions, 34 changer transitions 0/486 dead transitions. [2024-06-04 18:10:58,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 486 transitions, 7880 flow [2024-06-04 18:10:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:10:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:10:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 126 transitions. [2024-06-04 18:10:58,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38414634146341464 [2024-06-04 18:10:58,929 INFO L175 Difference]: Start difference. First operand has 316 places, 458 transitions, 6572 flow. Second operand 8 states and 126 transitions. [2024-06-04 18:10:58,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 486 transitions, 7880 flow [2024-06-04 18:10:59,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 486 transitions, 7755 flow, removed 28 selfloop flow, removed 7 redundant places. [2024-06-04 18:10:59,985 INFO L231 Difference]: Finished difference. Result has 317 places, 464 transitions, 6659 flow [2024-06-04 18:10:59,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6455, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=458, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6659, PETRI_PLACES=317, PETRI_TRANSITIONS=464} [2024-06-04 18:10:59,986 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 275 predicate places. [2024-06-04 18:10:59,986 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 464 transitions, 6659 flow [2024-06-04 18:10:59,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:10:59,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:10:59,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:10:59,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-04 18:10:59,987 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:10:59,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:10:59,987 INFO L85 PathProgramCache]: Analyzing trace with hash 2101589667, now seen corresponding path program 5 times [2024-06-04 18:10:59,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:10:59,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314058061] [2024-06-04 18:10:59,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:10:59,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:07,067 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-04 18:11:07,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:07,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314058061] [2024-06-04 18:11:07,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314058061] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:07,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:07,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:07,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223764288] [2024-06-04 18:11:07,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:07,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:07,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:07,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:07,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:07,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:11:07,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 464 transitions, 6659 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:07,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:07,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:11:07,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:09,001 INFO L124 PetriNetUnfolderBase]: 4045/6186 cut-off events. [2024-06-04 18:11:09,001 INFO L125 PetriNetUnfolderBase]: For 566329/566329 co-relation queries the response was YES. [2024-06-04 18:11:09,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48512 conditions, 6186 events. 4045/6186 cut-off events. For 566329/566329 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 35192 event pairs, 892 based on Foata normal form. 2/6186 useless extension candidates. Maximal degree in co-relation 48363. Up to 6131 conditions per place. [2024-06-04 18:11:09,075 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 452 selfloop transitions, 30 changer transitions 0/485 dead transitions. [2024-06-04 18:11:09,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 485 transitions, 7746 flow [2024-06-04 18:11:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-04 18:11:09,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-04 18:11:09,076 INFO L175 Difference]: Start difference. First operand has 317 places, 464 transitions, 6659 flow. Second operand 8 states and 120 transitions. [2024-06-04 18:11:09,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 485 transitions, 7746 flow [2024-06-04 18:11:10,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 485 transitions, 7631 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-06-04 18:11:10,133 INFO L231 Difference]: Finished difference. Result has 321 places, 468 transitions, 6693 flow [2024-06-04 18:11:10,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6557, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6693, PETRI_PLACES=321, PETRI_TRANSITIONS=468} [2024-06-04 18:11:10,134 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 279 predicate places. [2024-06-04 18:11:10,134 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 468 transitions, 6693 flow [2024-06-04 18:11:10,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:10,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:10,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:10,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-04 18:11:10,135 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:11:10,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:10,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1672620381, now seen corresponding path program 6 times [2024-06-04 18:11:10,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:10,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276014980] [2024-06-04 18:11:10,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:10,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:17,419 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-04 18:11:17,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:17,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276014980] [2024-06-04 18:11:17,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276014980] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:17,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:17,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:17,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432314593] [2024-06-04 18:11:17,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:17,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:17,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:17,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:17,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:17,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:11:17,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 468 transitions, 6693 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:17,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:17,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:11:17,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:19,375 INFO L124 PetriNetUnfolderBase]: 4055/6200 cut-off events. [2024-06-04 18:11:19,375 INFO L125 PetriNetUnfolderBase]: For 579921/579921 co-relation queries the response was YES. [2024-06-04 18:11:19,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48788 conditions, 6200 events. 4055/6200 cut-off events. For 579921/579921 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 35283 event pairs, 885 based on Foata normal form. 2/6200 useless extension candidates. Maximal degree in co-relation 48638. Up to 6047 conditions per place. [2024-06-04 18:11:19,441 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 444 selfloop transitions, 53 changer transitions 0/500 dead transitions. [2024-06-04 18:11:19,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 500 transitions, 8223 flow [2024-06-04 18:11:19,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 130 transitions. [2024-06-04 18:11:19,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39634146341463417 [2024-06-04 18:11:19,443 INFO L175 Difference]: Start difference. First operand has 321 places, 468 transitions, 6693 flow. Second operand 8 states and 130 transitions. [2024-06-04 18:11:19,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 500 transitions, 8223 flow [2024-06-04 18:11:20,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 500 transitions, 8127 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-04 18:11:20,518 INFO L231 Difference]: Finished difference. Result has 325 places, 476 transitions, 6892 flow [2024-06-04 18:11:20,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6597, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6892, PETRI_PLACES=325, PETRI_TRANSITIONS=476} [2024-06-04 18:11:20,519 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 283 predicate places. [2024-06-04 18:11:20,519 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 476 transitions, 6892 flow [2024-06-04 18:11:20,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:20,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:20,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:20,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-04 18:11:20,519 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:11:20,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1672740351, now seen corresponding path program 7 times [2024-06-04 18:11:20,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:20,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944776074] [2024-06-04 18:11:20,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:20,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:27,824 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-04 18:11:27,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:27,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944776074] [2024-06-04 18:11:27,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944776074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:27,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:27,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:27,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748159607] [2024-06-04 18:11:27,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:27,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:27,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:27,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:27,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:27,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:11:27,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 476 transitions, 6892 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:27,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:27,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:11:27,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:29,913 INFO L124 PetriNetUnfolderBase]: 4049/6192 cut-off events. [2024-06-04 18:11:29,914 INFO L125 PetriNetUnfolderBase]: For 588865/588865 co-relation queries the response was YES. [2024-06-04 18:11:29,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48935 conditions, 6192 events. 4049/6192 cut-off events. For 588865/588865 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 35239 event pairs, 891 based on Foata normal form. 2/6192 useless extension candidates. Maximal degree in co-relation 48783. Up to 6138 conditions per place. [2024-06-04 18:11:29,972 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 463 selfloop transitions, 28 changer transitions 0/494 dead transitions. [2024-06-04 18:11:29,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 494 transitions, 7951 flow [2024-06-04 18:11:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:29,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 120 transitions. [2024-06-04 18:11:29,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2024-06-04 18:11:29,974 INFO L175 Difference]: Start difference. First operand has 325 places, 476 transitions, 6892 flow. Second operand 8 states and 120 transitions. [2024-06-04 18:11:29,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 494 transitions, 7951 flow [2024-06-04 18:11:31,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 494 transitions, 7788 flow, removed 42 selfloop flow, removed 5 redundant places. [2024-06-04 18:11:31,038 INFO L231 Difference]: Finished difference. Result has 328 places, 477 transitions, 6824 flow [2024-06-04 18:11:31,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6735, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=476, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=448, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6824, PETRI_PLACES=328, PETRI_TRANSITIONS=477} [2024-06-04 18:11:31,039 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 286 predicate places. [2024-06-04 18:11:31,039 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 477 transitions, 6824 flow [2024-06-04 18:11:31,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:31,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:31,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:31,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-04 18:11:31,040 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:11:31,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1672740537, now seen corresponding path program 4 times [2024-06-04 18:11:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:31,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80044746] [2024-06-04 18:11:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:31,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:39,019 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-04 18:11:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80044746] [2024-06-04 18:11:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80044746] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:39,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:39,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:39,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024190337] [2024-06-04 18:11:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:39,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:39,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:39,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:39,107 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:11:39,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 477 transitions, 6824 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:39,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:39,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:11:39,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:40,951 INFO L124 PetriNetUnfolderBase]: 4035/6172 cut-off events. [2024-06-04 18:11:40,952 INFO L125 PetriNetUnfolderBase]: For 594916/594916 co-relation queries the response was YES. [2024-06-04 18:11:41,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48552 conditions, 6172 events. 4035/6172 cut-off events. For 594916/594916 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 35135 event pairs, 883 based on Foata normal form. 2/6172 useless extension candidates. Maximal degree in co-relation 48399. Up to 6062 conditions per place. [2024-06-04 18:11:41,030 INFO L140 encePairwiseOnDemand]: 31/41 looper letters, 440 selfloop transitions, 53 changer transitions 0/496 dead transitions. [2024-06-04 18:11:41,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 496 transitions, 8016 flow [2024-06-04 18:11:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2024-06-04 18:11:41,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871951219512195 [2024-06-04 18:11:41,032 INFO L175 Difference]: Start difference. First operand has 328 places, 477 transitions, 6824 flow. Second operand 8 states and 127 transitions. [2024-06-04 18:11:41,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 496 transitions, 8016 flow [2024-06-04 18:11:42,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 496 transitions, 7928 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-06-04 18:11:42,174 INFO L231 Difference]: Finished difference. Result has 331 places, 477 transitions, 6848 flow [2024-06-04 18:11:42,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6736, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6848, PETRI_PLACES=331, PETRI_TRANSITIONS=477} [2024-06-04 18:11:42,175 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 289 predicate places. [2024-06-04 18:11:42,175 INFO L495 AbstractCegarLoop]: Abstraction has has 331 places, 477 transitions, 6848 flow [2024-06-04 18:11:42,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:42,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:42,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:42,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-04 18:11:42,175 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:11:42,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:42,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2077907713, now seen corresponding path program 5 times [2024-06-04 18:11:42,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:42,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849196352] [2024-06-04 18:11:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:11:49,630 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-04 18:11:49,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:11:49,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849196352] [2024-06-04 18:11:49,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849196352] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:11:49,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:11:49,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:11:49,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729280322] [2024-06-04 18:11:49,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:11:49,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:11:49,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:11:49,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:11:49,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:11:49,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:11:49,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 477 transitions, 6848 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:49,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:11:49,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:11:49,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:11:51,575 INFO L124 PetriNetUnfolderBase]: 4045/6186 cut-off events. [2024-06-04 18:11:51,575 INFO L125 PetriNetUnfolderBase]: For 609042/609042 co-relation queries the response was YES. [2024-06-04 18:11:51,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48849 conditions, 6186 events. 4045/6186 cut-off events. For 609042/609042 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 35200 event pairs, 885 based on Foata normal form. 2/6186 useless extension candidates. Maximal degree in co-relation 48695. Up to 6123 conditions per place. [2024-06-04 18:11:51,646 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 453 selfloop transitions, 39 changer transitions 0/495 dead transitions. [2024-06-04 18:11:51,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 495 transitions, 7923 flow [2024-06-04 18:11:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-04 18:11:51,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-04 18:11:51,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-04 18:11:51,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36890243902439024 [2024-06-04 18:11:51,648 INFO L175 Difference]: Start difference. First operand has 331 places, 477 transitions, 6848 flow. Second operand 8 states and 121 transitions. [2024-06-04 18:11:51,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 495 transitions, 7923 flow [2024-06-04 18:11:52,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 495 transitions, 7361 flow, removed 16 selfloop flow, removed 12 redundant places. [2024-06-04 18:11:52,985 INFO L231 Difference]: Finished difference. Result has 328 places, 481 transitions, 6437 flow [2024-06-04 18:11:52,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6297, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6437, PETRI_PLACES=328, PETRI_TRANSITIONS=481} [2024-06-04 18:11:52,985 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 286 predicate places. [2024-06-04 18:11:52,986 INFO L495 AbstractCegarLoop]: Abstraction has has 328 places, 481 transitions, 6437 flow [2024-06-04 18:11:52,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:11:52,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:11:52,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:11:52,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-04 18:11:52,986 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:11:52,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:11:52,986 INFO L85 PathProgramCache]: Analyzing trace with hash 2107325545, now seen corresponding path program 8 times [2024-06-04 18:11:52,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:11:52,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197746899] [2024-06-04 18:11:52,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:11:52,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:11:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:00,312 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-04 18:12:00,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:00,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197746899] [2024-06-04 18:12:00,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197746899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:00,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:00,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:00,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675329459] [2024-06-04 18:12:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:00,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:00,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:00,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:00,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:00,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:12:00,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 481 transitions, 6437 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:00,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:00,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:12:00,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-04 18:12:02,308 INFO L124 PetriNetUnfolderBase]: 4076/6229 cut-off events. [2024-06-04 18:12:02,309 INFO L125 PetriNetUnfolderBase]: For 624623/624623 co-relation queries the response was YES. [2024-06-04 18:12:02,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48988 conditions, 6229 events. 4076/6229 cut-off events. For 624623/624623 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 35430 event pairs, 885 based on Foata normal form. 2/6229 useless extension candidates. Maximal degree in co-relation 48834. Up to 6177 conditions per place. [2024-06-04 18:12:02,369 INFO L140 encePairwiseOnDemand]: 30/41 looper letters, 476 selfloop transitions, 29 changer transitions 0/508 dead transitions. [2024-06-04 18:12:02,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 508 transitions, 7840 flow [2024-06-04 18:12:02,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-04 18:12:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-04 18:12:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 130 transitions. [2024-06-04 18:12:02,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3523035230352303 [2024-06-04 18:12:02,371 INFO L175 Difference]: Start difference. First operand has 328 places, 481 transitions, 6437 flow. Second operand 9 states and 130 transitions. [2024-06-04 18:12:02,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 508 transitions, 7840 flow [2024-06-04 18:12:03,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 508 transitions, 7774 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-04 18:12:03,528 INFO L231 Difference]: Finished difference. Result has 335 places, 491 transitions, 6652 flow [2024-06-04 18:12:03,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=6371, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6652, PETRI_PLACES=335, PETRI_TRANSITIONS=491} [2024-06-04 18:12:03,529 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 293 predicate places. [2024-06-04 18:12:03,529 INFO L495 AbstractCegarLoop]: Abstraction has has 335 places, 491 transitions, 6652 flow [2024-06-04 18:12:03,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:03,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-04 18:12:03,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-04 18:12:03,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-04 18:12:03,530 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-04 18:12:03,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-04 18:12:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash 525987569, now seen corresponding path program 9 times [2024-06-04 18:12:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-04 18:12:03,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243109896] [2024-06-04 18:12:03,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-04 18:12:03,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-04 18:12:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-04 18:12:11,157 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-04 18:12:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-04 18:12:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243109896] [2024-06-04 18:12:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243109896] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-04 18:12:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-04 18:12:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-04 18:12:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831777610] [2024-06-04 18:12:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-04 18:12:11,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-04 18:12:11,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-04 18:12:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-04 18:12:11,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-04 18:12:11,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 41 [2024-06-04 18:12:11,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 491 transitions, 6652 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-04 18:12:11,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-04 18:12:11,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 41 [2024-06-04 18:12:11,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15