./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:31:51,549 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:31:51,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:31:51,616 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:31:51,616 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:31:51,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:31:51,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:31:51,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:31:51,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:31:51,648 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:31:51,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:31:51,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:31:51,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:31:51,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:31:51,650 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:31:51,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:31:51,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:31:51,651 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:31:51,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:31:51,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:31:51,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:31:51,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:31:51,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:31:51,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:31:51,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:31:51,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:31:51,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:31:51,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:31:51,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:31:51,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:31:51,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:31:51,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:31:51,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:31:51,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:31:51,655 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:31:51,655 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:31:51,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:31:51,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:31:51,656 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:31:51,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:31:51,656 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:31:51,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:31:51,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:31:51,660 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:31:51,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:31:51,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:31:51,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:31:51,899 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:31:51,900 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:31:51,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.yml/witness.yml [2024-06-27 22:31:52,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:31:52,011 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:31:52,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-27 22:31:52,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:31:53,214 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:31:53,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-27 22:31:53,231 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ccacd31/72df043df74e4cacb0967a823204cf41/FLAGdfb9e87a2 [2024-06-27 22:31:53,246 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ccacd31/72df043df74e4cacb0967a823204cf41 [2024-06-27 22:31:53,246 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:31:53,247 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:31:53,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:31:53,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:31:53,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:31:53,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:31:52" (1/2) ... [2024-06-27 22:31:53,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2768a68f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:31:53, skipping insertion in model container [2024-06-27 22:31:53,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:31:52" (1/2) ... [2024-06-27 22:31:53,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54eb9986 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:31:53, skipping insertion in model container [2024-06-27 22:31:53,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:31:53" (2/2) ... [2024-06-27 22:31:53,258 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2768a68f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53, skipping insertion in model container [2024-06-27 22:31:53,258 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:31:53" (2/2) ... [2024-06-27 22:31:53,259 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:31:53,279 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:31:53,280 INFO L97 edCorrectnessWitness]: Location invariant before [L805-L805] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )y) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:31:53,281 INFO L97 edCorrectnessWitness]: Location invariant before [L806-L806] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )z >= 0LL && (0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )y) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y) + (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$w_buff0_used >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff0_used >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL) && (long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL) [2024-06-27 22:31:53,281 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:31:53,281 INFO L106 edCorrectnessWitness]: ghost_update [L803-L803] multithreaded = 1; [2024-06-27 22:31:53,319 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:31:53,447 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] [2024-06-27 22:31:53,595 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:31:53,605 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:31:53,634 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i[983,996] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:31:53,720 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:31:53,762 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:31:53,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53 WrapperNode [2024-06-27 22:31:53,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:31:53,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:31:53,764 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:31:53,764 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:31:53,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,796 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,830 INFO L138 Inliner]: procedures = 174, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-06-27 22:31:53,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:31:53,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:31:53,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:31:53,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:31:53,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,864 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 22:31:53,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,868 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,876 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:31:53,881 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:31:53,881 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:31:53,881 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:31:53,882 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (1/1) ... [2024-06-27 22:31:53,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:31:53,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:31:53,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:31:53,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:31:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:31:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:31:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:31:53,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:31:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:31:53,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:31:53,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:31:53,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:31:53,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:31:53,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:31:53,935 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:31:54,069 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:31:54,070 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:31:54,312 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:31:54,312 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:31:54,442 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:31:54,443 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:31:54,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:31:54 BoogieIcfgContainer [2024-06-27 22:31:54,443 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:31:54,445 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:31:54,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:31:54,448 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:31:54,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:31:52" (1/4) ... [2024-06-27 22:31:54,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5979b2d7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:31:54, skipping insertion in model container [2024-06-27 22:31:54,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:31:53" (2/4) ... [2024-06-27 22:31:54,449 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5979b2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:31:54, skipping insertion in model container [2024-06-27 22:31:54,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:31:53" (3/4) ... [2024-06-27 22:31:54,450 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5979b2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:31:54, skipping insertion in model container [2024-06-27 22:31:54,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:31:54" (4/4) ... [2024-06-27 22:31:54,451 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2024-06-27 22:31:54,463 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:31:54,463 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 22:31:54,463 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:31:54,501 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:31:54,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 37 transitions, 82 flow [2024-06-27 22:31:54,562 INFO L124 PetriNetUnfolderBase]: 1/35 cut-off events. [2024-06-27 22:31:54,563 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:31:54,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2024-06-27 22:31:54,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 37 transitions, 82 flow [2024-06-27 22:31:54,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 76 flow [2024-06-27 22:31:54,580 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:31:54,590 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;@1c590fed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:31:54,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 22:31:54,593 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:31:54,593 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:31:54,593 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:31:54,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:54,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:31:54,594 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:54,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:54,598 INFO L85 PathProgramCache]: Analyzing trace with hash 313150133, now seen corresponding path program 1 times [2024-06-27 22:31:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226540580] [2024-06-27 22:31:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:55,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:31:55,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226540580] [2024-06-27 22:31:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226540580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:55,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:55,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:31:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327529919] [2024-06-27 22:31:55,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:55,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:31:55,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:55,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:31:55,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:31:55,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 22:31:55,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:55,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:55,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 22:31:55,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:55,995 INFO L124 PetriNetUnfolderBase]: 529/1037 cut-off events. [2024-06-27 22:31:55,995 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-06-27 22:31:55,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 1037 events. 529/1037 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5821 event pairs, 424 based on Foata normal form. 42/980 useless extension candidates. Maximal degree in co-relation 1924. Up to 870 conditions per place. [2024-06-27 22:31:56,003 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 32 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2024-06-27 22:31:56,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 45 transitions, 169 flow [2024-06-27 22:31:56,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:31:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:31:56,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-06-27 22:31:56,012 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6846846846846847 [2024-06-27 22:31:56,013 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 76 flow. Second operand 3 states and 76 transitions. [2024-06-27 22:31:56,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 45 transitions, 169 flow [2024-06-27 22:31:56,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:31:56,020 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 95 flow [2024-06-27 22:31:56,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2024-06-27 22:31:56,024 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2024-06-27 22:31:56,024 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 95 flow [2024-06-27 22:31:56,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:56,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:56,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:56,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:31:56,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:56,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash 289967898, now seen corresponding path program 1 times [2024-06-27 22:31:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:56,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643772833] [2024-06-27 22:31:56,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:56,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:56,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-27 22:31:56,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:56,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643772833] [2024-06-27 22:31:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643772833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:56,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:31:56,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676207801] [2024-06-27 22:31:56,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:56,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:31:56,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:56,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:31:56,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:31:56,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-27 22:31:56,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 95 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:56,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:56,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-27 22:31:56,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:56,997 INFO L124 PetriNetUnfolderBase]: 593/1043 cut-off events. [2024-06-27 22:31:56,997 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2024-06-27 22:31:56,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2245 conditions, 1043 events. 593/1043 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5231 event pairs, 273 based on Foata normal form. 2/1004 useless extension candidates. Maximal degree in co-relation 2233. Up to 953 conditions per place. [2024-06-27 22:31:57,006 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 42 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-06-27 22:31:57,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 235 flow [2024-06-27 22:31:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:31:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:31:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2024-06-27 22:31:57,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6351351351351351 [2024-06-27 22:31:57,010 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 95 flow. Second operand 4 states and 94 transitions. [2024-06-27 22:31:57,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 235 flow [2024-06-27 22:31:57,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 56 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:31:57,011 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 121 flow [2024-06-27 22:31:57,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2024-06-27 22:31:57,012 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2024-06-27 22:31:57,012 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 121 flow [2024-06-27 22:31:57,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:57,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:57,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:57,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:31:57,013 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:57,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash 399071120, now seen corresponding path program 1 times [2024-06-27 22:31:57,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579261486] [2024-06-27 22:31:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:31:57,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:57,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579261486] [2024-06-27 22:31:57,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579261486] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:57,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:57,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:31:57,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488250011] [2024-06-27 22:31:57,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:57,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:31:57,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:57,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:31:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:31:57,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-27 22:31:57,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 121 flow. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:57,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:57,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-27 22:31:57,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:31:58,119 INFO L124 PetriNetUnfolderBase]: 567/1093 cut-off events. [2024-06-27 22:31:58,120 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2024-06-27 22:31:58,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2415 conditions, 1093 events. 567/1093 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5977 event pairs, 201 based on Foata normal form. 4/1034 useless extension candidates. Maximal degree in co-relation 2401. Up to 896 conditions per place. [2024-06-27 22:31:58,125 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 47 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2024-06-27 22:31:58,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 318 flow [2024-06-27 22:31:58,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:31:58,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:31:58,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-06-27 22:31:58,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 22:31:58,127 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 121 flow. Second operand 5 states and 111 transitions. [2024-06-27 22:31:58,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 318 flow [2024-06-27 22:31:58,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 66 transitions, 302 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 22:31:58,130 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 196 flow [2024-06-27 22:31:58,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-06-27 22:31:58,130 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2024-06-27 22:31:58,131 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 196 flow [2024-06-27 22:31:58,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:31:58,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:31:58,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:31:58,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:31:58,131 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:31:58,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:31:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1320148331, now seen corresponding path program 1 times [2024-06-27 22:31:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:31:58,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494077106] [2024-06-27 22:31:58,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:31:58,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:31:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:31:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:31:59,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:31:59,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494077106] [2024-06-27 22:31:59,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494077106] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:31:59,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:31:59,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:31:59,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850819916] [2024-06-27 22:31:59,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:31:59,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:31:59,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:31:59,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:31:59,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:31:59,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2024-06-27 22:31:59,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 196 flow. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-27 22:31:59,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:31:59,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2024-06-27 22:31:59,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:00,067 INFO L124 PetriNetUnfolderBase]: 548/1046 cut-off events. [2024-06-27 22:32:00,067 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2024-06-27 22:32:00,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2525 conditions, 1046 events. 548/1046 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5595 event pairs, 128 based on Foata normal form. 4/1001 useless extension candidates. Maximal degree in co-relation 2508. Up to 837 conditions per place. [2024-06-27 22:32:00,072 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 50 selfloop transitions, 12 changer transitions 0/71 dead transitions. [2024-06-27 22:32:00,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 376 flow [2024-06-27 22:32:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:32:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:32:00,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2024-06-27 22:32:00,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5720720720720721 [2024-06-27 22:32:00,075 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 196 flow. Second operand 6 states and 127 transitions. [2024-06-27 22:32:00,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 376 flow [2024-06-27 22:32:00,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 372 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 22:32:00,080 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 231 flow [2024-06-27 22:32:00,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2024-06-27 22:32:00,082 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2024-06-27 22:32:00,082 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 231 flow [2024-06-27 22:32:00,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 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-27 22:32:00,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:00,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:00,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:32:00,083 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:00,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:00,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1762631065, now seen corresponding path program 1 times [2024-06-27 22:32:00,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:00,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513026053] [2024-06-27 22:32:00,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:00,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:00,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:00,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513026053] [2024-06-27 22:32:00,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513026053] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:00,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:00,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:32:00,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123993099] [2024-06-27 22:32:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:00,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:32:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:00,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:32:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:32:00,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:00,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:00,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:00,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:00,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:00,964 INFO L124 PetriNetUnfolderBase]: 617/1160 cut-off events. [2024-06-27 22:32:00,965 INFO L125 PetriNetUnfolderBase]: For 1069/1069 co-relation queries the response was YES. [2024-06-27 22:32:00,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2943 conditions, 1160 events. 617/1160 cut-off events. For 1069/1069 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6120 event pairs, 392 based on Foata normal form. 1/1109 useless extension candidates. Maximal degree in co-relation 2922. Up to 1005 conditions per place. [2024-06-27 22:32:00,970 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 47 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-27 22:32:00,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 64 transitions, 408 flow [2024-06-27 22:32:00,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:32:00,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:32:00,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2024-06-27 22:32:00,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4369369369369369 [2024-06-27 22:32:00,972 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 231 flow. Second operand 6 states and 97 transitions. [2024-06-27 22:32:00,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 64 transitions, 408 flow [2024-06-27 22:32:00,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 373 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:00,974 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 286 flow [2024-06-27 22:32:00,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=286, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2024-06-27 22:32:00,975 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2024-06-27 22:32:00,975 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 286 flow [2024-06-27 22:32:00,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:00,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:00,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:00,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:32:00,976 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:00,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1057374618, now seen corresponding path program 1 times [2024-06-27 22:32:00,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:00,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764081215] [2024-06-27 22:32:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:01,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:01,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764081215] [2024-06-27 22:32:01,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764081215] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:01,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:01,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:32:01,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334141726] [2024-06-27 22:32:01,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:01,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:32:01,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:32:01,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:32:01,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:01,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 286 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:01,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:01,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:01,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:01,973 INFO L124 PetriNetUnfolderBase]: 634/1189 cut-off events. [2024-06-27 22:32:01,973 INFO L125 PetriNetUnfolderBase]: For 1224/1224 co-relation queries the response was YES. [2024-06-27 22:32:01,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3181 conditions, 1189 events. 634/1189 cut-off events. For 1224/1224 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6259 event pairs, 366 based on Foata normal form. 1/1137 useless extension candidates. Maximal degree in co-relation 3156. Up to 1014 conditions per place. [2024-06-27 22:32:01,979 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 59 selfloop transitions, 17 changer transitions 0/83 dead transitions. [2024-06-27 22:32:01,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 83 transitions, 532 flow [2024-06-27 22:32:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:01,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2024-06-27 22:32:01,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4671814671814672 [2024-06-27 22:32:01,981 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 286 flow. Second operand 7 states and 121 transitions. [2024-06-27 22:32:01,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 83 transitions, 532 flow [2024-06-27 22:32:01,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 83 transitions, 528 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 22:32:01,984 INFO L231 Difference]: Finished difference. Result has 66 places, 67 transitions, 399 flow [2024-06-27 22:32:01,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=399, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2024-06-27 22:32:01,985 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2024-06-27 22:32:01,985 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 399 flow [2024-06-27 22:32:01,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:01,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:01,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:01,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:32:01,986 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:01,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:01,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1677039226, now seen corresponding path program 2 times [2024-06-27 22:32:01,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:01,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049937693] [2024-06-27 22:32:01,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:01,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:02,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:02,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049937693] [2024-06-27 22:32:02,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049937693] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:02,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:02,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:32:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998744786] [2024-06-27 22:32:02,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:02,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:32:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:32:02,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:32:02,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:02,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 399 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:02,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:02,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:02,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:02,990 INFO L124 PetriNetUnfolderBase]: 650/1216 cut-off events. [2024-06-27 22:32:02,991 INFO L125 PetriNetUnfolderBase]: For 1915/1915 co-relation queries the response was YES. [2024-06-27 22:32:02,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3578 conditions, 1216 events. 650/1216 cut-off events. For 1915/1915 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6441 event pairs, 362 based on Foata normal form. 1/1163 useless extension candidates. Maximal degree in co-relation 3549. Up to 1034 conditions per place. [2024-06-27 22:32:02,997 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 58 selfloop transitions, 23 changer transitions 0/88 dead transitions. [2024-06-27 22:32:02,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 667 flow [2024-06-27 22:32:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:32:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:32:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-27 22:32:02,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-27 22:32:02,998 INFO L175 Difference]: Start difference. First operand has 66 places, 67 transitions, 399 flow. Second operand 6 states and 106 transitions. [2024-06-27 22:32:02,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 667 flow [2024-06-27 22:32:03,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 88 transitions, 640 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:03,003 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 516 flow [2024-06-27 22:32:03,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=516, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2024-06-27 22:32:03,003 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2024-06-27 22:32:03,004 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 516 flow [2024-06-27 22:32:03,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:03,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:03,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:03,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:32:03,004 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:03,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:03,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1671295546, now seen corresponding path program 3 times [2024-06-27 22:32:03,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:03,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086392527] [2024-06-27 22:32:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:03,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:03,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086392527] [2024-06-27 22:32:03,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086392527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:03,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:03,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:32:03,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611923748] [2024-06-27 22:32:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:03,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:32:03,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:03,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:32:03,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:32:03,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:03,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 516 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:03,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:03,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:03,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:04,016 INFO L124 PetriNetUnfolderBase]: 648/1214 cut-off events. [2024-06-27 22:32:04,017 INFO L125 PetriNetUnfolderBase]: For 2595/2595 co-relation queries the response was YES. [2024-06-27 22:32:04,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3797 conditions, 1214 events. 648/1214 cut-off events. For 2595/2595 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6418 event pairs, 366 based on Foata normal form. 1/1163 useless extension candidates. Maximal degree in co-relation 3766. Up to 1010 conditions per place. [2024-06-27 22:32:04,023 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 53 selfloop transitions, 31 changer transitions 0/91 dead transitions. [2024-06-27 22:32:04,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 738 flow [2024-06-27 22:32:04,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2024-06-27 22:32:04,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.444015444015444 [2024-06-27 22:32:04,024 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 516 flow. Second operand 7 states and 115 transitions. [2024-06-27 22:32:04,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 738 flow [2024-06-27 22:32:04,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 715 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-06-27 22:32:04,029 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 591 flow [2024-06-27 22:32:04,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=591, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2024-06-27 22:32:04,032 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 35 predicate places. [2024-06-27 22:32:04,032 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 591 flow [2024-06-27 22:32:04,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:04,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:04,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:04,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:32:04,033 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:04,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:04,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1671286618, now seen corresponding path program 1 times [2024-06-27 22:32:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:04,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168135870] [2024-06-27 22:32:04,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:04,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:04,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168135870] [2024-06-27 22:32:04,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168135870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:04,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:04,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:04,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102803897] [2024-06-27 22:32:04,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:04,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:04,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:04,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:05,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:05,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 591 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:05,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:05,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:05,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:05,279 INFO L124 PetriNetUnfolderBase]: 662/1239 cut-off events. [2024-06-27 22:32:05,280 INFO L125 PetriNetUnfolderBase]: For 3165/3165 co-relation queries the response was YES. [2024-06-27 22:32:05,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4071 conditions, 1239 events. 662/1239 cut-off events. For 3165/3165 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6522 event pairs, 371 based on Foata normal form. 1/1191 useless extension candidates. Maximal degree in co-relation 4037. Up to 1059 conditions per place. [2024-06-27 22:32:05,287 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 77 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-06-27 22:32:05,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 100 transitions, 850 flow [2024-06-27 22:32:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-27 22:32:05,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4555984555984556 [2024-06-27 22:32:05,289 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 591 flow. Second operand 7 states and 118 transitions. [2024-06-27 22:32:05,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 100 transitions, 850 flow [2024-06-27 22:32:05,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 100 transitions, 784 flow, removed 9 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:05,296 INFO L231 Difference]: Finished difference. Result has 80 places, 86 transitions, 610 flow [2024-06-27 22:32:05,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=610, PETRI_PLACES=80, PETRI_TRANSITIONS=86} [2024-06-27 22:32:05,297 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 39 predicate places. [2024-06-27 22:32:05,297 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 86 transitions, 610 flow [2024-06-27 22:32:05,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:05,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:05,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:05,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:32:05,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:05,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash -586035280, now seen corresponding path program 1 times [2024-06-27 22:32:05,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:05,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347596357] [2024-06-27 22:32:05,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:05,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:05,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:05,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347596357] [2024-06-27 22:32:05,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347596357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:05,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:05,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517736799] [2024-06-27 22:32:05,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:05,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:05,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:05,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:05,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:05,970 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:05,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 86 transitions, 610 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:05,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:05,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:05,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:06,310 INFO L124 PetriNetUnfolderBase]: 706/1341 cut-off events. [2024-06-27 22:32:06,310 INFO L125 PetriNetUnfolderBase]: For 4156/4156 co-relation queries the response was YES. [2024-06-27 22:32:06,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4528 conditions, 1341 events. 706/1341 cut-off events. For 4156/4156 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 7323 event pairs, 203 based on Foata normal form. 1/1284 useless extension candidates. Maximal degree in co-relation 4492. Up to 1067 conditions per place. [2024-06-27 22:32:06,319 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 81 selfloop transitions, 33 changer transitions 0/122 dead transitions. [2024-06-27 22:32:06,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 122 transitions, 993 flow [2024-06-27 22:32:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2024-06-27 22:32:06,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 22:32:06,321 INFO L175 Difference]: Start difference. First operand has 80 places, 86 transitions, 610 flow. Second operand 8 states and 144 transitions. [2024-06-27 22:32:06,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 122 transitions, 993 flow [2024-06-27 22:32:06,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 122 transitions, 955 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:06,328 INFO L231 Difference]: Finished difference. Result has 85 places, 100 transitions, 760 flow [2024-06-27 22:32:06,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=760, PETRI_PLACES=85, PETRI_TRANSITIONS=100} [2024-06-27 22:32:06,328 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 44 predicate places. [2024-06-27 22:32:06,329 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 100 transitions, 760 flow [2024-06-27 22:32:06,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:06,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:06,329 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:06,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:32:06,329 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:06,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:06,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1573682904, now seen corresponding path program 2 times [2024-06-27 22:32:06,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:06,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834092332] [2024-06-27 22:32:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:07,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:07,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834092332] [2024-06-27 22:32:07,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834092332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:07,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:07,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:07,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495486637] [2024-06-27 22:32:07,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:07,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:07,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:07,073 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:07,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 100 transitions, 760 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:07,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:07,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:07,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:07,457 INFO L124 PetriNetUnfolderBase]: 769/1441 cut-off events. [2024-06-27 22:32:07,458 INFO L125 PetriNetUnfolderBase]: For 5601/5616 co-relation queries the response was YES. [2024-06-27 22:32:07,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5319 conditions, 1441 events. 769/1441 cut-off events. For 5601/5616 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 7803 event pairs, 239 based on Foata normal form. 1/1382 useless extension candidates. Maximal degree in co-relation 5281. Up to 1139 conditions per place. [2024-06-27 22:32:07,467 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 89 selfloop transitions, 47 changer transitions 0/144 dead transitions. [2024-06-27 22:32:07,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 144 transitions, 1314 flow [2024-06-27 22:32:07,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-06-27 22:32:07,471 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2024-06-27 22:32:07,471 INFO L175 Difference]: Start difference. First operand has 85 places, 100 transitions, 760 flow. Second operand 8 states and 146 transitions. [2024-06-27 22:32:07,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 144 transitions, 1314 flow [2024-06-27 22:32:07,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 144 transitions, 1205 flow, removed 50 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:07,482 INFO L231 Difference]: Finished difference. Result has 94 places, 123 transitions, 1048 flow [2024-06-27 22:32:07,482 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1048, PETRI_PLACES=94, PETRI_TRANSITIONS=123} [2024-06-27 22:32:07,483 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 53 predicate places. [2024-06-27 22:32:07,483 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 123 transitions, 1048 flow [2024-06-27 22:32:07,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:07,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:07,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:07,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:32:07,484 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:07,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1573688484, now seen corresponding path program 3 times [2024-06-27 22:32:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289633766] [2024-06-27 22:32:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:07,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:08,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:08,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289633766] [2024-06-27 22:32:08,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289633766] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:08,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:08,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135661852] [2024-06-27 22:32:08,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:08,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:08,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:08,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:08,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:08,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:08,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 123 transitions, 1048 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:08,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:08,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:08,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:08,720 INFO L124 PetriNetUnfolderBase]: 781/1471 cut-off events. [2024-06-27 22:32:08,720 INFO L125 PetriNetUnfolderBase]: For 7038/7058 co-relation queries the response was YES. [2024-06-27 22:32:08,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 1471 events. 781/1471 cut-off events. For 7038/7058 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8037 event pairs, 236 based on Foata normal form. 9/1418 useless extension candidates. Maximal degree in co-relation 5870. Up to 1117 conditions per place. [2024-06-27 22:32:08,730 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 88 selfloop transitions, 59 changer transitions 0/155 dead transitions. [2024-06-27 22:32:08,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 155 transitions, 1546 flow [2024-06-27 22:32:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:08,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:08,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 22:32:08,733 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-27 22:32:08,733 INFO L175 Difference]: Start difference. First operand has 94 places, 123 transitions, 1048 flow. Second operand 8 states and 148 transitions. [2024-06-27 22:32:08,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 155 transitions, 1546 flow [2024-06-27 22:32:08,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 155 transitions, 1473 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:08,743 INFO L231 Difference]: Finished difference. Result has 100 places, 133 transitions, 1253 flow [2024-06-27 22:32:08,743 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=983, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1253, PETRI_PLACES=100, PETRI_TRANSITIONS=133} [2024-06-27 22:32:08,744 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 59 predicate places. [2024-06-27 22:32:08,744 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 133 transitions, 1253 flow [2024-06-27 22:32:08,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:08,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:08,744 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:08,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:32:08,745 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:08,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1241596764, now seen corresponding path program 4 times [2024-06-27 22:32:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:08,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494274779] [2024-06-27 22:32:08,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:08,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494274779] [2024-06-27 22:32:09,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494274779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:09,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:09,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:09,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822200205] [2024-06-27 22:32:09,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:09,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:09,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:09,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:09,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:09,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 133 transitions, 1253 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:09,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:09,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:09,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:09,887 INFO L124 PetriNetUnfolderBase]: 839/1557 cut-off events. [2024-06-27 22:32:09,887 INFO L125 PetriNetUnfolderBase]: For 9515/9539 co-relation queries the response was YES. [2024-06-27 22:32:09,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6900 conditions, 1557 events. 839/1557 cut-off events. For 9515/9539 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8584 event pairs, 197 based on Foata normal form. 5/1501 useless extension candidates. Maximal degree in co-relation 6855. Up to 1226 conditions per place. [2024-06-27 22:32:09,898 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 107 selfloop transitions, 60 changer transitions 0/175 dead transitions. [2024-06-27 22:32:09,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 175 transitions, 1925 flow [2024-06-27 22:32:09,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 22:32:09,900 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2024-06-27 22:32:09,900 INFO L175 Difference]: Start difference. First operand has 100 places, 133 transitions, 1253 flow. Second operand 8 states and 141 transitions. [2024-06-27 22:32:09,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 175 transitions, 1925 flow [2024-06-27 22:32:09,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 175 transitions, 1789 flow, removed 26 selfloop flow, removed 5 redundant places. [2024-06-27 22:32:09,917 INFO L231 Difference]: Finished difference. Result has 105 places, 159 transitions, 1612 flow [2024-06-27 22:32:09,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1141, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1612, PETRI_PLACES=105, PETRI_TRANSITIONS=159} [2024-06-27 22:32:09,918 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 64 predicate places. [2024-06-27 22:32:09,918 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 159 transitions, 1612 flow [2024-06-27 22:32:09,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:09,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:09,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:09,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:32:09,919 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:09,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:09,919 INFO L85 PathProgramCache]: Analyzing trace with hash -448607040, now seen corresponding path program 5 times [2024-06-27 22:32:09,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:09,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463630174] [2024-06-27 22:32:09,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:09,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:10,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:10,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463630174] [2024-06-27 22:32:10,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463630174] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:10,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:10,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152436743] [2024-06-27 22:32:10,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:10,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:10,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:10,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:10,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:10,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:10,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 159 transitions, 1612 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:10,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:10,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:10,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:11,173 INFO L124 PetriNetUnfolderBase]: 876/1630 cut-off events. [2024-06-27 22:32:11,173 INFO L125 PetriNetUnfolderBase]: For 10916/10936 co-relation queries the response was YES. [2024-06-27 22:32:11,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7511 conditions, 1630 events. 876/1630 cut-off events. For 10916/10936 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9092 event pairs, 199 based on Foata normal form. 5/1573 useless extension candidates. Maximal degree in co-relation 7463. Up to 1245 conditions per place. [2024-06-27 22:32:11,183 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 112 selfloop transitions, 76 changer transitions 0/196 dead transitions. [2024-06-27 22:32:11,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 196 transitions, 2289 flow [2024-06-27 22:32:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:11,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 22:32:11,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173745173745173 [2024-06-27 22:32:11,185 INFO L175 Difference]: Start difference. First operand has 105 places, 159 transitions, 1612 flow. Second operand 7 states and 134 transitions. [2024-06-27 22:32:11,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 196 transitions, 2289 flow [2024-06-27 22:32:11,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 196 transitions, 2227 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:11,204 INFO L231 Difference]: Finished difference. Result has 111 places, 179 transitions, 2005 flow [2024-06-27 22:32:11,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2005, PETRI_PLACES=111, PETRI_TRANSITIONS=179} [2024-06-27 22:32:11,205 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 70 predicate places. [2024-06-27 22:32:11,205 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 179 transitions, 2005 flow [2024-06-27 22:32:11,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:11,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:11,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:11,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:32:11,205 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:11,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:11,206 INFO L85 PathProgramCache]: Analyzing trace with hash -270552960, now seen corresponding path program 6 times [2024-06-27 22:32:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056289348] [2024-06-27 22:32:11,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:11,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:11,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056289348] [2024-06-27 22:32:11,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056289348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:11,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:11,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:11,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151271331] [2024-06-27 22:32:11,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:11,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:11,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:11,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:11,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:12,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:12,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 179 transitions, 2005 flow. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:12,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:12,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:12,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:12,398 INFO L124 PetriNetUnfolderBase]: 879/1635 cut-off events. [2024-06-27 22:32:12,398 INFO L125 PetriNetUnfolderBase]: For 13775/13795 co-relation queries the response was YES. [2024-06-27 22:32:12,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8093 conditions, 1635 events. 879/1635 cut-off events. For 13775/13795 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9135 event pairs, 198 based on Foata normal form. 6/1579 useless extension candidates. Maximal degree in co-relation 8042. Up to 1167 conditions per place. [2024-06-27 22:32:12,410 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 87 selfloop transitions, 109 changer transitions 0/204 dead transitions. [2024-06-27 22:32:12,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 204 transitions, 2621 flow [2024-06-27 22:32:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:12,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 22:32:12,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2024-06-27 22:32:12,411 INFO L175 Difference]: Start difference. First operand has 111 places, 179 transitions, 2005 flow. Second operand 8 states and 141 transitions. [2024-06-27 22:32:12,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 204 transitions, 2621 flow [2024-06-27 22:32:12,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 204 transitions, 2535 flow, removed 20 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:12,436 INFO L231 Difference]: Finished difference. Result has 118 places, 189 transitions, 2393 flow [2024-06-27 22:32:12,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2393, PETRI_PLACES=118, PETRI_TRANSITIONS=189} [2024-06-27 22:32:12,438 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 77 predicate places. [2024-06-27 22:32:12,438 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 189 transitions, 2393 flow [2024-06-27 22:32:12,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:12,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:12,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:12,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:32:12,439 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:12,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1188784313, now seen corresponding path program 1 times [2024-06-27 22:32:12,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:12,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291804054] [2024-06-27 22:32:12,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:12,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291804054] [2024-06-27 22:32:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291804054] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:13,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461255306] [2024-06-27 22:32:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:13,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:13,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:13,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:13,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:13,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 22:32:13,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 189 transitions, 2393 flow. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:13,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:13,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 22:32:13,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:13,637 INFO L124 PetriNetUnfolderBase]: 851/1626 cut-off events. [2024-06-27 22:32:13,637 INFO L125 PetriNetUnfolderBase]: For 15999/16036 co-relation queries the response was YES. [2024-06-27 22:32:13,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8768 conditions, 1626 events. 851/1626 cut-off events. For 15999/16036 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 9330 event pairs, 221 based on Foata normal form. 35/1601 useless extension candidates. Maximal degree in co-relation 8713. Up to 1194 conditions per place. [2024-06-27 22:32:13,650 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 118 selfloop transitions, 89 changer transitions 0/232 dead transitions. [2024-06-27 22:32:13,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 232 transitions, 3267 flow [2024-06-27 22:32:13,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2024-06-27 22:32:13,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5096525096525096 [2024-06-27 22:32:13,651 INFO L175 Difference]: Start difference. First operand has 118 places, 189 transitions, 2393 flow. Second operand 7 states and 132 transitions. [2024-06-27 22:32:13,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 232 transitions, 3267 flow [2024-06-27 22:32:13,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 232 transitions, 3129 flow, removed 45 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:13,688 INFO L231 Difference]: Finished difference. Result has 124 places, 212 transitions, 2940 flow [2024-06-27 22:32:13,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2261, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2940, PETRI_PLACES=124, PETRI_TRANSITIONS=212} [2024-06-27 22:32:13,689 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 83 predicate places. [2024-06-27 22:32:13,689 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 212 transitions, 2940 flow [2024-06-27 22:32:13,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:13,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:13,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:13,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:32:13,691 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:13,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash -994752331, now seen corresponding path program 2 times [2024-06-27 22:32:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:13,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306596698] [2024-06-27 22:32:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:14,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:14,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:14,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306596698] [2024-06-27 22:32:14,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306596698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:14,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:14,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:14,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381063741] [2024-06-27 22:32:14,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:14,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:14,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:14,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:14,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:14,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:14,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 212 transitions, 2940 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:14,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:14,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:14,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:15,156 INFO L124 PetriNetUnfolderBase]: 965/1789 cut-off events. [2024-06-27 22:32:15,156 INFO L125 PetriNetUnfolderBase]: For 20441/20461 co-relation queries the response was YES. [2024-06-27 22:32:15,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10567 conditions, 1789 events. 965/1789 cut-off events. For 20441/20461 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10168 event pairs, 274 based on Foata normal form. 5/1730 useless extension candidates. Maximal degree in co-relation 10508. Up to 1376 conditions per place. [2024-06-27 22:32:15,170 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 151 selfloop transitions, 98 changer transitions 0/257 dead transitions. [2024-06-27 22:32:15,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 257 transitions, 3943 flow [2024-06-27 22:32:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 22:32:15,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4966216216216216 [2024-06-27 22:32:15,175 INFO L175 Difference]: Start difference. First operand has 124 places, 212 transitions, 2940 flow. Second operand 8 states and 147 transitions. [2024-06-27 22:32:15,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 257 transitions, 3943 flow [2024-06-27 22:32:15,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 257 transitions, 3814 flow, removed 24 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:15,221 INFO L231 Difference]: Finished difference. Result has 130 places, 236 transitions, 3523 flow [2024-06-27 22:32:15,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=2841, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3523, PETRI_PLACES=130, PETRI_TRANSITIONS=236} [2024-06-27 22:32:15,221 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 89 predicate places. [2024-06-27 22:32:15,222 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 236 transitions, 3523 flow [2024-06-27 22:32:15,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:15,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:15,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:15,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:32:15,222 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:15,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:15,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1535865153, now seen corresponding path program 3 times [2024-06-27 22:32:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004622205] [2024-06-27 22:32:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:16,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-27 22:32:16,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:16,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004622205] [2024-06-27 22:32:16,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004622205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:16,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:16,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:16,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155372302] [2024-06-27 22:32:16,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:16,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:16,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:16,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:16,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:16,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:16,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 236 transitions, 3523 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:16,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:16,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:16,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:16,776 INFO L124 PetriNetUnfolderBase]: 986/1812 cut-off events. [2024-06-27 22:32:16,776 INFO L125 PetriNetUnfolderBase]: For 22436/22445 co-relation queries the response was YES. [2024-06-27 22:32:16,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11016 conditions, 1812 events. 986/1812 cut-off events. For 22436/22445 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10202 event pairs, 238 based on Foata normal form. 1/1752 useless extension candidates. Maximal degree in co-relation 10955. Up to 1400 conditions per place. [2024-06-27 22:32:16,788 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 169 selfloop transitions, 107 changer transitions 0/284 dead transitions. [2024-06-27 22:32:16,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 284 transitions, 4650 flow [2024-06-27 22:32:16,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2024-06-27 22:32:16,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5366795366795367 [2024-06-27 22:32:16,790 INFO L175 Difference]: Start difference. First operand has 130 places, 236 transitions, 3523 flow. Second operand 7 states and 139 transitions. [2024-06-27 22:32:16,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 284 transitions, 4650 flow [2024-06-27 22:32:16,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 284 transitions, 4399 flow, removed 79 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:16,836 INFO L231 Difference]: Finished difference. Result has 134 places, 264 transitions, 4112 flow [2024-06-27 22:32:16,836 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3339, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4112, PETRI_PLACES=134, PETRI_TRANSITIONS=264} [2024-06-27 22:32:16,837 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 93 predicate places. [2024-06-27 22:32:16,837 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 264 transitions, 4112 flow [2024-06-27 22:32:16,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:16,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:16,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:16,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:32:16,838 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:16,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:16,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1539711137, now seen corresponding path program 1 times [2024-06-27 22:32:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129085422] [2024-06-27 22:32:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:16,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:17,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:17,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129085422] [2024-06-27 22:32:17,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129085422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:17,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:17,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915990677] [2024-06-27 22:32:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:17,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:17,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:17,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:17,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:17,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 264 transitions, 4112 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:17,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:17,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:17,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:18,182 INFO L124 PetriNetUnfolderBase]: 1218/2099 cut-off events. [2024-06-27 22:32:18,182 INFO L125 PetriNetUnfolderBase]: For 25167/25167 co-relation queries the response was YES. [2024-06-27 22:32:18,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12888 conditions, 2099 events. 1218/2099 cut-off events. For 25167/25167 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11252 event pairs, 385 based on Foata normal form. 1/2038 useless extension candidates. Maximal degree in co-relation 12827. Up to 1877 conditions per place. [2024-06-27 22:32:18,197 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 257 selfloop transitions, 31 changer transitions 0/294 dead transitions. [2024-06-27 22:32:18,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 294 transitions, 4873 flow [2024-06-27 22:32:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:18,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:18,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2024-06-27 22:32:18,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4560810810810811 [2024-06-27 22:32:18,199 INFO L175 Difference]: Start difference. First operand has 134 places, 264 transitions, 4112 flow. Second operand 8 states and 135 transitions. [2024-06-27 22:32:18,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 294 transitions, 4873 flow [2024-06-27 22:32:18,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 294 transitions, 4730 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:18,257 INFO L231 Difference]: Finished difference. Result has 140 places, 272 transitions, 4158 flow [2024-06-27 22:32:18,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3969, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4158, PETRI_PLACES=140, PETRI_TRANSITIONS=272} [2024-06-27 22:32:18,258 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 99 predicate places. [2024-06-27 22:32:18,258 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 272 transitions, 4158 flow [2024-06-27 22:32:18,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:18,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:18,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:18,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:32:18,259 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:18,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:18,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1025753947, now seen corresponding path program 4 times [2024-06-27 22:32:18,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899023907] [2024-06-27 22:32:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:19,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:19,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899023907] [2024-06-27 22:32:19,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899023907] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:19,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:19,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:19,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760758121] [2024-06-27 22:32:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:19,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:19,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:19,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:19,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:19,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:19,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 272 transitions, 4158 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:19,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:19,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:19,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:19,789 INFO L124 PetriNetUnfolderBase]: 1025/1877 cut-off events. [2024-06-27 22:32:19,789 INFO L125 PetriNetUnfolderBase]: For 26057/26089 co-relation queries the response was YES. [2024-06-27 22:32:19,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11817 conditions, 1877 events. 1025/1877 cut-off events. For 26057/26089 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10687 event pairs, 216 based on Foata normal form. 6/1819 useless extension candidates. Maximal degree in co-relation 11754. Up to 1446 conditions per place. [2024-06-27 22:32:19,820 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 193 selfloop transitions, 105 changer transitions 0/307 dead transitions. [2024-06-27 22:32:19,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 307 transitions, 5136 flow [2024-06-27 22:32:19,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 22:32:19,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47635135135135137 [2024-06-27 22:32:19,822 INFO L175 Difference]: Start difference. First operand has 140 places, 272 transitions, 4158 flow. Second operand 8 states and 141 transitions. [2024-06-27 22:32:19,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 307 transitions, 5136 flow [2024-06-27 22:32:19,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 307 transitions, 5015 flow, removed 33 selfloop flow, removed 5 redundant places. [2024-06-27 22:32:19,879 INFO L231 Difference]: Finished difference. Result has 143 places, 289 transitions, 4630 flow [2024-06-27 22:32:19,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4043, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4630, PETRI_PLACES=143, PETRI_TRANSITIONS=289} [2024-06-27 22:32:19,879 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 102 predicate places. [2024-06-27 22:32:19,879 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 289 transitions, 4630 flow [2024-06-27 22:32:19,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:19,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:19,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:19,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:32:19,881 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:19,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:19,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1021914907, now seen corresponding path program 5 times [2024-06-27 22:32:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:19,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968406986] [2024-06-27 22:32:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:20,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:20,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968406986] [2024-06-27 22:32:20,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968406986] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:20,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:20,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:20,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887172168] [2024-06-27 22:32:20,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:20,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:20,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:20,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:20,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:21,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:21,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 289 transitions, 4630 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:21,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:21,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:21,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:21,584 INFO L124 PetriNetUnfolderBase]: 1032/1894 cut-off events. [2024-06-27 22:32:21,584 INFO L125 PetriNetUnfolderBase]: For 29113/29145 co-relation queries the response was YES. [2024-06-27 22:32:21,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12348 conditions, 1894 events. 1032/1894 cut-off events. For 29113/29145 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10818 event pairs, 219 based on Foata normal form. 17/1846 useless extension candidates. Maximal degree in co-relation 12283. Up to 1435 conditions per place. [2024-06-27 22:32:21,601 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 185 selfloop transitions, 123 changer transitions 0/317 dead transitions. [2024-06-27 22:32:21,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 317 transitions, 5490 flow [2024-06-27 22:32:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-06-27 22:32:21,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744744744744745 [2024-06-27 22:32:21,602 INFO L175 Difference]: Start difference. First operand has 143 places, 289 transitions, 4630 flow. Second operand 9 states and 158 transitions. [2024-06-27 22:32:21,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 317 transitions, 5490 flow [2024-06-27 22:32:21,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 317 transitions, 5327 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:21,664 INFO L231 Difference]: Finished difference. Result has 148 places, 296 transitions, 4882 flow [2024-06-27 22:32:21,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4467, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4882, PETRI_PLACES=148, PETRI_TRANSITIONS=296} [2024-06-27 22:32:21,666 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 107 predicate places. [2024-06-27 22:32:21,666 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 296 transitions, 4882 flow [2024-06-27 22:32:21,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:21,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:21,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:21,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:32:21,667 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:21,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:21,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1021907963, now seen corresponding path program 2 times [2024-06-27 22:32:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:21,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529890814] [2024-06-27 22:32:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:22,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:22,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:22,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529890814] [2024-06-27 22:32:22,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529890814] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:22,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:22,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:22,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631513018] [2024-06-27 22:32:22,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:22,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:22,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:22,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:22,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:22,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:22,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 296 transitions, 4882 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:22,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:22,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:22,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:23,137 INFO L124 PetriNetUnfolderBase]: 1294/2210 cut-off events. [2024-06-27 22:32:23,138 INFO L125 PetriNetUnfolderBase]: For 33413/33413 co-relation queries the response was YES. [2024-06-27 22:32:23,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14622 conditions, 2210 events. 1294/2210 cut-off events. For 33413/33413 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11889 event pairs, 377 based on Foata normal form. 1/2149 useless extension candidates. Maximal degree in co-relation 14556. Up to 1990 conditions per place. [2024-06-27 22:32:23,157 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 282 selfloop transitions, 35 changer transitions 0/323 dead transitions. [2024-06-27 22:32:23,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 323 transitions, 5679 flow [2024-06-27 22:32:23,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-27 22:32:23,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358108108108108 [2024-06-27 22:32:23,159 INFO L175 Difference]: Start difference. First operand has 148 places, 296 transitions, 4882 flow. Second operand 8 states and 129 transitions. [2024-06-27 22:32:23,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 323 transitions, 5679 flow [2024-06-27 22:32:23,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 323 transitions, 5381 flow, removed 59 selfloop flow, removed 6 redundant places. [2024-06-27 22:32:23,234 INFO L231 Difference]: Finished difference. Result has 151 places, 306 transitions, 4789 flow [2024-06-27 22:32:23,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4586, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4789, PETRI_PLACES=151, PETRI_TRANSITIONS=306} [2024-06-27 22:32:23,235 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 110 predicate places. [2024-06-27 22:32:23,235 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 306 transitions, 4789 flow [2024-06-27 22:32:23,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:23,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:23,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:23,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:32:23,236 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:23,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash 203031861, now seen corresponding path program 3 times [2024-06-27 22:32:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087850505] [2024-06-27 22:32:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:24,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:24,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087850505] [2024-06-27 22:32:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087850505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:24,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:24,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:24,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568696273] [2024-06-27 22:32:24,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:24,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:24,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:24,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:24,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:24,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:24,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 306 transitions, 4789 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:24,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:24,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:24,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:24,721 INFO L124 PetriNetUnfolderBase]: 1320/2252 cut-off events. [2024-06-27 22:32:24,721 INFO L125 PetriNetUnfolderBase]: For 34497/34497 co-relation queries the response was YES. [2024-06-27 22:32:24,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14859 conditions, 2252 events. 1320/2252 cut-off events. For 34497/34497 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12159 event pairs, 376 based on Foata normal form. 1/2190 useless extension candidates. Maximal degree in co-relation 14791. Up to 1943 conditions per place. [2024-06-27 22:32:24,738 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 273 selfloop transitions, 63 changer transitions 0/342 dead transitions. [2024-06-27 22:32:24,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 342 transitions, 5846 flow [2024-06-27 22:32:24,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:24,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:24,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-06-27 22:32:24,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4527027027027027 [2024-06-27 22:32:24,740 INFO L175 Difference]: Start difference. First operand has 151 places, 306 transitions, 4789 flow. Second operand 8 states and 134 transitions. [2024-06-27 22:32:24,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 342 transitions, 5846 flow [2024-06-27 22:32:24,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 342 transitions, 5746 flow, removed 21 selfloop flow, removed 5 redundant places. [2024-06-27 22:32:24,813 INFO L231 Difference]: Finished difference. Result has 157 places, 323 transitions, 5117 flow [2024-06-27 22:32:24,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4689, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5117, PETRI_PLACES=157, PETRI_TRANSITIONS=323} [2024-06-27 22:32:24,814 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 116 predicate places. [2024-06-27 22:32:24,814 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 323 transitions, 5117 flow [2024-06-27 22:32:24,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:24,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:24,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:24,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:32:24,814 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:24,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 211372101, now seen corresponding path program 4 times [2024-06-27 22:32:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:24,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031853520] [2024-06-27 22:32:24,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:24,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:25,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:25,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:25,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031853520] [2024-06-27 22:32:25,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031853520] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:25,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:25,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:25,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604769925] [2024-06-27 22:32:25,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:25,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:25,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:25,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:25,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:25,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:25,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 323 transitions, 5117 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:25,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:25,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:25,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:26,280 INFO L124 PetriNetUnfolderBase]: 1318/2250 cut-off events. [2024-06-27 22:32:26,280 INFO L125 PetriNetUnfolderBase]: For 36912/36912 co-relation queries the response was YES. [2024-06-27 22:32:26,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15324 conditions, 2250 events. 1318/2250 cut-off events. For 36912/36912 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12157 event pairs, 372 based on Foata normal form. 1/2187 useless extension candidates. Maximal degree in co-relation 15252. Up to 1941 conditions per place. [2024-06-27 22:32:26,296 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 268 selfloop transitions, 67 changer transitions 0/341 dead transitions. [2024-06-27 22:32:26,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 341 transitions, 5901 flow [2024-06-27 22:32:26,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:26,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-27 22:32:26,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42042042042042044 [2024-06-27 22:32:26,298 INFO L175 Difference]: Start difference. First operand has 157 places, 323 transitions, 5117 flow. Second operand 9 states and 140 transitions. [2024-06-27 22:32:26,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 341 transitions, 5901 flow [2024-06-27 22:32:26,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 341 transitions, 5778 flow, removed 52 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:26,376 INFO L231 Difference]: Finished difference. Result has 164 places, 323 transitions, 5134 flow [2024-06-27 22:32:26,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=4994, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5134, PETRI_PLACES=164, PETRI_TRANSITIONS=323} [2024-06-27 22:32:26,376 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 123 predicate places. [2024-06-27 22:32:26,376 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 323 transitions, 5134 flow [2024-06-27 22:32:26,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:26,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:26,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:26,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:32:26,377 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:26,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:26,377 INFO L85 PathProgramCache]: Analyzing trace with hash 202794277, now seen corresponding path program 6 times [2024-06-27 22:32:26,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:26,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394544659] [2024-06-27 22:32:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:26,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:27,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:27,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394544659] [2024-06-27 22:32:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394544659] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:27,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:27,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355035324] [2024-06-27 22:32:27,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:27,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:27,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:27,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:27,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:27,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:27,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 323 transitions, 5134 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:27,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:27,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:27,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:28,220 INFO L124 PetriNetUnfolderBase]: 1082/1966 cut-off events. [2024-06-27 22:32:28,221 INFO L125 PetriNetUnfolderBase]: For 34271/34271 co-relation queries the response was YES. [2024-06-27 22:32:28,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13349 conditions, 1966 events. 1082/1966 cut-off events. For 34271/34271 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11206 event pairs, 218 based on Foata normal form. 2/1903 useless extension candidates. Maximal degree in co-relation 13275. Up to 1379 conditions per place. [2024-06-27 22:32:28,235 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 158 selfloop transitions, 175 changer transitions 0/345 dead transitions. [2024-06-27 22:32:28,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 345 transitions, 5978 flow [2024-06-27 22:32:28,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 22:32:28,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47147147147147145 [2024-06-27 22:32:28,236 INFO L175 Difference]: Start difference. First operand has 164 places, 323 transitions, 5134 flow. Second operand 9 states and 157 transitions. [2024-06-27 22:32:28,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 345 transitions, 5978 flow [2024-06-27 22:32:28,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 345 transitions, 5886 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:28,307 INFO L231 Difference]: Finished difference. Result has 169 places, 326 transitions, 5471 flow [2024-06-27 22:32:28,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5042, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5471, PETRI_PLACES=169, PETRI_TRANSITIONS=326} [2024-06-27 22:32:28,308 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 128 predicate places. [2024-06-27 22:32:28,308 INFO L495 AbstractCegarLoop]: Abstraction has has 169 places, 326 transitions, 5471 flow [2024-06-27 22:32:28,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 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-27 22:32:28,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:28,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:28,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:32:28,308 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:28,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash 988142459, now seen corresponding path program 5 times [2024-06-27 22:32:28,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:28,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979674948] [2024-06-27 22:32:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:29,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:29,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979674948] [2024-06-27 22:32:29,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979674948] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:29,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:29,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468066706] [2024-06-27 22:32:29,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:29,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:29,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:29,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:29,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:29,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:29,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 326 transitions, 5471 flow. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:29,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:29,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:29,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:29,768 INFO L124 PetriNetUnfolderBase]: 1320/2253 cut-off events. [2024-06-27 22:32:29,768 INFO L125 PetriNetUnfolderBase]: For 39463/39463 co-relation queries the response was YES. [2024-06-27 22:32:29,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15510 conditions, 2253 events. 1320/2253 cut-off events. For 39463/39463 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12167 event pairs, 378 based on Foata normal form. 1/2190 useless extension candidates. Maximal degree in co-relation 15435. Up to 1945 conditions per place. [2024-06-27 22:32:29,786 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 277 selfloop transitions, 61 changer transitions 0/344 dead transitions. [2024-06-27 22:32:29,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 344 transitions, 6223 flow [2024-06-27 22:32:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2024-06-27 22:32:29,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42342342342342343 [2024-06-27 22:32:29,788 INFO L175 Difference]: Start difference. First operand has 169 places, 326 transitions, 5471 flow. Second operand 9 states and 141 transitions. [2024-06-27 22:32:29,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 344 transitions, 6223 flow [2024-06-27 22:32:29,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 344 transitions, 5830 flow, removed 24 selfloop flow, removed 7 redundant places. [2024-06-27 22:32:29,871 INFO L231 Difference]: Finished difference. Result has 171 places, 327 transitions, 5216 flow [2024-06-27 22:32:29,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5078, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5216, PETRI_PLACES=171, PETRI_TRANSITIONS=327} [2024-06-27 22:32:29,871 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 130 predicate places. [2024-06-27 22:32:29,872 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 327 transitions, 5216 flow [2024-06-27 22:32:29,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-27 22:32:29,872 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:29,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:29,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:32:29,872 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:29,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1536098347, now seen corresponding path program 1 times [2024-06-27 22:32:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:29,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213686355] [2024-06-27 22:32:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:31,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:31,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213686355] [2024-06-27 22:32:31,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213686355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:31,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:31,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:31,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502963810] [2024-06-27 22:32:31,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:31,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:31,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:31,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:31,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:31,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:31,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 327 transitions, 5216 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:31,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:31,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:31,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:31,785 INFO L124 PetriNetUnfolderBase]: 1324/2261 cut-off events. [2024-06-27 22:32:31,785 INFO L125 PetriNetUnfolderBase]: For 37248/37248 co-relation queries the response was YES. [2024-06-27 22:32:31,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15128 conditions, 2261 events. 1324/2261 cut-off events. For 37248/37248 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12252 event pairs, 438 based on Foata normal form. 1/2199 useless extension candidates. Maximal degree in co-relation 15052. Up to 2042 conditions per place. [2024-06-27 22:32:31,801 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 317 selfloop transitions, 37 changer transitions 0/360 dead transitions. [2024-06-27 22:32:31,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 360 transitions, 6171 flow [2024-06-27 22:32:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2024-06-27 22:32:31,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43843843843843844 [2024-06-27 22:32:31,803 INFO L175 Difference]: Start difference. First operand has 171 places, 327 transitions, 5216 flow. Second operand 9 states and 146 transitions. [2024-06-27 22:32:31,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 360 transitions, 6171 flow [2024-06-27 22:32:31,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 360 transitions, 6069 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-06-27 22:32:31,884 INFO L231 Difference]: Finished difference. Result has 177 places, 340 transitions, 5403 flow [2024-06-27 22:32:31,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5114, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5403, PETRI_PLACES=177, PETRI_TRANSITIONS=340} [2024-06-27 22:32:31,885 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 136 predicate places. [2024-06-27 22:32:31,885 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 340 transitions, 5403 flow [2024-06-27 22:32:31,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:31,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:31,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:31,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:32:31,885 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:31,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:31,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1945996847, now seen corresponding path program 1 times [2024-06-27 22:32:31,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:31,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55434114] [2024-06-27 22:32:31,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:31,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:32,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:32,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55434114] [2024-06-27 22:32:32,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55434114] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:32,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:32,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:32:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248917254] [2024-06-27 22:32:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:32,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:32:32,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:32,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:32:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:32:32,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 37 [2024-06-27 22:32:32,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 340 transitions, 5403 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:32,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:32,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 37 [2024-06-27 22:32:32,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:33,007 INFO L124 PetriNetUnfolderBase]: 932/1828 cut-off events. [2024-06-27 22:32:33,007 INFO L125 PetriNetUnfolderBase]: For 35738/35778 co-relation queries the response was YES. [2024-06-27 22:32:33,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12444 conditions, 1828 events. 932/1828 cut-off events. For 35738/35778 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11149 event pairs, 115 based on Foata normal form. 22/1784 useless extension candidates. Maximal degree in co-relation 12366. Up to 1083 conditions per place. [2024-06-27 22:32:33,022 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 171 selfloop transitions, 116 changer transitions 0/367 dead transitions. [2024-06-27 22:32:33,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 367 transitions, 6240 flow [2024-06-27 22:32:33,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:32:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:32:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2024-06-27 22:32:33,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444015444015444 [2024-06-27 22:32:33,023 INFO L175 Difference]: Start difference. First operand has 177 places, 340 transitions, 5403 flow. Second operand 7 states and 141 transitions. [2024-06-27 22:32:33,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 367 transitions, 6240 flow [2024-06-27 22:32:33,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 367 transitions, 5922 flow, removed 77 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:33,097 INFO L231 Difference]: Finished difference. Result has 183 places, 345 transitions, 5594 flow [2024-06-27 22:32:33,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5089, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5594, PETRI_PLACES=183, PETRI_TRANSITIONS=345} [2024-06-27 22:32:33,098 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 142 predicate places. [2024-06-27 22:32:33,098 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 345 transitions, 5594 flow [2024-06-27 22:32:33,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:33,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:33,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:33,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:32:33,099 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:33,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:33,099 INFO L85 PathProgramCache]: Analyzing trace with hash -41250331, now seen corresponding path program 2 times [2024-06-27 22:32:33,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:33,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772247259] [2024-06-27 22:32:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:33,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:33,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772247259] [2024-06-27 22:32:33,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772247259] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:33,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:33,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114149184] [2024-06-27 22:32:33,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:33,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:33,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:33,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:34,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:34,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 345 transitions, 5594 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:34,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:34,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:34,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:34,716 INFO L124 PetriNetUnfolderBase]: 1169/2112 cut-off events. [2024-06-27 22:32:34,716 INFO L125 PetriNetUnfolderBase]: For 48998/49010 co-relation queries the response was YES. [2024-06-27 22:32:34,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15551 conditions, 2112 events. 1169/2112 cut-off events. For 48998/49010 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 12310 event pairs, 213 based on Foata normal form. 3/2058 useless extension candidates. Maximal degree in co-relation 15469. Up to 1664 conditions per place. [2024-06-27 22:32:34,733 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 280 selfloop transitions, 102 changer transitions 0/395 dead transitions. [2024-06-27 22:32:34,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 395 transitions, 6933 flow [2024-06-27 22:32:34,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:32:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:32:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 22:32:34,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 22:32:34,734 INFO L175 Difference]: Start difference. First operand has 183 places, 345 transitions, 5594 flow. Second operand 10 states and 180 transitions. [2024-06-27 22:32:34,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 395 transitions, 6933 flow [2024-06-27 22:32:34,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 395 transitions, 6733 flow, removed 52 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:34,833 INFO L231 Difference]: Finished difference. Result has 190 places, 363 transitions, 6085 flow [2024-06-27 22:32:34,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5456, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6085, PETRI_PLACES=190, PETRI_TRANSITIONS=363} [2024-06-27 22:32:34,833 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 149 predicate places. [2024-06-27 22:32:34,834 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 363 transitions, 6085 flow [2024-06-27 22:32:34,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:34,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:34,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:34,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:32:34,834 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:34,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:34,835 INFO L85 PathProgramCache]: Analyzing trace with hash -626583423, now seen corresponding path program 3 times [2024-06-27 22:32:34,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:34,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178514329] [2024-06-27 22:32:34,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:34,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:34,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:35,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:35,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178514329] [2024-06-27 22:32:35,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178514329] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:35,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:35,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142513440] [2024-06-27 22:32:35,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:35,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:35,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:35,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 363 transitions, 6085 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:35,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:35,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:35,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:36,481 INFO L124 PetriNetUnfolderBase]: 1197/2188 cut-off events. [2024-06-27 22:32:36,481 INFO L125 PetriNetUnfolderBase]: For 52007/52039 co-relation queries the response was YES. [2024-06-27 22:32:36,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16143 conditions, 2188 events. 1197/2188 cut-off events. For 52007/52039 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12957 event pairs, 217 based on Foata normal form. 6/2133 useless extension candidates. Maximal degree in co-relation 16060. Up to 1677 conditions per place. [2024-06-27 22:32:36,500 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 266 selfloop transitions, 136 changer transitions 0/415 dead transitions. [2024-06-27 22:32:36,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 415 transitions, 7488 flow [2024-06-27 22:32:36,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:32:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:32:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 180 transitions. [2024-06-27 22:32:36,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2024-06-27 22:32:36,503 INFO L175 Difference]: Start difference. First operand has 190 places, 363 transitions, 6085 flow. Second operand 10 states and 180 transitions. [2024-06-27 22:32:36,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 415 transitions, 7488 flow [2024-06-27 22:32:36,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 415 transitions, 7264 flow, removed 88 selfloop flow, removed 4 redundant places. [2024-06-27 22:32:36,617 INFO L231 Difference]: Finished difference. Result has 197 places, 383 transitions, 6690 flow [2024-06-27 22:32:36,617 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5861, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6690, PETRI_PLACES=197, PETRI_TRANSITIONS=383} [2024-06-27 22:32:36,618 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 156 predicate places. [2024-06-27 22:32:36,618 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 383 transitions, 6690 flow [2024-06-27 22:32:36,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:36,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:36,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:36,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:32:36,618 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:36,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:36,619 INFO L85 PathProgramCache]: Analyzing trace with hash -538807791, now seen corresponding path program 1 times [2024-06-27 22:32:36,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:36,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376741312] [2024-06-27 22:32:36,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:36,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:37,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376741312] [2024-06-27 22:32:37,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376741312] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:37,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:37,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:37,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3869479] [2024-06-27 22:32:37,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:37,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:37,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:37,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:37,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:37,514 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:37,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 383 transitions, 6690 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:37,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:37,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:37,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:38,114 INFO L124 PetriNetUnfolderBase]: 1531/2597 cut-off events. [2024-06-27 22:32:38,114 INFO L125 PetriNetUnfolderBase]: For 56245/56245 co-relation queries the response was YES. [2024-06-27 22:32:38,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18973 conditions, 2597 events. 1531/2597 cut-off events. For 56245/56245 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 14530 event pairs, 298 based on Foata normal form. 1/2537 useless extension candidates. Maximal degree in co-relation 18887. Up to 2257 conditions per place. [2024-06-27 22:32:38,134 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 303 selfloop transitions, 111 changer transitions 0/420 dead transitions. [2024-06-27 22:32:38,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 420 transitions, 7807 flow [2024-06-27 22:32:38,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:32:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:32:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:32:38,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2024-06-27 22:32:38,135 INFO L175 Difference]: Start difference. First operand has 197 places, 383 transitions, 6690 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:32:38,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 420 transitions, 7807 flow [2024-06-27 22:32:38,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 420 transitions, 7563 flow, removed 88 selfloop flow, removed 5 redundant places. [2024-06-27 22:32:38,263 INFO L231 Difference]: Finished difference. Result has 203 places, 393 transitions, 6885 flow [2024-06-27 22:32:38,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6446, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6885, PETRI_PLACES=203, PETRI_TRANSITIONS=393} [2024-06-27 22:32:38,264 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 162 predicate places. [2024-06-27 22:32:38,264 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 393 transitions, 6885 flow [2024-06-27 22:32:38,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:38,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:38,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:38,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:32:38,264 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:38,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:38,265 INFO L85 PathProgramCache]: Analyzing trace with hash -353821443, now seen corresponding path program 4 times [2024-06-27 22:32:38,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:38,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016804953] [2024-06-27 22:32:38,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:38,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:39,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:39,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016804953] [2024-06-27 22:32:39,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016804953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:39,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:39,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:39,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069150634] [2024-06-27 22:32:39,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:39,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:39,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:39,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:39,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:39,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:39,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 393 transitions, 6885 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:39,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:39,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:39,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:39,936 INFO L124 PetriNetUnfolderBase]: 1301/2342 cut-off events. [2024-06-27 22:32:39,936 INFO L125 PetriNetUnfolderBase]: For 61772/61772 co-relation queries the response was YES. [2024-06-27 22:32:39,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17929 conditions, 2342 events. 1301/2342 cut-off events. For 61772/61772 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13969 event pairs, 245 based on Foata normal form. 2/2288 useless extension candidates. Maximal degree in co-relation 17840. Up to 1857 conditions per place. [2024-06-27 22:32:39,957 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 323 selfloop transitions, 96 changer transitions 0/433 dead transitions. [2024-06-27 22:32:39,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 433 transitions, 8106 flow [2024-06-27 22:32:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:39,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-06-27 22:32:39,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236486486486487 [2024-06-27 22:32:39,959 INFO L175 Difference]: Start difference. First operand has 203 places, 393 transitions, 6885 flow. Second operand 8 states and 155 transitions. [2024-06-27 22:32:39,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 433 transitions, 8106 flow [2024-06-27 22:32:40,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 433 transitions, 7855 flow, removed 32 selfloop flow, removed 6 redundant places. [2024-06-27 22:32:40,102 INFO L231 Difference]: Finished difference. Result has 206 places, 407 transitions, 7166 flow [2024-06-27 22:32:40,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6634, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7166, PETRI_PLACES=206, PETRI_TRANSITIONS=407} [2024-06-27 22:32:40,103 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 165 predicate places. [2024-06-27 22:32:40,103 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 407 transitions, 7166 flow [2024-06-27 22:32:40,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:40,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:40,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:40,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:32:40,104 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:40,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:40,104 INFO L85 PathProgramCache]: Analyzing trace with hash 367180963, now seen corresponding path program 5 times [2024-06-27 22:32:40,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:40,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690144216] [2024-06-27 22:32:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:40,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:41,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:41,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690144216] [2024-06-27 22:32:41,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690144216] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:41,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:41,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796524508] [2024-06-27 22:32:41,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:41,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:41,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:41,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:41,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:41,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:41,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 407 transitions, 7166 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:41,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:41,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:41,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:41,786 INFO L124 PetriNetUnfolderBase]: 1352/2457 cut-off events. [2024-06-27 22:32:41,786 INFO L125 PetriNetUnfolderBase]: For 66553/66553 co-relation queries the response was YES. [2024-06-27 22:32:41,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18914 conditions, 2457 events. 1352/2457 cut-off events. For 66553/66553 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 14946 event pairs, 260 based on Foata normal form. 2/2399 useless extension candidates. Maximal degree in co-relation 18824. Up to 1888 conditions per place. [2024-06-27 22:32:41,808 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 303 selfloop transitions, 154 changer transitions 0/471 dead transitions. [2024-06-27 22:32:41,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 471 transitions, 9020 flow [2024-06-27 22:32:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:41,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:41,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-27 22:32:41,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2024-06-27 22:32:41,809 INFO L175 Difference]: Start difference. First operand has 206 places, 407 transitions, 7166 flow. Second operand 9 states and 164 transitions. [2024-06-27 22:32:41,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 471 transitions, 9020 flow [2024-06-27 22:32:41,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 471 transitions, 8773 flow, removed 96 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:41,964 INFO L231 Difference]: Finished difference. Result has 213 places, 444 transitions, 8202 flow [2024-06-27 22:32:41,964 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=6919, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8202, PETRI_PLACES=213, PETRI_TRANSITIONS=444} [2024-06-27 22:32:41,964 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 172 predicate places. [2024-06-27 22:32:41,965 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 444 transitions, 8202 flow [2024-06-27 22:32:41,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:41,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:41,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:41,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:32:41,965 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:41,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:41,966 INFO L85 PathProgramCache]: Analyzing trace with hash 370012255, now seen corresponding path program 2 times [2024-06-27 22:32:41,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:41,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274389943] [2024-06-27 22:32:41,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:41,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:42,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:42,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274389943] [2024-06-27 22:32:42,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274389943] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:42,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:42,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:42,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693453812] [2024-06-27 22:32:42,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:42,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:42,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:42,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:42,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:42,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:42,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 444 transitions, 8202 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:42,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:42,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:42,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:43,657 INFO L124 PetriNetUnfolderBase]: 1747/2946 cut-off events. [2024-06-27 22:32:43,657 INFO L125 PetriNetUnfolderBase]: For 72424/72424 co-relation queries the response was YES. [2024-06-27 22:32:43,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22388 conditions, 2946 events. 1747/2946 cut-off events. For 72424/72424 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 17006 event pairs, 410 based on Foata normal form. 1/2885 useless extension candidates. Maximal degree in co-relation 22294. Up to 2602 conditions per place. [2024-06-27 22:32:43,682 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 356 selfloop transitions, 123 changer transitions 0/485 dead transitions. [2024-06-27 22:32:43,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 485 transitions, 9503 flow [2024-06-27 22:32:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:43,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-27 22:32:43,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48348348348348347 [2024-06-27 22:32:43,684 INFO L175 Difference]: Start difference. First operand has 213 places, 444 transitions, 8202 flow. Second operand 9 states and 161 transitions. [2024-06-27 22:32:43,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 485 transitions, 9503 flow [2024-06-27 22:32:43,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 485 transitions, 9281 flow, removed 96 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:43,854 INFO L231 Difference]: Finished difference. Result has 220 places, 459 transitions, 8524 flow [2024-06-27 22:32:43,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7980, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=8524, PETRI_PLACES=220, PETRI_TRANSITIONS=459} [2024-06-27 22:32:43,855 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 179 predicate places. [2024-06-27 22:32:43,855 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 459 transitions, 8524 flow [2024-06-27 22:32:43,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:43,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:43,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:43,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:32:43,855 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:43,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1217557917, now seen corresponding path program 3 times [2024-06-27 22:32:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353839938] [2024-06-27 22:32:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:43,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:44,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:44,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353839938] [2024-06-27 22:32:44,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353839938] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:44,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:44,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:44,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820102712] [2024-06-27 22:32:44,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:44,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:44,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:44,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:44,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:44,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 459 transitions, 8524 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:44,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:44,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:44,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:45,559 INFO L124 PetriNetUnfolderBase]: 1801/3024 cut-off events. [2024-06-27 22:32:45,560 INFO L125 PetriNetUnfolderBase]: For 74351/74351 co-relation queries the response was YES. [2024-06-27 22:32:45,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23436 conditions, 3024 events. 1801/3024 cut-off events. For 74351/74351 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 17399 event pairs, 349 based on Foata normal form. 1/2963 useless extension candidates. Maximal degree in co-relation 23340. Up to 2404 conditions per place. [2024-06-27 22:32:45,589 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 308 selfloop transitions, 199 changer transitions 0/513 dead transitions. [2024-06-27 22:32:45,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 513 transitions, 10303 flow [2024-06-27 22:32:45,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:45,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 22:32:45,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-06-27 22:32:45,591 INFO L175 Difference]: Start difference. First operand has 220 places, 459 transitions, 8524 flow. Second operand 9 states and 168 transitions. [2024-06-27 22:32:45,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 513 transitions, 10303 flow [2024-06-27 22:32:45,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 513 transitions, 9920 flow, removed 49 selfloop flow, removed 7 redundant places. [2024-06-27 22:32:45,786 INFO L231 Difference]: Finished difference. Result has 225 places, 484 transitions, 9241 flow [2024-06-27 22:32:45,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8141, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=459, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=9241, PETRI_PLACES=225, PETRI_TRANSITIONS=484} [2024-06-27 22:32:45,786 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 184 predicate places. [2024-06-27 22:32:45,786 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 484 transitions, 9241 flow [2024-06-27 22:32:45,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:45,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:45,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:45,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:32:45,787 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:45,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash 486406405, now seen corresponding path program 4 times [2024-06-27 22:32:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:45,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599702672] [2024-06-27 22:32:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:45,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:46,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:46,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599702672] [2024-06-27 22:32:46,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599702672] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:46,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:46,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:46,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478047382] [2024-06-27 22:32:46,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:46,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:46,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:46,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:46,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:46,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:46,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 484 transitions, 9241 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:46,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:46,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:46,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:47,550 INFO L124 PetriNetUnfolderBase]: 1811/3039 cut-off events. [2024-06-27 22:32:47,550 INFO L125 PetriNetUnfolderBase]: For 80502/80502 co-relation queries the response was YES. [2024-06-27 22:32:47,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24635 conditions, 3039 events. 1811/3039 cut-off events. For 80502/80502 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 17497 event pairs, 345 based on Foata normal form. 1/2978 useless extension candidates. Maximal degree in co-relation 24535. Up to 2416 conditions per place. [2024-06-27 22:32:47,578 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 279 selfloop transitions, 276 changer transitions 0/561 dead transitions. [2024-06-27 22:32:47,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 561 transitions, 11651 flow [2024-06-27 22:32:47,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:47,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:32:47,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015015015015015 [2024-06-27 22:32:47,580 INFO L175 Difference]: Start difference. First operand has 225 places, 484 transitions, 9241 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:32:47,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 561 transitions, 11651 flow [2024-06-27 22:32:47,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 561 transitions, 11387 flow, removed 87 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:47,787 INFO L231 Difference]: Finished difference. Result has 232 places, 532 transitions, 10728 flow [2024-06-27 22:32:47,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=8999, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=484, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10728, PETRI_PLACES=232, PETRI_TRANSITIONS=532} [2024-06-27 22:32:47,788 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 191 predicate places. [2024-06-27 22:32:47,788 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 532 transitions, 10728 flow [2024-06-27 22:32:47,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:47,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:47,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:47,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:32:47,788 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:47,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:47,789 INFO L85 PathProgramCache]: Analyzing trace with hash 486398965, now seen corresponding path program 5 times [2024-06-27 22:32:47,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:47,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321631037] [2024-06-27 22:32:47,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:47,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:48,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:48,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321631037] [2024-06-27 22:32:48,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321631037] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:48,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:48,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:48,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308154790] [2024-06-27 22:32:48,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:48,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:48,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:48,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:48,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:48,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:48,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 532 transitions, 10728 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:48,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:48,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:48,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:49,582 INFO L124 PetriNetUnfolderBase]: 1809/3036 cut-off events. [2024-06-27 22:32:49,582 INFO L125 PetriNetUnfolderBase]: For 81752/81752 co-relation queries the response was YES. [2024-06-27 22:32:49,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25396 conditions, 3036 events. 1809/3036 cut-off events. For 81752/81752 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 17490 event pairs, 348 based on Foata normal form. 1/2975 useless extension candidates. Maximal degree in co-relation 25293. Up to 2414 conditions per place. [2024-06-27 22:32:49,615 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 305 selfloop transitions, 250 changer transitions 0/561 dead transitions. [2024-06-27 22:32:49,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 561 transitions, 12043 flow [2024-06-27 22:32:49,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:49,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:32:49,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015015015015015 [2024-06-27 22:32:49,616 INFO L175 Difference]: Start difference. First operand has 232 places, 532 transitions, 10728 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:32:49,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 561 transitions, 12043 flow [2024-06-27 22:32:49,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 561 transitions, 11572 flow, removed 103 selfloop flow, removed 3 redundant places. [2024-06-27 22:32:49,868 INFO L231 Difference]: Finished difference. Result has 239 places, 534 transitions, 10900 flow [2024-06-27 22:32:49,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10257, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=248, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=10900, PETRI_PLACES=239, PETRI_TRANSITIONS=534} [2024-06-27 22:32:49,869 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 198 predicate places. [2024-06-27 22:32:49,869 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 534 transitions, 10900 flow [2024-06-27 22:32:49,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:49,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:49,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:49,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:32:49,869 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:49,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:49,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1232531668, now seen corresponding path program 1 times [2024-06-27 22:32:49,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:49,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394438120] [2024-06-27 22:32:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394438120] [2024-06-27 22:32:50,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394438120] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:50,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:50,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:32:50,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649981751] [2024-06-27 22:32:50,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:50,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:32:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:50,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:32:50,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:32:50,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 22:32:50,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 534 transitions, 10900 flow. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:50,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:50,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 22:32:50,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:51,594 INFO L124 PetriNetUnfolderBase]: 1706/2881 cut-off events. [2024-06-27 22:32:51,594 INFO L125 PetriNetUnfolderBase]: For 83251/83251 co-relation queries the response was YES. [2024-06-27 22:32:51,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24058 conditions, 2881 events. 1706/2881 cut-off events. For 83251/83251 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 17064 event pairs, 482 based on Foata normal form. 1/2809 useless extension candidates. Maximal degree in co-relation 23954. Up to 2600 conditions per place. [2024-06-27 22:32:51,624 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 511 selfloop transitions, 41 changer transitions 4/571 dead transitions. [2024-06-27 22:32:51,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 571 transitions, 12432 flow [2024-06-27 22:32:51,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:32:51,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:32:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 22:32:51,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2024-06-27 22:32:51,625 INFO L175 Difference]: Start difference. First operand has 239 places, 534 transitions, 10900 flow. Second operand 8 states and 154 transitions. [2024-06-27 22:32:51,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 571 transitions, 12432 flow [2024-06-27 22:32:51,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 571 transitions, 12123 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 22:32:51,938 INFO L231 Difference]: Finished difference. Result has 245 places, 542 transitions, 10896 flow [2024-06-27 22:32:51,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10591, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10896, PETRI_PLACES=245, PETRI_TRANSITIONS=542} [2024-06-27 22:32:51,938 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 204 predicate places. [2024-06-27 22:32:51,938 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 542 transitions, 10896 flow [2024-06-27 22:32:51,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:51,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:51,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:51,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:32:51,939 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:51,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:51,939 INFO L85 PathProgramCache]: Analyzing trace with hash 823577635, now seen corresponding path program 6 times [2024-06-27 22:32:51,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:51,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670255937] [2024-06-27 22:32:51,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:51,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:52,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:52,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670255937] [2024-06-27 22:32:52,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670255937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:52,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:52,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019870333] [2024-06-27 22:32:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:52,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:52,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:52,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:52,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:52,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 542 transitions, 10896 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:52,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:52,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:52,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:53,901 INFO L124 PetriNetUnfolderBase]: 1648/2917 cut-off events. [2024-06-27 22:32:53,901 INFO L125 PetriNetUnfolderBase]: For 95154/95206 co-relation queries the response was YES. [2024-06-27 22:32:53,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25484 conditions, 2917 events. 1648/2917 cut-off events. For 95154/95206 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 18105 event pairs, 212 based on Foata normal form. 6/2847 useless extension candidates. Maximal degree in co-relation 25376. Up to 2328 conditions per place. [2024-06-27 22:32:53,933 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 457 selfloop transitions, 110 changer transitions 0/586 dead transitions. [2024-06-27 22:32:53,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 586 transitions, 12544 flow [2024-06-27 22:32:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 22:32:53,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-27 22:32:53,934 INFO L175 Difference]: Start difference. First operand has 245 places, 542 transitions, 10896 flow. Second operand 9 states and 159 transitions. [2024-06-27 22:32:53,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 586 transitions, 12544 flow [2024-06-27 22:32:54,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 586 transitions, 12465 flow, removed 31 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:54,208 INFO L231 Difference]: Finished difference. Result has 254 places, 565 transitions, 11578 flow [2024-06-27 22:32:54,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=10817, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=11578, PETRI_PLACES=254, PETRI_TRANSITIONS=565} [2024-06-27 22:32:54,208 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 213 predicate places. [2024-06-27 22:32:54,209 INFO L495 AbstractCegarLoop]: Abstraction has has 254 places, 565 transitions, 11578 flow [2024-06-27 22:32:54,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:54,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:54,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:54,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:32:54,209 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:54,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:54,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1733599809, now seen corresponding path program 7 times [2024-06-27 22:32:54,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:54,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712941739] [2024-06-27 22:32:54,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:54,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:55,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:55,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712941739] [2024-06-27 22:32:55,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712941739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:55,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:55,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:55,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437139348] [2024-06-27 22:32:55,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:55,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:55,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:55,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:55,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:55,252 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:32:55,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 565 transitions, 11578 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:55,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:55,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:32:55,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:56,158 INFO L124 PetriNetUnfolderBase]: 1706/3030 cut-off events. [2024-06-27 22:32:56,158 INFO L125 PetriNetUnfolderBase]: For 104544/104596 co-relation queries the response was YES. [2024-06-27 22:32:56,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26866 conditions, 3030 events. 1706/3030 cut-off events. For 104544/104596 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 19140 event pairs, 227 based on Foata normal form. 6/2960 useless extension candidates. Maximal degree in co-relation 26753. Up to 2367 conditions per place. [2024-06-27 22:32:56,193 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 415 selfloop transitions, 165 changer transitions 0/599 dead transitions. [2024-06-27 22:32:56,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 599 transitions, 13100 flow [2024-06-27 22:32:56,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:32:56,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:32:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 22:32:56,195 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47147147147147145 [2024-06-27 22:32:56,195 INFO L175 Difference]: Start difference. First operand has 254 places, 565 transitions, 11578 flow. Second operand 9 states and 157 transitions. [2024-06-27 22:32:56,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 599 transitions, 13100 flow [2024-06-27 22:32:56,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 599 transitions, 12874 flow, removed 109 selfloop flow, removed 2 redundant places. [2024-06-27 22:32:56,547 INFO L231 Difference]: Finished difference. Result has 261 places, 580 transitions, 12046 flow [2024-06-27 22:32:56,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11352, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=150, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12046, PETRI_PLACES=261, PETRI_TRANSITIONS=580} [2024-06-27 22:32:56,547 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 220 predicate places. [2024-06-27 22:32:56,548 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 580 transitions, 12046 flow [2024-06-27 22:32:56,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:32:56,548 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:56,548 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:56,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-06-27 22:32:56,548 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:56,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1730768517, now seen corresponding path program 6 times [2024-06-27 22:32:56,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:56,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114880256] [2024-06-27 22:32:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:57,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:57,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114880256] [2024-06-27 22:32:57,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114880256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:57,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:57,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:57,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494935758] [2024-06-27 22:32:57,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:57,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:57,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:57,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:57,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:32:57,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:32:57,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 580 transitions, 12046 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:57,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:32:57,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:32:57,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:32:58,491 INFO L124 PetriNetUnfolderBase]: 2063/3448 cut-off events. [2024-06-27 22:32:58,491 INFO L125 PetriNetUnfolderBase]: For 103738/103738 co-relation queries the response was YES. [2024-06-27 22:32:58,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29226 conditions, 3448 events. 2063/3448 cut-off events. For 103738/103738 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 20632 event pairs, 351 based on Foata normal form. 1/3386 useless extension candidates. Maximal degree in co-relation 29111. Up to 3110 conditions per place. [2024-06-27 22:32:58,523 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 488 selfloop transitions, 124 changer transitions 0/618 dead transitions. [2024-06-27 22:32:58,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 618 transitions, 13648 flow [2024-06-27 22:32:58,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:32:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:32:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:32:58,525 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44324324324324327 [2024-06-27 22:32:58,525 INFO L175 Difference]: Start difference. First operand has 261 places, 580 transitions, 12046 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:32:58,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 618 transitions, 13648 flow [2024-06-27 22:32:58,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 618 transitions, 13174 flow, removed 87 selfloop flow, removed 7 redundant places. [2024-06-27 22:32:58,855 INFO L231 Difference]: Finished difference. Result has 265 places, 597 transitions, 12184 flow [2024-06-27 22:32:58,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11576, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12184, PETRI_PLACES=265, PETRI_TRANSITIONS=597} [2024-06-27 22:32:58,856 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 224 predicate places. [2024-06-27 22:32:58,856 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 597 transitions, 12184 flow [2024-06-27 22:32:58,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:32:58,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:32:58,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:32:58,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-06-27 22:32:58,856 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:32:58,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:32:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1614589569, now seen corresponding path program 8 times [2024-06-27 22:32:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:32:58,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708460887] [2024-06-27 22:32:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:32:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:32:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:32:59,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:32:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:32:59,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708460887] [2024-06-27 22:32:59,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708460887] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:32:59,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:32:59,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:32:59,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084474561] [2024-06-27 22:32:59,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:32:59,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:32:59,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:32:59,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:32:59,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:00,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:33:00,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 597 transitions, 12184 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:00,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:00,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:33:00,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:00,988 INFO L124 PetriNetUnfolderBase]: 1757/3128 cut-off events. [2024-06-27 22:33:00,989 INFO L125 PetriNetUnfolderBase]: For 108978/109002 co-relation queries the response was YES. [2024-06-27 22:33:01,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27879 conditions, 3128 events. 1757/3128 cut-off events. For 108978/109002 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 19839 event pairs, 228 based on Foata normal form. 6/3046 useless extension candidates. Maximal degree in co-relation 27762. Up to 2446 conditions per place. [2024-06-27 22:33:01,023 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 408 selfloop transitions, 191 changer transitions 0/621 dead transitions. [2024-06-27 22:33:01,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 621 transitions, 13676 flow [2024-06-27 22:33:01,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-06-27 22:33:01,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2024-06-27 22:33:01,024 INFO L175 Difference]: Start difference. First operand has 265 places, 597 transitions, 12184 flow. Second operand 9 states and 159 transitions. [2024-06-27 22:33:01,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 621 transitions, 13676 flow [2024-06-27 22:33:01,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 621 transitions, 13337 flow, removed 56 selfloop flow, removed 7 redundant places. [2024-06-27 22:33:01,375 INFO L231 Difference]: Finished difference. Result has 267 places, 602 transitions, 12472 flow [2024-06-27 22:33:01,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11845, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=12472, PETRI_PLACES=267, PETRI_TRANSITIONS=602} [2024-06-27 22:33:01,384 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 226 predicate places. [2024-06-27 22:33:01,384 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 602 transitions, 12472 flow [2024-06-27 22:33:01,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:01,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:01,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:01,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-06-27 22:33:01,384 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:01,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:01,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1614583617, now seen corresponding path program 7 times [2024-06-27 22:33:01,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:01,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510781291] [2024-06-27 22:33:01,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:01,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:02,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:02,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510781291] [2024-06-27 22:33:02,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510781291] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:02,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:02,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:02,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494250890] [2024-06-27 22:33:02,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:02,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:02,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:02,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:02,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:02,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:02,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 602 transitions, 12472 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:02,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:02,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:02,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:03,437 INFO L124 PetriNetUnfolderBase]: 2181/3626 cut-off events. [2024-06-27 22:33:03,437 INFO L125 PetriNetUnfolderBase]: For 117067/117067 co-relation queries the response was YES. [2024-06-27 22:33:03,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31439 conditions, 3626 events. 2181/3626 cut-off events. For 117067/117067 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 21803 event pairs, 342 based on Foata normal form. 1/3566 useless extension candidates. Maximal degree in co-relation 31321. Up to 3116 conditions per place. [2024-06-27 22:33:03,472 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 449 selfloop transitions, 210 changer transitions 0/665 dead transitions. [2024-06-27 22:33:03,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 665 transitions, 14877 flow [2024-06-27 22:33:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:33:03,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-27 22:33:03,474 INFO L175 Difference]: Start difference. First operand has 267 places, 602 transitions, 12472 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:33:03,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 665 transitions, 14877 flow [2024-06-27 22:33:03,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 665 transitions, 14288 flow, removed 104 selfloop flow, removed 7 redundant places. [2024-06-27 22:33:03,858 INFO L231 Difference]: Finished difference. Result has 273 places, 640 transitions, 13329 flow [2024-06-27 22:33:03,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=11889, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13329, PETRI_PLACES=273, PETRI_TRANSITIONS=640} [2024-06-27 22:33:03,859 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 232 predicate places. [2024-06-27 22:33:03,859 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 640 transitions, 13329 flow [2024-06-27 22:33:03,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:03,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:03,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:03,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-06-27 22:33:03,859 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:03,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash -778103825, now seen corresponding path program 8 times [2024-06-27 22:33:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:03,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239388081] [2024-06-27 22:33:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:04,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-27 22:33:04,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:04,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239388081] [2024-06-27 22:33:04,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239388081] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:04,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:04,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657677903] [2024-06-27 22:33:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:04,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:04,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:04,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:04,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:04,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 640 transitions, 13329 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:04,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:04,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:04,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:06,141 INFO L124 PetriNetUnfolderBase]: 2191/3641 cut-off events. [2024-06-27 22:33:06,141 INFO L125 PetriNetUnfolderBase]: For 118670/118670 co-relation queries the response was YES. [2024-06-27 22:33:06,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32068 conditions, 3641 events. 2191/3641 cut-off events. For 118670/118670 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 21929 event pairs, 334 based on Foata normal form. 1/3581 useless extension candidates. Maximal degree in co-relation 31946. Up to 3128 conditions per place. [2024-06-27 22:33:06,184 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 446 selfloop transitions, 226 changer transitions 0/678 dead transitions. [2024-06-27 22:33:06,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 678 transitions, 15263 flow [2024-06-27 22:33:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:06,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:33:06,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-27 22:33:06,186 INFO L175 Difference]: Start difference. First operand has 273 places, 640 transitions, 13329 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:33:06,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 678 transitions, 15263 flow [2024-06-27 22:33:06,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 678 transitions, 14971 flow, removed 103 selfloop flow, removed 4 redundant places. [2024-06-27 22:33:06,631 INFO L231 Difference]: Finished difference. Result has 281 places, 655 transitions, 13991 flow [2024-06-27 22:33:06,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13063, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=13991, PETRI_PLACES=281, PETRI_TRANSITIONS=655} [2024-06-27 22:33:06,632 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 240 predicate places. [2024-06-27 22:33:06,632 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 655 transitions, 13991 flow [2024-06-27 22:33:06,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:06,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:06,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:06,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-06-27 22:33:06,633 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:06,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1614374367, now seen corresponding path program 9 times [2024-06-27 22:33:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:06,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412160154] [2024-06-27 22:33:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:06,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:07,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:07,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412160154] [2024-06-27 22:33:07,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412160154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:07,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:07,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213970092] [2024-06-27 22:33:07,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:07,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:07,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:07,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:07,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 655 transitions, 13991 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:07,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:07,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:07,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:08,710 INFO L124 PetriNetUnfolderBase]: 2189/3644 cut-off events. [2024-06-27 22:33:08,710 INFO L125 PetriNetUnfolderBase]: For 120327/120327 co-relation queries the response was YES. [2024-06-27 22:33:08,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32859 conditions, 3644 events. 2189/3644 cut-off events. For 120327/120327 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 21987 event pairs, 330 based on Foata normal form. 1/3582 useless extension candidates. Maximal degree in co-relation 32733. Up to 3126 conditions per place. [2024-06-27 22:33:08,750 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 431 selfloop transitions, 240 changer transitions 0/677 dead transitions. [2024-06-27 22:33:08,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 677 transitions, 15501 flow [2024-06-27 22:33:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:08,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:08,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 22:33:08,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-27 22:33:08,752 INFO L175 Difference]: Start difference. First operand has 281 places, 655 transitions, 13991 flow. Second operand 10 states and 170 transitions. [2024-06-27 22:33:08,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 677 transitions, 15501 flow [2024-06-27 22:33:09,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 677 transitions, 15027 flow, removed 97 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:09,207 INFO L231 Difference]: Finished difference. Result has 285 places, 655 transitions, 14011 flow [2024-06-27 22:33:09,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13517, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14011, PETRI_PLACES=285, PETRI_TRANSITIONS=655} [2024-06-27 22:33:09,208 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 244 predicate places. [2024-06-27 22:33:09,208 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 655 transitions, 14011 flow [2024-06-27 22:33:09,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:09,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:09,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:09,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-06-27 22:33:09,209 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:09,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:09,209 INFO L85 PathProgramCache]: Analyzing trace with hash -2046594817, now seen corresponding path program 10 times [2024-06-27 22:33:09,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:09,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528375833] [2024-06-27 22:33:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:09,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:10,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:10,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528375833] [2024-06-27 22:33:10,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528375833] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:10,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:10,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:10,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202441674] [2024-06-27 22:33:10,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:10,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:10,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:10,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:10,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:10,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:10,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 655 transitions, 14011 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:10,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:10,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:10,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:11,341 INFO L124 PetriNetUnfolderBase]: 2243/3741 cut-off events. [2024-06-27 22:33:11,341 INFO L125 PetriNetUnfolderBase]: For 127299/127299 co-relation queries the response was YES. [2024-06-27 22:33:11,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33823 conditions, 3741 events. 2243/3741 cut-off events. For 127299/127299 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 22628 event pairs, 316 based on Foata normal form. 1/3673 useless extension candidates. Maximal degree in co-relation 33697. Up to 2834 conditions per place. [2024-06-27 22:33:11,380 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 329 selfloop transitions, 375 changer transitions 0/710 dead transitions. [2024-06-27 22:33:11,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 710 transitions, 16567 flow [2024-06-27 22:33:11,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-27 22:33:11,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46756756756756757 [2024-06-27 22:33:11,381 INFO L175 Difference]: Start difference. First operand has 285 places, 655 transitions, 14011 flow. Second operand 10 states and 173 transitions. [2024-06-27 22:33:11,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 710 transitions, 16567 flow [2024-06-27 22:33:11,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 710 transitions, 16187 flow, removed 25 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:11,889 INFO L231 Difference]: Finished difference. Result has 292 places, 683 transitions, 15285 flow [2024-06-27 22:33:11,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13631, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15285, PETRI_PLACES=292, PETRI_TRANSITIONS=683} [2024-06-27 22:33:11,890 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 251 predicate places. [2024-06-27 22:33:11,890 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 683 transitions, 15285 flow [2024-06-27 22:33:11,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:11,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:11,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:11,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-06-27 22:33:11,891 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:11,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:11,891 INFO L85 PathProgramCache]: Analyzing trace with hash -383941850, now seen corresponding path program 2 times [2024-06-27 22:33:11,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:11,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524652658] [2024-06-27 22:33:11,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:11,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:13,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524652658] [2024-06-27 22:33:13,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524652658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:13,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:13,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:13,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989281484] [2024-06-27 22:33:13,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:13,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:13,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:13,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:13,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:13,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:33:13,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 683 transitions, 15285 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:13,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:13,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:33:13,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:14,215 INFO L124 PetriNetUnfolderBase]: 2132/3636 cut-off events. [2024-06-27 22:33:14,215 INFO L125 PetriNetUnfolderBase]: For 140147/140147 co-relation queries the response was YES. [2024-06-27 22:33:14,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34185 conditions, 3636 events. 2132/3636 cut-off events. For 140147/140147 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 22836 event pairs, 450 based on Foata normal form. 1/3535 useless extension candidates. Maximal degree in co-relation 34055. Up to 3105 conditions per place. [2024-06-27 22:33:14,259 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 657 selfloop transitions, 57 changer transitions 5/733 dead transitions. [2024-06-27 22:33:14,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 733 transitions, 17789 flow [2024-06-27 22:33:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 22:33:14,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-27 22:33:14,260 INFO L175 Difference]: Start difference. First operand has 292 places, 683 transitions, 15285 flow. Second operand 8 states and 156 transitions. [2024-06-27 22:33:14,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 733 transitions, 17789 flow [2024-06-27 22:33:14,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 733 transitions, 17381 flow, removed 163 selfloop flow, removed 3 redundant places. [2024-06-27 22:33:14,839 INFO L231 Difference]: Finished difference. Result has 301 places, 695 transitions, 15378 flow [2024-06-27 22:33:14,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14917, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=632, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15378, PETRI_PLACES=301, PETRI_TRANSITIONS=695} [2024-06-27 22:33:14,840 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 260 predicate places. [2024-06-27 22:33:14,840 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 695 transitions, 15378 flow [2024-06-27 22:33:14,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:14,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:14,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:14,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-06-27 22:33:14,841 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:14,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:14,841 INFO L85 PathProgramCache]: Analyzing trace with hash -383949569, now seen corresponding path program 11 times [2024-06-27 22:33:14,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:14,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712193488] [2024-06-27 22:33:14,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:14,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:15,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:15,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:15,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712193488] [2024-06-27 22:33:15,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712193488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:15,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:15,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:15,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945837968] [2024-06-27 22:33:15,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:15,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:15,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:15,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:15,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:15,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:15,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 695 transitions, 15378 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:15,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:15,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:15,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:17,060 INFO L124 PetriNetUnfolderBase]: 2336/3919 cut-off events. [2024-06-27 22:33:17,060 INFO L125 PetriNetUnfolderBase]: For 138002/138002 co-relation queries the response was YES. [2024-06-27 22:33:17,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36387 conditions, 3919 events. 2336/3919 cut-off events. For 138002/138002 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 24079 event pairs, 319 based on Foata normal form. 1/3841 useless extension candidates. Maximal degree in co-relation 36252. Up to 2981 conditions per place. [2024-06-27 22:33:17,109 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 338 selfloop transitions, 381 changer transitions 0/725 dead transitions. [2024-06-27 22:33:17,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 725 transitions, 17268 flow [2024-06-27 22:33:17,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:17,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:17,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:33:17,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-27 22:33:17,111 INFO L175 Difference]: Start difference. First operand has 301 places, 695 transitions, 15378 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:33:17,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 725 transitions, 17268 flow [2024-06-27 22:33:17,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 725 transitions, 17031 flow, removed 112 selfloop flow, removed 1 redundant places. [2024-06-27 22:33:17,670 INFO L231 Difference]: Finished difference. Result has 311 places, 701 transitions, 16076 flow [2024-06-27 22:33:17,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15179, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16076, PETRI_PLACES=311, PETRI_TRANSITIONS=701} [2024-06-27 22:33:17,671 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 270 predicate places. [2024-06-27 22:33:17,671 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 701 transitions, 16076 flow [2024-06-27 22:33:17,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:17,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:17,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:17,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-06-27 22:33:17,672 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:17,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:17,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1991864529, now seen corresponding path program 12 times [2024-06-27 22:33:17,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:17,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836540348] [2024-06-27 22:33:17,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:17,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:18,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:18,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836540348] [2024-06-27 22:33:18,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836540348] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:18,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:18,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967103759] [2024-06-27 22:33:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:18,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:18,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:18,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:18,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:18,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:18,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 701 transitions, 16076 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:18,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:18,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:18,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:20,064 INFO L124 PetriNetUnfolderBase]: 2368/3964 cut-off events. [2024-06-27 22:33:20,065 INFO L125 PetriNetUnfolderBase]: For 143886/143886 co-relation queries the response was YES. [2024-06-27 22:33:20,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37534 conditions, 3964 events. 2368/3964 cut-off events. For 143886/143886 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 24333 event pairs, 333 based on Foata normal form. 1/3887 useless extension candidates. Maximal degree in co-relation 37395. Up to 3014 conditions per place. [2024-06-27 22:33:20,111 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 358 selfloop transitions, 375 changer transitions 0/739 dead transitions. [2024-06-27 22:33:20,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 739 transitions, 18418 flow [2024-06-27 22:33:20,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:20,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-27 22:33:20,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-27 22:33:20,117 INFO L175 Difference]: Start difference. First operand has 311 places, 701 transitions, 16076 flow. Second operand 10 states and 175 transitions. [2024-06-27 22:33:20,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 739 transitions, 18418 flow [2024-06-27 22:33:20,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 739 transitions, 17611 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:20,778 INFO L231 Difference]: Finished difference. Result has 317 places, 715 transitions, 16467 flow [2024-06-27 22:33:20,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15291, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=361, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16467, PETRI_PLACES=317, PETRI_TRANSITIONS=715} [2024-06-27 22:33:20,778 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 276 predicate places. [2024-06-27 22:33:20,779 INFO L495 AbstractCegarLoop]: Abstraction has has 317 places, 715 transitions, 16467 flow [2024-06-27 22:33:20,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:20,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:20,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:20,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-06-27 22:33:20,779 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:20,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:20,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1991656767, now seen corresponding path program 9 times [2024-06-27 22:33:20,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:20,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469283924] [2024-06-27 22:33:20,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:20,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:21,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:21,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469283924] [2024-06-27 22:33:21,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469283924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:21,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:21,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119924373] [2024-06-27 22:33:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:21,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:21,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:21,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:22,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:33:22,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 715 transitions, 16467 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:22,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:22,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:33:22,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:23,132 INFO L124 PetriNetUnfolderBase]: 2051/3606 cut-off events. [2024-06-27 22:33:23,133 INFO L125 PetriNetUnfolderBase]: For 149078/149122 co-relation queries the response was YES. [2024-06-27 22:33:23,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35552 conditions, 3606 events. 2051/3606 cut-off events. For 149078/149122 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 23097 event pairs, 238 based on Foata normal form. 28/3545 useless extension candidates. Maximal degree in co-relation 35410. Up to 2642 conditions per place. [2024-06-27 22:33:23,180 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 381 selfloop transitions, 334 changer transitions 0/743 dead transitions. [2024-06-27 22:33:23,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 743 transitions, 18359 flow [2024-06-27 22:33:23,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 157 transitions. [2024-06-27 22:33:23,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47147147147147145 [2024-06-27 22:33:23,182 INFO L175 Difference]: Start difference. First operand has 317 places, 715 transitions, 16467 flow. Second operand 9 states and 157 transitions. [2024-06-27 22:33:23,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 743 transitions, 18359 flow [2024-06-27 22:33:23,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 743 transitions, 17017 flow, removed 129 selfloop flow, removed 9 redundant places. [2024-06-27 22:33:23,801 INFO L231 Difference]: Finished difference. Result has 319 places, 725 transitions, 16485 flow [2024-06-27 22:33:23,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15125, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=327, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16485, PETRI_PLACES=319, PETRI_TRANSITIONS=725} [2024-06-27 22:33:23,802 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 278 predicate places. [2024-06-27 22:33:23,802 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 725 transitions, 16485 flow [2024-06-27 22:33:23,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:23,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:23,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:23,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-06-27 22:33:23,803 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:23,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:23,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1991662719, now seen corresponding path program 13 times [2024-06-27 22:33:23,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:23,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540022721] [2024-06-27 22:33:23,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:24,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:24,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:24,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540022721] [2024-06-27 22:33:24,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540022721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:24,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:24,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972294228] [2024-06-27 22:33:24,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:24,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:24,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:24,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:24,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:24,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:24,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 725 transitions, 16485 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:24,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:24,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:24,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:25,969 INFO L124 PetriNetUnfolderBase]: 2374/3973 cut-off events. [2024-06-27 22:33:25,969 INFO L125 PetriNetUnfolderBase]: For 144656/144656 co-relation queries the response was YES. [2024-06-27 22:33:26,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37359 conditions, 3973 events. 2374/3973 cut-off events. For 144656/144656 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 24426 event pairs, 333 based on Foata normal form. 1/3896 useless extension candidates. Maximal degree in co-relation 37217. Up to 3024 conditions per place. [2024-06-27 22:33:26,022 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 360 selfloop transitions, 384 changer transitions 0/750 dead transitions. [2024-06-27 22:33:26,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 750 transitions, 18316 flow [2024-06-27 22:33:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:26,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:33:26,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-27 22:33:26,023 INFO L175 Difference]: Start difference. First operand has 319 places, 725 transitions, 16485 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:33:26,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 750 transitions, 18316 flow [2024-06-27 22:33:26,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 750 transitions, 17794 flow, removed 210 selfloop flow, removed 4 redundant places. [2024-06-27 22:33:26,831 INFO L231 Difference]: Finished difference. Result has 326 places, 728 transitions, 16843 flow [2024-06-27 22:33:26,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16001, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=381, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16843, PETRI_PLACES=326, PETRI_TRANSITIONS=728} [2024-06-27 22:33:26,832 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 285 predicate places. [2024-06-27 22:33:26,832 INFO L495 AbstractCegarLoop]: Abstraction has has 326 places, 728 transitions, 16843 flow [2024-06-27 22:33:26,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:26,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:26,832 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:26,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-06-27 22:33:26,832 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:26,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1991872248, now seen corresponding path program 3 times [2024-06-27 22:33:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819222443] [2024-06-27 22:33:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:28,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:28,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819222443] [2024-06-27 22:33:28,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819222443] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:28,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:28,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274812356] [2024-06-27 22:33:28,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:28,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:28,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:28,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:28,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:33:28,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 728 transitions, 16843 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:28,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:28,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:33:28,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:29,165 INFO L124 PetriNetUnfolderBase]: 2160/3669 cut-off events. [2024-06-27 22:33:29,165 INFO L125 PetriNetUnfolderBase]: For 135012/135012 co-relation queries the response was YES. [2024-06-27 22:33:29,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34676 conditions, 3669 events. 2160/3669 cut-off events. For 135012/135012 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 22965 event pairs, 453 based on Foata normal form. 1/3570 useless extension candidates. Maximal degree in co-relation 34531. Up to 3148 conditions per place. [2024-06-27 22:33:29,213 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 695 selfloop transitions, 57 changer transitions 5/771 dead transitions. [2024-06-27 22:33:29,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 771 transitions, 19218 flow [2024-06-27 22:33:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 22:33:29,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.527027027027027 [2024-06-27 22:33:29,215 INFO L175 Difference]: Start difference. First operand has 326 places, 728 transitions, 16843 flow. Second operand 8 states and 156 transitions. [2024-06-27 22:33:29,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 771 transitions, 19218 flow [2024-06-27 22:33:29,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 771 transitions, 18486 flow, removed 23 selfloop flow, removed 5 redundant places. [2024-06-27 22:33:29,815 INFO L231 Difference]: Finished difference. Result has 333 places, 735 transitions, 16472 flow [2024-06-27 22:33:29,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16115, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16472, PETRI_PLACES=333, PETRI_TRANSITIONS=735} [2024-06-27 22:33:29,816 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 292 predicate places. [2024-06-27 22:33:29,816 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 735 transitions, 16472 flow [2024-06-27 22:33:29,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:29,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:29,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:29,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-06-27 22:33:29,816 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:29,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:29,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1991871969, now seen corresponding path program 14 times [2024-06-27 22:33:29,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:29,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483843101] [2024-06-27 22:33:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:30,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:30,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:30,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483843101] [2024-06-27 22:33:30,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483843101] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:30,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:30,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:30,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121710350] [2024-06-27 22:33:30,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:30,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:30,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:30,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:30,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:30,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:30,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 735 transitions, 16472 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:30,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:30,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:30,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:32,048 INFO L124 PetriNetUnfolderBase]: 2370/3964 cut-off events. [2024-06-27 22:33:32,048 INFO L125 PetriNetUnfolderBase]: For 136934/136934 co-relation queries the response was YES. [2024-06-27 22:33:32,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37035 conditions, 3964 events. 2370/3964 cut-off events. For 136934/136934 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 24348 event pairs, 324 based on Foata normal form. 1/3888 useless extension candidates. Maximal degree in co-relation 36886. Up to 3019 conditions per place. [2024-06-27 22:33:32,101 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 372 selfloop transitions, 379 changer transitions 0/757 dead transitions. [2024-06-27 22:33:32,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 757 transitions, 18264 flow [2024-06-27 22:33:32,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:32,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:33:32,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-27 22:33:32,103 INFO L175 Difference]: Start difference. First operand has 333 places, 735 transitions, 16472 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:33:32,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 757 transitions, 18264 flow [2024-06-27 22:33:32,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 757 transitions, 18018 flow, removed 93 selfloop flow, removed 3 redundant places. [2024-06-27 22:33:32,853 INFO L231 Difference]: Finished difference. Result has 340 places, 735 transitions, 16992 flow [2024-06-27 22:33:32,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16226, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=379, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=16992, PETRI_PLACES=340, PETRI_TRANSITIONS=735} [2024-06-27 22:33:32,854 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 299 predicate places. [2024-06-27 22:33:32,854 INFO L495 AbstractCegarLoop]: Abstraction has has 340 places, 735 transitions, 16992 flow [2024-06-27 22:33:32,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:32,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:32,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:32,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-06-27 22:33:32,855 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:32,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:32,855 INFO L85 PathProgramCache]: Analyzing trace with hash -2037398047, now seen corresponding path program 15 times [2024-06-27 22:33:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:32,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010618915] [2024-06-27 22:33:32,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:32,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:33,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:33,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010618915] [2024-06-27 22:33:33,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010618915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:33,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:33,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:33,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406219620] [2024-06-27 22:33:33,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:33,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:33,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:33,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:33,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:33,952 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:33,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 735 transitions, 16992 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:33,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:33,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:33,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:35,111 INFO L124 PetriNetUnfolderBase]: 2368/3964 cut-off events. [2024-06-27 22:33:35,111 INFO L125 PetriNetUnfolderBase]: For 138445/138445 co-relation queries the response was YES. [2024-06-27 22:33:35,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37322 conditions, 3964 events. 2368/3964 cut-off events. For 138445/138445 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 24331 event pairs, 312 based on Foata normal form. 1/3887 useless extension candidates. Maximal degree in co-relation 37172. Up to 3017 conditions per place. [2024-06-27 22:33:35,158 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 313 selfloop transitions, 437 changer transitions 0/756 dead transitions. [2024-06-27 22:33:35,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 756 transitions, 18678 flow [2024-06-27 22:33:35,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 170 transitions. [2024-06-27 22:33:35,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-27 22:33:35,159 INFO L175 Difference]: Start difference. First operand has 340 places, 735 transitions, 16992 flow. Second operand 10 states and 170 transitions. [2024-06-27 22:33:35,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 756 transitions, 18678 flow [2024-06-27 22:33:35,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 756 transitions, 17839 flow, removed 50 selfloop flow, removed 7 redundant places. [2024-06-27 22:33:35,849 INFO L231 Difference]: Finished difference. Result has 343 places, 735 transitions, 17035 flow [2024-06-27 22:33:35,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16153, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=437, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17035, PETRI_PLACES=343, PETRI_TRANSITIONS=735} [2024-06-27 22:33:35,850 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 302 predicate places. [2024-06-27 22:33:35,850 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 735 transitions, 17035 flow [2024-06-27 22:33:35,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:35,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:35,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:35,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-06-27 22:33:35,851 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:35,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2037397768, now seen corresponding path program 4 times [2024-06-27 22:33:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:35,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480191100] [2024-06-27 22:33:35,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:37,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:37,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480191100] [2024-06-27 22:33:37,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480191100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:37,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:37,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:37,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421646851] [2024-06-27 22:33:37,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:37,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:37,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:37,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:37,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:37,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:33:37,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 735 transitions, 17035 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:37,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:37,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:33:37,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:38,190 INFO L124 PetriNetUnfolderBase]: 2169/3692 cut-off events. [2024-06-27 22:33:38,190 INFO L125 PetriNetUnfolderBase]: For 135554/135554 co-relation queries the response was YES. [2024-06-27 22:33:38,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34936 conditions, 3692 events. 2169/3692 cut-off events. For 135554/135554 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 23170 event pairs, 447 based on Foata normal form. 1/3591 useless extension candidates. Maximal degree in co-relation 34786. Up to 3156 conditions per place. [2024-06-27 22:33:38,238 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 685 selfloop transitions, 71 changer transitions 5/775 dead transitions. [2024-06-27 22:33:38,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 775 transitions, 19328 flow [2024-06-27 22:33:38,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:38,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 154 transitions. [2024-06-27 22:33:38,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5202702702702703 [2024-06-27 22:33:38,239 INFO L175 Difference]: Start difference. First operand has 343 places, 735 transitions, 17035 flow. Second operand 8 states and 154 transitions. [2024-06-27 22:33:38,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 775 transitions, 19328 flow [2024-06-27 22:33:38,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 775 transitions, 18616 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:38,884 INFO L231 Difference]: Finished difference. Result has 348 places, 741 transitions, 16695 flow [2024-06-27 22:33:38,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16323, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16695, PETRI_PLACES=348, PETRI_TRANSITIONS=741} [2024-06-27 22:33:38,884 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 307 predicate places. [2024-06-27 22:33:38,884 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 741 transitions, 16695 flow [2024-06-27 22:33:38,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:38,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:38,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:38,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-06-27 22:33:38,885 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:38,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash -2037388468, now seen corresponding path program 5 times [2024-06-27 22:33:38,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:38,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81984020] [2024-06-27 22:33:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:38,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:39,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:39,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81984020] [2024-06-27 22:33:39,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81984020] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:39,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:39,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:33:39,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972189943] [2024-06-27 22:33:39,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:39,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:33:39,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:39,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:33:39,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:33:40,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:40,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 741 transitions, 16695 flow. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:40,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:40,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:40,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:41,242 INFO L124 PetriNetUnfolderBase]: 2381/4000 cut-off events. [2024-06-27 22:33:41,242 INFO L125 PetriNetUnfolderBase]: For 140707/140707 co-relation queries the response was YES. [2024-06-27 22:33:41,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37331 conditions, 4000 events. 2381/4000 cut-off events. For 140707/140707 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 24751 event pairs, 651 based on Foata normal form. 1/3926 useless extension candidates. Maximal degree in co-relation 37178. Up to 3740 conditions per place. [2024-06-27 22:33:41,288 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 736 selfloop transitions, 22 changer transitions 0/764 dead transitions. [2024-06-27 22:33:41,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 764 transitions, 18393 flow [2024-06-27 22:33:41,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 140 transitions. [2024-06-27 22:33:41,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42042042042042044 [2024-06-27 22:33:41,289 INFO L175 Difference]: Start difference. First operand has 348 places, 741 transitions, 16695 flow. Second operand 9 states and 140 transitions. [2024-06-27 22:33:41,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 764 transitions, 18393 flow [2024-06-27 22:33:41,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 764 transitions, 18264 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-06-27 22:33:41,981 INFO L231 Difference]: Finished difference. Result has 354 places, 744 transitions, 16726 flow [2024-06-27 22:33:41,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16576, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=16726, PETRI_PLACES=354, PETRI_TRANSITIONS=744} [2024-06-27 22:33:41,982 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 313 predicate places. [2024-06-27 22:33:41,982 INFO L495 AbstractCegarLoop]: Abstraction has has 354 places, 744 transitions, 16726 flow [2024-06-27 22:33:41,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 9 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-27 22:33:41,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:41,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:41,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-06-27 22:33:41,983 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:41,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:41,983 INFO L85 PathProgramCache]: Analyzing trace with hash -2037059434, now seen corresponding path program 1 times [2024-06-27 22:33:41,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:41,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438542923] [2024-06-27 22:33:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:41,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:43,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-27 22:33:43,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:43,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438542923] [2024-06-27 22:33:43,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438542923] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:43,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:43,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:33:43,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756715124] [2024-06-27 22:33:43,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:43,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:33:43,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:43,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:33:43,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:33:43,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:43,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 744 transitions, 16726 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:43,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:43,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:43,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:44,806 INFO L124 PetriNetUnfolderBase]: 2383/4003 cut-off events. [2024-06-27 22:33:44,806 INFO L125 PetriNetUnfolderBase]: For 140114/140114 co-relation queries the response was YES. [2024-06-27 22:33:44,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37069 conditions, 4003 events. 2383/4003 cut-off events. For 140114/140114 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 24766 event pairs, 647 based on Foata normal form. 2/3930 useless extension candidates. Maximal degree in co-relation 36914. Up to 3724 conditions per place. [2024-06-27 22:33:44,863 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 744 selfloop transitions, 26 changer transitions 0/776 dead transitions. [2024-06-27 22:33:44,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 776 transitions, 18566 flow [2024-06-27 22:33:44,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:33:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:33:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 164 transitions. [2024-06-27 22:33:44,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40294840294840295 [2024-06-27 22:33:44,864 INFO L175 Difference]: Start difference. First operand has 354 places, 744 transitions, 16726 flow. Second operand 11 states and 164 transitions. [2024-06-27 22:33:44,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 776 transitions, 18566 flow [2024-06-27 22:33:45,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 776 transitions, 18366 flow, removed 38 selfloop flow, removed 9 redundant places. [2024-06-27 22:33:45,620 INFO L231 Difference]: Finished difference. Result has 357 places, 751 transitions, 16742 flow [2024-06-27 22:33:45,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16526, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16742, PETRI_PLACES=357, PETRI_TRANSITIONS=751} [2024-06-27 22:33:45,621 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 316 predicate places. [2024-06-27 22:33:45,621 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 751 transitions, 16742 flow [2024-06-27 22:33:45,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:45,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:45,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:45,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-06-27 22:33:45,621 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:45,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1715775969, now seen corresponding path program 1 times [2024-06-27 22:33:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:45,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983136736] [2024-06-27 22:33:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:45,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-27 22:33:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:45,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983136736] [2024-06-27 22:33:45,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983136736] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:45,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:45,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:33:45,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126016926] [2024-06-27 22:33:45,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:45,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:33:45,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:45,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:33:45,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:33:45,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2024-06-27 22:33:45,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 751 transitions, 16742 flow. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:45,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:45,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2024-06-27 22:33:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:46,857 INFO L124 PetriNetUnfolderBase]: 1920/3511 cut-off events. [2024-06-27 22:33:46,857 INFO L125 PetriNetUnfolderBase]: For 135311/135674 co-relation queries the response was YES. [2024-06-27 22:33:46,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32570 conditions, 3511 events. 1920/3511 cut-off events. For 135311/135674 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 23241 event pairs, 295 based on Foata normal form. 67/3425 useless extension candidates. Maximal degree in co-relation 32414. Up to 1221 conditions per place. [2024-06-27 22:33:46,905 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 392 selfloop transitions, 165 changer transitions 77/825 dead transitions. [2024-06-27 22:33:46,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 825 transitions, 19309 flow [2024-06-27 22:33:46,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:33:46,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:33:46,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 179 transitions. [2024-06-27 22:33:46,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6047297297297297 [2024-06-27 22:33:46,906 INFO L175 Difference]: Start difference. First operand has 357 places, 751 transitions, 16742 flow. Second operand 8 states and 179 transitions. [2024-06-27 22:33:46,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 825 transitions, 19309 flow [2024-06-27 22:33:47,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 825 transitions, 19156 flow, removed 64 selfloop flow, removed 7 redundant places. [2024-06-27 22:33:47,594 INFO L231 Difference]: Finished difference. Result has 363 places, 721 transitions, 16620 flow [2024-06-27 22:33:47,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16613, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=16620, PETRI_PLACES=363, PETRI_TRANSITIONS=721} [2024-06-27 22:33:47,595 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 322 predicate places. [2024-06-27 22:33:47,596 INFO L495 AbstractCegarLoop]: Abstraction has has 363 places, 721 transitions, 16620 flow [2024-06-27 22:33:47,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 6 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:47,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:47,596 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:47,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-06-27 22:33:47,596 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:47,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:47,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2039015154, now seen corresponding path program 1 times [2024-06-27 22:33:47,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:47,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396265277] [2024-06-27 22:33:47,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:47,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:48,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:48,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396265277] [2024-06-27 22:33:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396265277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:48,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:48,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:33:48,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945525851] [2024-06-27 22:33:48,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:48,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:33:48,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:48,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:33:48,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:33:48,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:48,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 721 transitions, 16620 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:48,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:48,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:48,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:49,912 INFO L124 PetriNetUnfolderBase]: 2323/3925 cut-off events. [2024-06-27 22:33:49,912 INFO L125 PetriNetUnfolderBase]: For 139971/139971 co-relation queries the response was YES. [2024-06-27 22:33:49,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37586 conditions, 3925 events. 2323/3925 cut-off events. For 139971/139971 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 24218 event pairs, 397 based on Foata normal form. 2/3913 useless extension candidates. Maximal degree in co-relation 37423. Up to 3394 conditions per place. [2024-06-27 22:33:49,959 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 534 selfloop transitions, 202 changer transitions 48/791 dead transitions. [2024-06-27 22:33:49,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 791 transitions, 19518 flow [2024-06-27 22:33:49,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:49,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:33:49,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-27 22:33:49,960 INFO L175 Difference]: Start difference. First operand has 363 places, 721 transitions, 16620 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:33:49,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 791 transitions, 19518 flow [2024-06-27 22:33:50,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 791 transitions, 19502 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 22:33:50,803 INFO L231 Difference]: Finished difference. Result has 371 places, 709 transitions, 17037 flow [2024-06-27 22:33:50,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16610, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17037, PETRI_PLACES=371, PETRI_TRANSITIONS=709} [2024-06-27 22:33:50,804 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 330 predicate places. [2024-06-27 22:33:50,804 INFO L495 AbstractCegarLoop]: Abstraction has has 371 places, 709 transitions, 17037 flow [2024-06-27 22:33:50,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:50,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:50,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:50,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-06-27 22:33:50,804 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:50,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:50,804 INFO L85 PathProgramCache]: Analyzing trace with hash 476841446, now seen corresponding path program 1 times [2024-06-27 22:33:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:50,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167086055] [2024-06-27 22:33:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:50,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167086055] [2024-06-27 22:33:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167086055] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:51,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:33:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614281283] [2024-06-27 22:33:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:51,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:33:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:51,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:33:51,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:33:52,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:33:52,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 709 transitions, 17037 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:52,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:52,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:33:52,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:53,069 INFO L124 PetriNetUnfolderBase]: 1911/3314 cut-off events. [2024-06-27 22:33:53,069 INFO L125 PetriNetUnfolderBase]: For 139014/139014 co-relation queries the response was YES. [2024-06-27 22:33:53,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33096 conditions, 3314 events. 1911/3314 cut-off events. For 139014/139014 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 20919 event pairs, 417 based on Foata normal form. 2/3291 useless extension candidates. Maximal degree in co-relation 32929. Up to 2717 conditions per place. [2024-06-27 22:33:53,114 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 584 selfloop transitions, 160 changer transitions 0/759 dead transitions. [2024-06-27 22:33:53,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 759 transitions, 19531 flow [2024-06-27 22:33:53,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:33:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:33:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-27 22:33:53,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924924924924925 [2024-06-27 22:33:53,116 INFO L175 Difference]: Start difference. First operand has 371 places, 709 transitions, 17037 flow. Second operand 9 states and 164 transitions. [2024-06-27 22:33:53,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 759 transitions, 19531 flow [2024-06-27 22:33:53,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 759 transitions, 18770 flow, removed 197 selfloop flow, removed 6 redundant places. [2024-06-27 22:33:53,975 INFO L231 Difference]: Finished difference. Result has 377 places, 729 transitions, 17270 flow [2024-06-27 22:33:53,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16322, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17270, PETRI_PLACES=377, PETRI_TRANSITIONS=729} [2024-06-27 22:33:53,975 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 336 predicate places. [2024-06-27 22:33:53,975 INFO L495 AbstractCegarLoop]: Abstraction has has 377 places, 729 transitions, 17270 flow [2024-06-27 22:33:53,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:53,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:53,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:53,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-06-27 22:33:53,976 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:53,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:53,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1618994878, now seen corresponding path program 2 times [2024-06-27 22:33:53,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:53,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672569205] [2024-06-27 22:33:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:53,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:53,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:55,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:55,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:55,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672569205] [2024-06-27 22:33:55,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672569205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:55,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:55,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:33:55,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289055046] [2024-06-27 22:33:55,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:55,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:33:55,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:55,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:33:55,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:33:55,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:55,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 729 transitions, 17270 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:55,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:55,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:55,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:56,282 INFO L124 PetriNetUnfolderBase]: 2153/3662 cut-off events. [2024-06-27 22:33:56,283 INFO L125 PetriNetUnfolderBase]: For 145069/145069 co-relation queries the response was YES. [2024-06-27 22:33:56,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36696 conditions, 3662 events. 2153/3662 cut-off events. For 145069/145069 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 22617 event pairs, 382 based on Foata normal form. 2/3662 useless extension candidates. Maximal degree in co-relation 36527. Up to 3177 conditions per place. [2024-06-27 22:33:56,336 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 582 selfloop transitions, 205 changer transitions 0/794 dead transitions. [2024-06-27 22:33:56,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 794 transitions, 19887 flow [2024-06-27 22:33:56,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:56,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:33:56,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-27 22:33:56,337 INFO L175 Difference]: Start difference. First operand has 377 places, 729 transitions, 17270 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:33:56,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 794 transitions, 19887 flow [2024-06-27 22:33:57,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 794 transitions, 19400 flow, removed 181 selfloop flow, removed 3 redundant places. [2024-06-27 22:33:57,329 INFO L231 Difference]: Finished difference. Result has 385 places, 761 transitions, 18169 flow [2024-06-27 22:33:57,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16871, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=528, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18169, PETRI_PLACES=385, PETRI_TRANSITIONS=761} [2024-06-27 22:33:57,330 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 344 predicate places. [2024-06-27 22:33:57,330 INFO L495 AbstractCegarLoop]: Abstraction has has 385 places, 761 transitions, 18169 flow [2024-06-27 22:33:57,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:57,330 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:33:57,330 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:33:57,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-06-27 22:33:57,331 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:33:57,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:33:57,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2107755934, now seen corresponding path program 3 times [2024-06-27 22:33:57,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:33:57,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544845052] [2024-06-27 22:33:57,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:33:57,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:33:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:33:58,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:33:58,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:33:58,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544845052] [2024-06-27 22:33:58,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544845052] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:33:58,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:33:58,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:33:58,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691649888] [2024-06-27 22:33:58,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:33:58,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:33:58,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:33:58,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:33:58,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:33:58,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:33:58,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 761 transitions, 18169 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:33:58,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:33:58,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:33:58,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:33:59,874 INFO L124 PetriNetUnfolderBase]: 2191/3721 cut-off events. [2024-06-27 22:33:59,874 INFO L125 PetriNetUnfolderBase]: For 151277/151277 co-relation queries the response was YES. [2024-06-27 22:33:59,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38015 conditions, 3721 events. 2191/3721 cut-off events. For 151277/151277 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 22976 event pairs, 329 based on Foata normal form. 1/3719 useless extension candidates. Maximal degree in co-relation 37842. Up to 2874 conditions per place. [2024-06-27 22:33:59,928 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 491 selfloop transitions, 311 changer transitions 0/809 dead transitions. [2024-06-27 22:33:59,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 809 transitions, 20608 flow [2024-06-27 22:33:59,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:33:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:33:59,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 22:33:59,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2024-06-27 22:33:59,929 INFO L175 Difference]: Start difference. First operand has 385 places, 761 transitions, 18169 flow. Second operand 10 states and 177 transitions. [2024-06-27 22:33:59,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 809 transitions, 20608 flow [2024-06-27 22:34:00,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 809 transitions, 20113 flow, removed 116 selfloop flow, removed 5 redundant places. [2024-06-27 22:34:00,885 INFO L231 Difference]: Finished difference. Result has 392 places, 781 transitions, 19001 flow [2024-06-27 22:34:00,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17674, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=761, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19001, PETRI_PLACES=392, PETRI_TRANSITIONS=781} [2024-06-27 22:34:00,886 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 351 predicate places. [2024-06-27 22:34:00,886 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 781 transitions, 19001 flow [2024-06-27 22:34:00,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:00,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:00,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:00,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-06-27 22:34:00,886 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:00,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:00,887 INFO L85 PathProgramCache]: Analyzing trace with hash -2107755686, now seen corresponding path program 2 times [2024-06-27 22:34:00,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:00,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916654327] [2024-06-27 22:34:00,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:00,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:02,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:02,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916654327] [2024-06-27 22:34:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916654327] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392570210] [2024-06-27 22:34:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:02,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:02,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:02,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:02,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 22:34:02,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 781 transitions, 19001 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:02,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:02,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 22:34:02,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:03,249 INFO L124 PetriNetUnfolderBase]: 2067/3552 cut-off events. [2024-06-27 22:34:03,249 INFO L125 PetriNetUnfolderBase]: For 171902/171902 co-relation queries the response was YES. [2024-06-27 22:34:03,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37895 conditions, 3552 events. 2067/3552 cut-off events. For 171902/171902 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 22507 event pairs, 366 based on Foata normal form. 2/3531 useless extension candidates. Maximal degree in co-relation 37720. Up to 2253 conditions per place. [2024-06-27 22:34:03,303 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 568 selfloop transitions, 255 changer transitions 0/839 dead transitions. [2024-06-27 22:34:03,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 839 transitions, 22346 flow [2024-06-27 22:34:03,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-27 22:34:03,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-06-27 22:34:03,304 INFO L175 Difference]: Start difference. First operand has 392 places, 781 transitions, 19001 flow. Second operand 9 states and 180 transitions. [2024-06-27 22:34:03,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 839 transitions, 22346 flow [2024-06-27 22:34:04,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 839 transitions, 21726 flow, removed 157 selfloop flow, removed 6 redundant places. [2024-06-27 22:34:04,304 INFO L231 Difference]: Finished difference. Result has 399 places, 802 transitions, 19825 flow [2024-06-27 22:34:04,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18387, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=19825, PETRI_PLACES=399, PETRI_TRANSITIONS=802} [2024-06-27 22:34:04,305 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 358 predicate places. [2024-06-27 22:34:04,305 INFO L495 AbstractCegarLoop]: Abstraction has has 399 places, 802 transitions, 19825 flow [2024-06-27 22:34:04,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:04,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:04,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:04,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-06-27 22:34:04,306 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:04,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash -903913114, now seen corresponding path program 1 times [2024-06-27 22:34:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474995210] [2024-06-27 22:34:04,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:04,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:05,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:05,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474995210] [2024-06-27 22:34:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474995210] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:05,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:34:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128746223] [2024-06-27 22:34:05,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:05,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:34:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:05,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:34:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:34:05,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:34:05,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 802 transitions, 19825 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:05,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:05,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:34:05,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:07,266 INFO L124 PetriNetUnfolderBase]: 2105/3610 cut-off events. [2024-06-27 22:34:07,266 INFO L125 PetriNetUnfolderBase]: For 185076/185076 co-relation queries the response was YES. [2024-06-27 22:34:07,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39591 conditions, 3610 events. 2105/3610 cut-off events. For 185076/185076 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 22945 event pairs, 322 based on Foata normal form. 3/3597 useless extension candidates. Maximal degree in co-relation 39411. Up to 2746 conditions per place. [2024-06-27 22:34:07,315 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 465 selfloop transitions, 361 changer transitions 0/841 dead transitions. [2024-06-27 22:34:07,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 841 transitions, 22427 flow [2024-06-27 22:34:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:07,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 22:34:07,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2024-06-27 22:34:07,317 INFO L175 Difference]: Start difference. First operand has 399 places, 802 transitions, 19825 flow. Second operand 10 states and 177 transitions. [2024-06-27 22:34:07,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 841 transitions, 22427 flow [2024-06-27 22:34:08,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 841 transitions, 22110 flow, removed 118 selfloop flow, removed 2 redundant places. [2024-06-27 22:34:08,333 INFO L231 Difference]: Finished difference. Result has 408 places, 818 transitions, 20853 flow [2024-06-27 22:34:08,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19556, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=802, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=345, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=20853, PETRI_PLACES=408, PETRI_TRANSITIONS=818} [2024-06-27 22:34:08,334 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 367 predicate places. [2024-06-27 22:34:08,334 INFO L495 AbstractCegarLoop]: Abstraction has has 408 places, 818 transitions, 20853 flow [2024-06-27 22:34:08,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:08,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:08,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:08,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-06-27 22:34:08,334 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:08,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2101268936, now seen corresponding path program 3 times [2024-06-27 22:34:08,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:08,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578355537] [2024-06-27 22:34:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:08,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:09,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:09,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578355537] [2024-06-27 22:34:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578355537] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:09,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97332470] [2024-06-27 22:34:09,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:09,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:09,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:09,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:09,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 22:34:09,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 408 places, 818 transitions, 20853 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:09,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:09,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 22:34:09,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:10,792 INFO L124 PetriNetUnfolderBase]: 2178/3720 cut-off events. [2024-06-27 22:34:10,792 INFO L125 PetriNetUnfolderBase]: For 193842/193842 co-relation queries the response was YES. [2024-06-27 22:34:10,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41863 conditions, 3720 events. 2178/3720 cut-off events. For 193842/193842 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 23650 event pairs, 355 based on Foata normal form. 2/3704 useless extension candidates. Maximal degree in co-relation 41680. Up to 2365 conditions per place. [2024-06-27 22:34:10,847 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 510 selfloop transitions, 357 changer transitions 0/883 dead transitions. [2024-06-27 22:34:10,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 883 transitions, 24384 flow [2024-06-27 22:34:10,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-27 22:34:10,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285285285285285 [2024-06-27 22:34:10,848 INFO L175 Difference]: Start difference. First operand has 408 places, 818 transitions, 20853 flow. Second operand 9 states and 176 transitions. [2024-06-27 22:34:10,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 883 transitions, 24384 flow [2024-06-27 22:34:11,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 883 transitions, 23465 flow, removed 119 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:11,976 INFO L231 Difference]: Finished difference. Result has 413 places, 844 transitions, 21788 flow [2024-06-27 22:34:11,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=20028, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=331, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=21788, PETRI_PLACES=413, PETRI_TRANSITIONS=844} [2024-06-27 22:34:11,977 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 372 predicate places. [2024-06-27 22:34:11,977 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 844 transitions, 21788 flow [2024-06-27 22:34:11,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:11,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:11,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:11,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-06-27 22:34:11,978 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:11,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2101269184, now seen corresponding path program 4 times [2024-06-27 22:34:11,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:11,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219924854] [2024-06-27 22:34:11,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:11,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:13,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:13,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:13,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219924854] [2024-06-27 22:34:13,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219924854] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:13,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:13,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:13,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132393833] [2024-06-27 22:34:13,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:13,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:13,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:13,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:13,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:13,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:34:13,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 844 transitions, 21788 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:13,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:13,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:34:13,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:14,652 INFO L124 PetriNetUnfolderBase]: 2412/4059 cut-off events. [2024-06-27 22:34:14,652 INFO L125 PetriNetUnfolderBase]: For 205714/205714 co-relation queries the response was YES. [2024-06-27 22:34:14,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45864 conditions, 4059 events. 2412/4059 cut-off events. For 205714/205714 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 25280 event pairs, 323 based on Foata normal form. 1/4057 useless extension candidates. Maximal degree in co-relation 45677. Up to 3209 conditions per place. [2024-06-27 22:34:14,717 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 487 selfloop transitions, 381 changer transitions 0/875 dead transitions. [2024-06-27 22:34:14,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 875 transitions, 23870 flow [2024-06-27 22:34:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 174 transitions. [2024-06-27 22:34:14,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4702702702702703 [2024-06-27 22:34:14,718 INFO L175 Difference]: Start difference. First operand has 413 places, 844 transitions, 21788 flow. Second operand 10 states and 174 transitions. [2024-06-27 22:34:14,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 875 transitions, 23870 flow [2024-06-27 22:34:16,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 875 transitions, 23434 flow, removed 74 selfloop flow, removed 3 redundant places. [2024-06-27 22:34:16,036 INFO L231 Difference]: Finished difference. Result has 421 places, 848 transitions, 22399 flow [2024-06-27 22:34:16,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21352, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=377, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=22399, PETRI_PLACES=421, PETRI_TRANSITIONS=848} [2024-06-27 22:34:16,036 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 380 predicate places. [2024-06-27 22:34:16,036 INFO L495 AbstractCegarLoop]: Abstraction has has 421 places, 848 transitions, 22399 flow [2024-06-27 22:34:16,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:16,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:16,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:16,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-06-27 22:34:16,037 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:16,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash 445986112, now seen corresponding path program 5 times [2024-06-27 22:34:16,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:16,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449789422] [2024-06-27 22:34:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:16,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:17,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:17,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449789422] [2024-06-27 22:34:17,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449789422] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:17,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636808784] [2024-06-27 22:34:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:17,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:17,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:17,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:34:17,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 848 transitions, 22399 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:17,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:17,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:34:17,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:18,821 INFO L124 PetriNetUnfolderBase]: 2410/4056 cut-off events. [2024-06-27 22:34:18,821 INFO L125 PetriNetUnfolderBase]: For 200221/200221 co-relation queries the response was YES. [2024-06-27 22:34:18,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45546 conditions, 4056 events. 2410/4056 cut-off events. For 200221/200221 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 25228 event pairs, 321 based on Foata normal form. 1/4054 useless extension candidates. Maximal degree in co-relation 45356. Up to 3207 conditions per place. [2024-06-27 22:34:18,881 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 530 selfloop transitions, 337 changer transitions 0/874 dead transitions. [2024-06-27 22:34:18,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 874 transitions, 24229 flow [2024-06-27 22:34:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-27 22:34:18,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-27 22:34:18,882 INFO L175 Difference]: Start difference. First operand has 421 places, 848 transitions, 22399 flow. Second operand 10 states and 175 transitions. [2024-06-27 22:34:18,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 874 transitions, 24229 flow [2024-06-27 22:34:20,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 874 transitions, 23365 flow, removed 122 selfloop flow, removed 7 redundant places. [2024-06-27 22:34:20,179 INFO L231 Difference]: Finished difference. Result has 424 places, 848 transitions, 22229 flow [2024-06-27 22:34:20,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21535, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=337, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=22229, PETRI_PLACES=424, PETRI_TRANSITIONS=848} [2024-06-27 22:34:20,180 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 383 predicate places. [2024-06-27 22:34:20,180 INFO L495 AbstractCegarLoop]: Abstraction has has 424 places, 848 transitions, 22229 flow [2024-06-27 22:34:20,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:20,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:20,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:20,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-06-27 22:34:20,180 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:20,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:20,181 INFO L85 PathProgramCache]: Analyzing trace with hash -903913424, now seen corresponding path program 4 times [2024-06-27 22:34:20,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:20,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347591861] [2024-06-27 22:34:20,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:20,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:21,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:21,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347591861] [2024-06-27 22:34:21,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347591861] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:21,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:21,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:21,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186591209] [2024-06-27 22:34:21,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:21,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:21,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:21,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:21,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:34:21,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 848 transitions, 22229 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:21,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:21,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:34:21,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:22,769 INFO L124 PetriNetUnfolderBase]: 2170/3708 cut-off events. [2024-06-27 22:34:22,769 INFO L125 PetriNetUnfolderBase]: For 187642/187642 co-relation queries the response was YES. [2024-06-27 22:34:22,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41628 conditions, 3708 events. 2170/3708 cut-off events. For 187642/187642 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 23525 event pairs, 354 based on Foata normal form. 2/3692 useless extension candidates. Maximal degree in co-relation 41438. Up to 2360 conditions per place. [2024-06-27 22:34:22,828 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 481 selfloop transitions, 392 changer transitions 0/888 dead transitions. [2024-06-27 22:34:22,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 888 transitions, 25003 flow [2024-06-27 22:34:22,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-06-27 22:34:22,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015015015015015 [2024-06-27 22:34:22,830 INFO L175 Difference]: Start difference. First operand has 424 places, 848 transitions, 22229 flow. Second operand 9 states and 167 transitions. [2024-06-27 22:34:22,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 888 transitions, 25003 flow [2024-06-27 22:34:23,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 888 transitions, 24271 flow, removed 34 selfloop flow, removed 8 redundant places. [2024-06-27 22:34:24,003 INFO L231 Difference]: Finished difference. Result has 426 places, 856 transitions, 22754 flow [2024-06-27 22:34:24,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21501, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=848, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=384, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=22754, PETRI_PLACES=426, PETRI_TRANSITIONS=856} [2024-06-27 22:34:24,004 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 385 predicate places. [2024-06-27 22:34:24,004 INFO L495 AbstractCegarLoop]: Abstraction has has 426 places, 856 transitions, 22754 flow [2024-06-27 22:34:24,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:24,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:24,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:24,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-06-27 22:34:24,005 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:24,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:24,005 INFO L85 PathProgramCache]: Analyzing trace with hash -904152434, now seen corresponding path program 5 times [2024-06-27 22:34:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:24,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156859274] [2024-06-27 22:34:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:25,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:25,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156859274] [2024-06-27 22:34:25,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156859274] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:25,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:25,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:25,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887990998] [2024-06-27 22:34:25,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:25,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:25,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:25,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:25,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:25,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 22:34:25,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 856 transitions, 22754 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:25,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:25,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 22:34:25,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:26,442 INFO L124 PetriNetUnfolderBase]: 2166/3702 cut-off events. [2024-06-27 22:34:26,443 INFO L125 PetriNetUnfolderBase]: For 187304/187304 co-relation queries the response was YES. [2024-06-27 22:34:26,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42024 conditions, 3702 events. 2166/3702 cut-off events. For 187304/187304 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 23463 event pairs, 348 based on Foata normal form. 2/3686 useless extension candidates. Maximal degree in co-relation 41835. Up to 2357 conditions per place. [2024-06-27 22:34:26,501 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 567 selfloop transitions, 312 changer transitions 0/895 dead transitions. [2024-06-27 22:34:26,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 895 transitions, 25618 flow [2024-06-27 22:34:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:26,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:26,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2024-06-27 22:34:26,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5375375375375375 [2024-06-27 22:34:26,503 INFO L175 Difference]: Start difference. First operand has 426 places, 856 transitions, 22754 flow. Second operand 9 states and 179 transitions. [2024-06-27 22:34:26,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 895 transitions, 25618 flow [2024-06-27 22:34:27,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 895 transitions, 24980 flow, removed 46 selfloop flow, removed 5 redundant places. [2024-06-27 22:34:27,820 INFO L231 Difference]: Finished difference. Result has 432 places, 858 transitions, 22921 flow [2024-06-27 22:34:27,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=22125, PETRI_DIFFERENCE_MINUEND_PLACES=421, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=856, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=22921, PETRI_PLACES=432, PETRI_TRANSITIONS=858} [2024-06-27 22:34:27,821 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 391 predicate places. [2024-06-27 22:34:27,821 INFO L495 AbstractCegarLoop]: Abstraction has has 432 places, 858 transitions, 22921 flow [2024-06-27 22:34:27,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:27,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:27,821 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:27,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-06-27 22:34:27,822 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:27,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2092987236, now seen corresponding path program 6 times [2024-06-27 22:34:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447558627] [2024-06-27 22:34:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:28,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:28,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447558627] [2024-06-27 22:34:28,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447558627] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:28,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:28,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589813746] [2024-06-27 22:34:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:28,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:28,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:28,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:28,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:28,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:34:28,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 858 transitions, 22921 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:28,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:28,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:34:28,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:30,670 INFO L124 PetriNetUnfolderBase]: 2415/4064 cut-off events. [2024-06-27 22:34:30,670 INFO L125 PetriNetUnfolderBase]: For 193253/193253 co-relation queries the response was YES. [2024-06-27 22:34:30,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45973 conditions, 4064 events. 2415/4064 cut-off events. For 193253/193253 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 25421 event pairs, 254 based on Foata normal form. 2/4060 useless extension candidates. Maximal degree in co-relation 45780. Up to 3614 conditions per place. [2024-06-27 22:34:30,733 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 721 selfloop transitions, 180 changer transitions 0/908 dead transitions. [2024-06-27 22:34:30,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 908 transitions, 25655 flow [2024-06-27 22:34:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 22:34:30,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2024-06-27 22:34:30,734 INFO L175 Difference]: Start difference. First operand has 432 places, 858 transitions, 22921 flow. Second operand 10 states and 166 transitions. [2024-06-27 22:34:30,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 908 transitions, 25655 flow [2024-06-27 22:34:32,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 908 transitions, 25028 flow, removed 105 selfloop flow, removed 4 redundant places. [2024-06-27 22:34:32,084 INFO L231 Difference]: Finished difference. Result has 440 places, 887 transitions, 23686 flow [2024-06-27 22:34:32,084 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=22367, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=858, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=23686, PETRI_PLACES=440, PETRI_TRANSITIONS=887} [2024-06-27 22:34:32,084 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 399 predicate places. [2024-06-27 22:34:32,084 INFO L495 AbstractCegarLoop]: Abstraction has has 440 places, 887 transitions, 23686 flow [2024-06-27 22:34:32,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:32,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:32,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:32,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-06-27 22:34:32,085 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:32,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1288210666, now seen corresponding path program 7 times [2024-06-27 22:34:32,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:32,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427577612] [2024-06-27 22:34:32,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:32,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:33,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:33,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427577612] [2024-06-27 22:34:33,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427577612] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:33,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:33,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801814600] [2024-06-27 22:34:33,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:33,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:33,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:33,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:33,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:33,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:34:33,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 887 transitions, 23686 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:33,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:33,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:34:33,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:35,226 INFO L124 PetriNetUnfolderBase]: 2436/4095 cut-off events. [2024-06-27 22:34:35,226 INFO L125 PetriNetUnfolderBase]: For 191938/191938 co-relation queries the response was YES. [2024-06-27 22:34:35,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46123 conditions, 4095 events. 2436/4095 cut-off events. For 191938/191938 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 25635 event pairs, 242 based on Foata normal form. 1/4090 useless extension candidates. Maximal degree in co-relation 45926. Up to 3483 conditions per place. [2024-06-27 22:34:35,293 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 676 selfloop transitions, 265 changer transitions 0/948 dead transitions. [2024-06-27 22:34:35,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 948 transitions, 26671 flow [2024-06-27 22:34:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:34:35,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:34:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2024-06-27 22:34:35,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4490644490644491 [2024-06-27 22:34:35,294 INFO L175 Difference]: Start difference. First operand has 440 places, 887 transitions, 23686 flow. Second operand 13 states and 216 transitions. [2024-06-27 22:34:35,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 948 transitions, 26671 flow [2024-06-27 22:34:36,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 948 transitions, 26283 flow, removed 72 selfloop flow, removed 6 redundant places. [2024-06-27 22:34:36,769 INFO L231 Difference]: Finished difference. Result has 448 places, 918 transitions, 24917 flow [2024-06-27 22:34:36,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=23316, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=887, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=628, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=24917, PETRI_PLACES=448, PETRI_TRANSITIONS=918} [2024-06-27 22:34:36,770 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 407 predicate places. [2024-06-27 22:34:36,770 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 918 transitions, 24917 flow [2024-06-27 22:34:36,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:36,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:36,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:36,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-06-27 22:34:36,771 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:36,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1281781576, now seen corresponding path program 8 times [2024-06-27 22:34:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:36,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142869205] [2024-06-27 22:34:36,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:36,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:38,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:38,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142869205] [2024-06-27 22:34:38,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142869205] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:38,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:38,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:38,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257222352] [2024-06-27 22:34:38,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:38,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:38,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:38,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:38,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:38,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:34:38,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 918 transitions, 24917 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:38,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:38,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:34:38,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:39,826 INFO L124 PetriNetUnfolderBase]: 2439/4099 cut-off events. [2024-06-27 22:34:39,826 INFO L125 PetriNetUnfolderBase]: For 195901/195901 co-relation queries the response was YES. [2024-06-27 22:34:39,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46501 conditions, 4099 events. 2439/4099 cut-off events. For 195901/195901 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 25678 event pairs, 243 based on Foata normal form. 1/4094 useless extension candidates. Maximal degree in co-relation 46302. Up to 3408 conditions per place. [2024-06-27 22:34:39,886 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 653 selfloop transitions, 291 changer transitions 0/951 dead transitions. [2024-06-27 22:34:39,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 951 transitions, 27243 flow [2024-06-27 22:34:39,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:39,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 22:34:39,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4894894894894895 [2024-06-27 22:34:39,887 INFO L175 Difference]: Start difference. First operand has 448 places, 918 transitions, 24917 flow. Second operand 9 states and 163 transitions. [2024-06-27 22:34:39,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 951 transitions, 27243 flow [2024-06-27 22:34:41,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 951 transitions, 26386 flow, removed 324 selfloop flow, removed 6 redundant places. [2024-06-27 22:34:41,370 INFO L231 Difference]: Finished difference. Result has 453 places, 930 transitions, 25252 flow [2024-06-27 22:34:41,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=24061, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=916, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=277, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=25252, PETRI_PLACES=453, PETRI_TRANSITIONS=930} [2024-06-27 22:34:41,370 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 412 predicate places. [2024-06-27 22:34:41,370 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 930 transitions, 25252 flow [2024-06-27 22:34:41,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:41,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:41,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:41,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-06-27 22:34:41,371 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:41,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:41,371 INFO L85 PathProgramCache]: Analyzing trace with hash -835971460, now seen corresponding path program 9 times [2024-06-27 22:34:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:41,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429693618] [2024-06-27 22:34:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:42,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:42,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:42,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429693618] [2024-06-27 22:34:42,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429693618] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:42,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:42,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:42,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876204573] [2024-06-27 22:34:42,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:42,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:42,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:42,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:42,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:42,741 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:34:42,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 930 transitions, 25252 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:42,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:42,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:34:42,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:44,367 INFO L124 PetriNetUnfolderBase]: 2440/4100 cut-off events. [2024-06-27 22:34:44,367 INFO L125 PetriNetUnfolderBase]: For 190269/190269 co-relation queries the response was YES. [2024-06-27 22:34:44,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46912 conditions, 4100 events. 2440/4100 cut-off events. For 190269/190269 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 25616 event pairs, 244 based on Foata normal form. 1/4095 useless extension candidates. Maximal degree in co-relation 46709. Up to 3569 conditions per place. [2024-06-27 22:34:44,436 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 698 selfloop transitions, 250 changer transitions 0/955 dead transitions. [2024-06-27 22:34:44,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 955 transitions, 27330 flow [2024-06-27 22:34:44,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-27 22:34:44,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-27 22:34:44,438 INFO L175 Difference]: Start difference. First operand has 453 places, 930 transitions, 25252 flow. Second operand 10 states and 175 transitions. [2024-06-27 22:34:44,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 955 transitions, 27330 flow [2024-06-27 22:34:46,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 955 transitions, 26757 flow, removed 98 selfloop flow, removed 6 redundant places. [2024-06-27 22:34:46,063 INFO L231 Difference]: Finished difference. Result has 457 places, 930 transitions, 25266 flow [2024-06-27 22:34:46,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=24650, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=927, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=25266, PETRI_PLACES=457, PETRI_TRANSITIONS=930} [2024-06-27 22:34:46,064 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 416 predicate places. [2024-06-27 22:34:46,064 INFO L495 AbstractCegarLoop]: Abstraction has has 457 places, 930 transitions, 25266 flow [2024-06-27 22:34:46,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:46,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:46,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:46,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-06-27 22:34:46,065 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:46,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:46,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1614622856, now seen corresponding path program 10 times [2024-06-27 22:34:46,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:46,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856481110] [2024-06-27 22:34:46,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:46,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:47,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:47,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:47,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856481110] [2024-06-27 22:34:47,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856481110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:47,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:47,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:47,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8644047] [2024-06-27 22:34:47,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:47,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:47,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:47,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:47,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:47,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:34:47,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 930 transitions, 25266 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:47,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:47,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:34:47,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:49,343 INFO L124 PetriNetUnfolderBase]: 2463/4136 cut-off events. [2024-06-27 22:34:49,343 INFO L125 PetriNetUnfolderBase]: For 193985/193985 co-relation queries the response was YES. [2024-06-27 22:34:49,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47259 conditions, 4136 events. 2463/4136 cut-off events. For 193985/193985 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 25922 event pairs, 247 based on Foata normal form. 1/4131 useless extension candidates. Maximal degree in co-relation 47056. Up to 3203 conditions per place. [2024-06-27 22:34:49,414 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 586 selfloop transitions, 374 changer transitions 0/967 dead transitions. [2024-06-27 22:34:49,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 967 transitions, 27590 flow [2024-06-27 22:34:49,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:34:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:34:49,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2024-06-27 22:34:49,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44819819819819817 [2024-06-27 22:34:49,415 INFO L175 Difference]: Start difference. First operand has 457 places, 930 transitions, 25266 flow. Second operand 12 states and 199 transitions. [2024-06-27 22:34:49,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 967 transitions, 27590 flow [2024-06-27 22:34:50,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 463 places, 967 transitions, 27209 flow, removed 14 selfloop flow, removed 5 redundant places. [2024-06-27 22:34:50,968 INFO L231 Difference]: Finished difference. Result has 465 places, 937 transitions, 25829 flow [2024-06-27 22:34:50,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=24885, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=367, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=25829, PETRI_PLACES=465, PETRI_TRANSITIONS=937} [2024-06-27 22:34:50,969 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 424 predicate places. [2024-06-27 22:34:50,969 INFO L495 AbstractCegarLoop]: Abstraction has has 465 places, 937 transitions, 25829 flow [2024-06-27 22:34:50,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:50,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:50,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:50,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-06-27 22:34:50,970 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:50,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:50,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1612003838, now seen corresponding path program 6 times [2024-06-27 22:34:50,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:50,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979333357] [2024-06-27 22:34:50,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:50,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:52,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979333357] [2024-06-27 22:34:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979333357] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:52,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:52,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:34:52,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687606298] [2024-06-27 22:34:52,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:52,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:34:52,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:52,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:34:52,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:34:52,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:34:52,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 465 places, 937 transitions, 25829 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:52,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:52,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:34:52,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:53,968 INFO L124 PetriNetUnfolderBase]: 2262/3849 cut-off events. [2024-06-27 22:34:53,969 INFO L125 PetriNetUnfolderBase]: For 208576/208576 co-relation queries the response was YES. [2024-06-27 22:34:54,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45015 conditions, 3849 events. 2262/3849 cut-off events. For 208576/208576 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 24629 event pairs, 356 based on Foata normal form. 2/3827 useless extension candidates. Maximal degree in co-relation 44810. Up to 2116 conditions per place. [2024-06-27 22:34:54,033 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 628 selfloop transitions, 362 changer transitions 0/1005 dead transitions. [2024-06-27 22:34:54,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 1005 transitions, 29818 flow [2024-06-27 22:34:54,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:34:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:34:54,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 174 transitions. [2024-06-27 22:34:54,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5225225225225225 [2024-06-27 22:34:54,034 INFO L175 Difference]: Start difference. First operand has 465 places, 937 transitions, 25829 flow. Second operand 9 states and 174 transitions. [2024-06-27 22:34:54,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 1005 transitions, 29818 flow [2024-06-27 22:34:55,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 1005 transitions, 29029 flow, removed 27 selfloop flow, removed 9 redundant places. [2024-06-27 22:34:55,509 INFO L231 Difference]: Finished difference. Result has 470 places, 969 transitions, 27028 flow [2024-06-27 22:34:55,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=25040, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=333, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=27028, PETRI_PLACES=470, PETRI_TRANSITIONS=969} [2024-06-27 22:34:55,509 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 429 predicate places. [2024-06-27 22:34:55,510 INFO L495 AbstractCegarLoop]: Abstraction has has 470 places, 969 transitions, 27028 flow [2024-06-27 22:34:55,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:34:55,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:34:55,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:34:55,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-06-27 22:34:55,510 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:34:55,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:34:55,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1611824100, now seen corresponding path program 11 times [2024-06-27 22:34:55,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:34:55,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898714904] [2024-06-27 22:34:55,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:34:55,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:34:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:34:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:34:56,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:34:56,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898714904] [2024-06-27 22:34:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898714904] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:34:56,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:34:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:34:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739118627] [2024-06-27 22:34:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:34:56,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:34:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:34:56,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:34:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:34:56,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:34:56,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 969 transitions, 27028 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-27 22:34:56,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:34:56,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:34:56,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:34:58,292 INFO L124 PetriNetUnfolderBase]: 2514/4215 cut-off events. [2024-06-27 22:34:58,292 INFO L125 PetriNetUnfolderBase]: For 215949/215949 co-relation queries the response was YES. [2024-06-27 22:34:58,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50030 conditions, 4215 events. 2514/4215 cut-off events. For 215949/215949 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 26479 event pairs, 256 based on Foata normal form. 1/4210 useless extension candidates. Maximal degree in co-relation 49820. Up to 2889 conditions per place. [2024-06-27 22:34:58,364 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 526 selfloop transitions, 470 changer transitions 0/1003 dead transitions. [2024-06-27 22:34:58,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 1003 transitions, 29799 flow [2024-06-27 22:34:58,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:34:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:34:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:34:58,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-27 22:34:58,365 INFO L175 Difference]: Start difference. First operand has 470 places, 969 transitions, 27028 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:34:58,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 479 places, 1003 transitions, 29799 flow [2024-06-27 22:35:00,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 1003 transitions, 29354 flow, removed 185 selfloop flow, removed 1 redundant places. [2024-06-27 22:35:00,081 INFO L231 Difference]: Finished difference. Result has 480 places, 982 transitions, 28157 flow [2024-06-27 22:35:00,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=26671, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=458, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=28157, PETRI_PLACES=480, PETRI_TRANSITIONS=982} [2024-06-27 22:35:00,081 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 439 predicate places. [2024-06-27 22:35:00,081 INFO L495 AbstractCegarLoop]: Abstraction has has 480 places, 982 transitions, 28157 flow [2024-06-27 22:35:00,082 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-27 22:35:00,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:00,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:00,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-06-27 22:35:00,082 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:00,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1618259948, now seen corresponding path program 7 times [2024-06-27 22:35:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:00,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890438705] [2024-06-27 22:35:00,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:00,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:01,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890438705] [2024-06-27 22:35:01,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890438705] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:01,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029006467] [2024-06-27 22:35:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:01,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:01,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:01,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:01,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:35:01,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 982 transitions, 28157 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:01,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:01,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:35:01,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:03,177 INFO L124 PetriNetUnfolderBase]: 2343/3973 cut-off events. [2024-06-27 22:35:03,177 INFO L125 PetriNetUnfolderBase]: For 236470/236470 co-relation queries the response was YES. [2024-06-27 22:35:03,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48493 conditions, 3973 events. 2343/3973 cut-off events. For 236470/236470 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 25461 event pairs, 360 based on Foata normal form. 2/3951 useless extension candidates. Maximal degree in co-relation 48279. Up to 2178 conditions per place. [2024-06-27 22:35:03,248 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 660 selfloop transitions, 371 changer transitions 0/1046 dead transitions. [2024-06-27 22:35:03,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 1046 transitions, 32563 flow [2024-06-27 22:35:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:35:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:35:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 180 transitions. [2024-06-27 22:35:03,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2024-06-27 22:35:03,249 INFO L175 Difference]: Start difference. First operand has 480 places, 982 transitions, 28157 flow. Second operand 9 states and 180 transitions. [2024-06-27 22:35:03,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 1046 transitions, 32563 flow [2024-06-27 22:35:04,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 1046 transitions, 31715 flow, removed 185 selfloop flow, removed 6 redundant places. [2024-06-27 22:35:04,899 INFO L231 Difference]: Finished difference. Result has 486 places, 1004 transitions, 28952 flow [2024-06-27 22:35:04,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=27425, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=982, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=28952, PETRI_PLACES=486, PETRI_TRANSITIONS=1004} [2024-06-27 22:35:04,900 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 445 predicate places. [2024-06-27 22:35:04,900 INFO L495 AbstractCegarLoop]: Abstraction has has 486 places, 1004 transitions, 28952 flow [2024-06-27 22:35:04,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:04,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:04,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:04,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-06-27 22:35:04,901 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:04,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash 980071806, now seen corresponding path program 8 times [2024-06-27 22:35:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:04,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620301145] [2024-06-27 22:35:04,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:06,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:06,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:06,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620301145] [2024-06-27 22:35:06,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620301145] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:06,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:06,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:06,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222426543] [2024-06-27 22:35:06,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:06,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:06,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:06,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:06,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:06,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:35:06,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 1004 transitions, 28952 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:06,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:06,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:35:06,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:08,108 INFO L124 PetriNetUnfolderBase]: 2430/4104 cut-off events. [2024-06-27 22:35:08,109 INFO L125 PetriNetUnfolderBase]: For 257250/257250 co-relation queries the response was YES. [2024-06-27 22:35:08,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51297 conditions, 4104 events. 2430/4104 cut-off events. For 257250/257250 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 26345 event pairs, 275 based on Foata normal form. 2/4087 useless extension candidates. Maximal degree in co-relation 51080. Up to 2248 conditions per place. [2024-06-27 22:35:08,179 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 624 selfloop transitions, 431 changer transitions 0/1070 dead transitions. [2024-06-27 22:35:08,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 1070 transitions, 33388 flow [2024-06-27 22:35:08,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:35:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:35:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-27 22:35:08,180 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2024-06-27 22:35:08,180 INFO L175 Difference]: Start difference. First operand has 486 places, 1004 transitions, 28952 flow. Second operand 9 states and 177 transitions. [2024-06-27 22:35:08,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 1070 transitions, 33388 flow [2024-06-27 22:35:09,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 491 places, 1070 transitions, 32566 flow, removed 85 selfloop flow, removed 3 redundant places. [2024-06-27 22:35:09,942 INFO L231 Difference]: Finished difference. Result has 495 places, 1026 transitions, 29820 flow [2024-06-27 22:35:09,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=28148, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1004, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=409, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=29820, PETRI_PLACES=495, PETRI_TRANSITIONS=1026} [2024-06-27 22:35:09,943 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 454 predicate places. [2024-06-27 22:35:09,943 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 1026 transitions, 29820 flow [2024-06-27 22:35:09,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:09,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:09,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:09,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-06-27 22:35:09,944 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:09,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1275299376, now seen corresponding path program 9 times [2024-06-27 22:35:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:09,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646849070] [2024-06-27 22:35:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:09,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:11,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-27 22:35:11,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:11,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646849070] [2024-06-27 22:35:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646849070] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:11,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:11,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:11,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150064938] [2024-06-27 22:35:11,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:11,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:11,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:11,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:11,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:35:11,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 1026 transitions, 29820 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:11,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:11,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:35:11,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:13,167 INFO L124 PetriNetUnfolderBase]: 2721/4545 cut-off events. [2024-06-27 22:35:13,167 INFO L125 PetriNetUnfolderBase]: For 266382/266382 co-relation queries the response was YES. [2024-06-27 22:35:13,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56351 conditions, 4545 events. 2721/4545 cut-off events. For 266382/266382 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 28815 event pairs, 640 based on Foata normal form. 1/4543 useless extension candidates. Maximal degree in co-relation 56130. Up to 4322 conditions per place. [2024-06-27 22:35:13,250 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 1008 selfloop transitions, 41 changer transitions 0/1056 dead transitions. [2024-06-27 22:35:13,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 1056 transitions, 32274 flow [2024-06-27 22:35:13,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:13,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:13,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 159 transitions. [2024-06-27 22:35:13,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4297297297297297 [2024-06-27 22:35:13,251 INFO L175 Difference]: Start difference. First operand has 495 places, 1026 transitions, 29820 flow. Second operand 10 states and 159 transitions. [2024-06-27 22:35:13,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 1056 transitions, 32274 flow [2024-06-27 22:35:15,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 1056 transitions, 31763 flow, removed 55 selfloop flow, removed 2 redundant places. [2024-06-27 22:35:15,313 INFO L231 Difference]: Finished difference. Result has 504 places, 1033 transitions, 29687 flow [2024-06-27 22:35:15,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=29313, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=985, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=29687, PETRI_PLACES=504, PETRI_TRANSITIONS=1033} [2024-06-27 22:35:15,314 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 463 predicate places. [2024-06-27 22:35:15,314 INFO L495 AbstractCegarLoop]: Abstraction has has 504 places, 1033 transitions, 29687 flow [2024-06-27 22:35:15,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:15,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:15,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:15,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-06-27 22:35:15,315 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:15,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:15,315 INFO L85 PathProgramCache]: Analyzing trace with hash 979841166, now seen corresponding path program 10 times [2024-06-27 22:35:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467744256] [2024-06-27 22:35:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:15,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:16,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:16,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467744256] [2024-06-27 22:35:16,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467744256] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:16,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:16,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:16,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105811350] [2024-06-27 22:35:16,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:16,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:16,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:35:16,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 1033 transitions, 29687 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:16,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:16,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:35:16,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:18,605 INFO L124 PetriNetUnfolderBase]: 2437/4116 cut-off events. [2024-06-27 22:35:18,605 INFO L125 PetriNetUnfolderBase]: For 259015/259015 co-relation queries the response was YES. [2024-06-27 22:35:18,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50989 conditions, 4116 events. 2437/4116 cut-off events. For 259015/259015 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 26469 event pairs, 269 based on Foata normal form. 2/4098 useless extension candidates. Maximal degree in co-relation 50765. Up to 2254 conditions per place. [2024-06-27 22:35:18,674 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 616 selfloop transitions, 444 changer transitions 0/1075 dead transitions. [2024-06-27 22:35:18,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 512 places, 1075 transitions, 33211 flow [2024-06-27 22:35:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:35:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:35:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-27 22:35:18,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5195195195195195 [2024-06-27 22:35:18,676 INFO L175 Difference]: Start difference. First operand has 504 places, 1033 transitions, 29687 flow. Second operand 9 states and 173 transitions. [2024-06-27 22:35:18,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 512 places, 1075 transitions, 33211 flow [2024-06-27 22:35:20,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 1075 transitions, 32927 flow, removed 108 selfloop flow, removed 7 redundant places. [2024-06-27 22:35:20,541 INFO L231 Difference]: Finished difference. Result has 507 places, 1037 transitions, 30478 flow [2024-06-27 22:35:20,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=29403, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1033, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=440, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=30478, PETRI_PLACES=507, PETRI_TRANSITIONS=1037} [2024-06-27 22:35:20,542 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 466 predicate places. [2024-06-27 22:35:20,542 INFO L495 AbstractCegarLoop]: Abstraction has has 507 places, 1037 transitions, 30478 flow [2024-06-27 22:35:20,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:20,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:20,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:20,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-06-27 22:35:20,542 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:20,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:20,542 INFO L85 PathProgramCache]: Analyzing trace with hash 638590362, now seen corresponding path program 12 times [2024-06-27 22:35:20,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:20,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380553686] [2024-06-27 22:35:20,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380553686] [2024-06-27 22:35:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380553686] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:21,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:21,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:21,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632335176] [2024-06-27 22:35:21,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:21,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:21,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:21,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:21,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:21,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:35:21,929 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 1037 transitions, 30478 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:21,929 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:21,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:35:21,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:23,836 INFO L124 PetriNetUnfolderBase]: 2715/4520 cut-off events. [2024-06-27 22:35:23,836 INFO L125 PetriNetUnfolderBase]: For 266885/266885 co-relation queries the response was YES. [2024-06-27 22:35:23,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56389 conditions, 4520 events. 2715/4520 cut-off events. For 266885/266885 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 28489 event pairs, 261 based on Foata normal form. 1/4515 useless extension candidates. Maximal degree in co-relation 56164. Up to 3171 conditions per place. [2024-06-27 22:35:23,922 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 536 selfloop transitions, 521 changer transitions 0/1064 dead transitions. [2024-06-27 22:35:23,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 1064 transitions, 33137 flow [2024-06-27 22:35:23,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-27 22:35:23,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648648648648649 [2024-06-27 22:35:23,923 INFO L175 Difference]: Start difference. First operand has 507 places, 1037 transitions, 30478 flow. Second operand 10 states and 172 transitions. [2024-06-27 22:35:23,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 1064 transitions, 33137 flow [2024-06-27 22:35:26,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 1064 transitions, 32441 flow, removed 64 selfloop flow, removed 4 redundant places. [2024-06-27 22:35:26,170 INFO L231 Difference]: Finished difference. Result has 513 places, 1042 transitions, 31002 flow [2024-06-27 22:35:26,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=29782, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1037, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=516, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=31002, PETRI_PLACES=513, PETRI_TRANSITIONS=1042} [2024-06-27 22:35:26,171 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 472 predicate places. [2024-06-27 22:35:26,171 INFO L495 AbstractCegarLoop]: Abstraction has has 513 places, 1042 transitions, 31002 flow [2024-06-27 22:35:26,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:26,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:26,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:26,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-06-27 22:35:26,172 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:26,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:26,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1848179198, now seen corresponding path program 11 times [2024-06-27 22:35:26,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:26,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715985080] [2024-06-27 22:35:26,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:26,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:27,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:27,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715985080] [2024-06-27 22:35:27,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715985080] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:27,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:27,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:27,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593469753] [2024-06-27 22:35:27,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:27,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:27,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:27,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:27,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:27,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:35:27,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 513 places, 1042 transitions, 31002 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:27,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:27,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:35:27,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:29,335 INFO L124 PetriNetUnfolderBase]: 2451/4136 cut-off events. [2024-06-27 22:35:29,336 INFO L125 PetriNetUnfolderBase]: For 273717/273717 co-relation queries the response was YES. [2024-06-27 22:35:29,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52195 conditions, 4136 events. 2451/4136 cut-off events. For 273717/273717 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 26587 event pairs, 276 based on Foata normal form. 2/4119 useless extension candidates. Maximal degree in co-relation 51969. Up to 2267 conditions per place. [2024-06-27 22:35:29,551 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 536 selfloop transitions, 529 changer transitions 0/1080 dead transitions. [2024-06-27 22:35:29,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 1080 transitions, 34310 flow [2024-06-27 22:35:29,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:35:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:35:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 22:35:29,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105105105105106 [2024-06-27 22:35:29,552 INFO L175 Difference]: Start difference. First operand has 513 places, 1042 transitions, 31002 flow. Second operand 9 states and 170 transitions. [2024-06-27 22:35:29,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 1080 transitions, 34310 flow [2024-06-27 22:35:31,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 1080 transitions, 33665 flow, removed 55 selfloop flow, removed 6 redundant places. [2024-06-27 22:35:31,500 INFO L231 Difference]: Finished difference. Result has 517 places, 1048 transitions, 31675 flow [2024-06-27 22:35:31,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=30362, PETRI_DIFFERENCE_MINUEND_PLACES=507, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=523, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=31675, PETRI_PLACES=517, PETRI_TRANSITIONS=1048} [2024-06-27 22:35:31,501 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 476 predicate places. [2024-06-27 22:35:31,501 INFO L495 AbstractCegarLoop]: Abstraction has has 517 places, 1048 transitions, 31675 flow [2024-06-27 22:35:31,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:31,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:31,501 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:31,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-06-27 22:35:31,501 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:31,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1265171428, now seen corresponding path program 13 times [2024-06-27 22:35:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016232030] [2024-06-27 22:35:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:32,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:32,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016232030] [2024-06-27 22:35:32,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016232030] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:32,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:32,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:32,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476613454] [2024-06-27 22:35:32,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:32,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:32,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:32,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:32,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:32,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:35:32,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 1048 transitions, 31675 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:32,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:32,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:35:32,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:34,663 INFO L124 PetriNetUnfolderBase]: 2733/4547 cut-off events. [2024-06-27 22:35:34,663 INFO L125 PetriNetUnfolderBase]: For 281342/281342 co-relation queries the response was YES. [2024-06-27 22:35:34,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57177 conditions, 4547 events. 2733/4547 cut-off events. For 281342/281342 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 28700 event pairs, 262 based on Foata normal form. 1/4542 useless extension candidates. Maximal degree in co-relation 56951. Up to 3199 conditions per place. [2024-06-27 22:35:34,750 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 469 selfloop transitions, 594 changer transitions 0/1070 dead transitions. [2024-06-27 22:35:34,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 1070 transitions, 34089 flow [2024-06-27 22:35:34,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 169 transitions. [2024-06-27 22:35:34,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45675675675675675 [2024-06-27 22:35:34,751 INFO L175 Difference]: Start difference. First operand has 517 places, 1048 transitions, 31675 flow. Second operand 10 states and 169 transitions. [2024-06-27 22:35:34,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 1070 transitions, 34089 flow [2024-06-27 22:35:37,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 1070 transitions, 33377 flow, removed 75 selfloop flow, removed 4 redundant places. [2024-06-27 22:35:37,243 INFO L231 Difference]: Finished difference. Result has 523 places, 1049 transitions, 32220 flow [2024-06-27 22:35:37,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=30963, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=593, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=32220, PETRI_PLACES=523, PETRI_TRANSITIONS=1049} [2024-06-27 22:35:37,244 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 482 predicate places. [2024-06-27 22:35:37,244 INFO L495 AbstractCegarLoop]: Abstraction has has 523 places, 1049 transitions, 32220 flow [2024-06-27 22:35:37,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:37,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:37,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:37,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-06-27 22:35:37,244 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:37,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:37,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1618259700, now seen corresponding path program 14 times [2024-06-27 22:35:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:37,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671549447] [2024-06-27 22:35:37,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:37,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:38,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:38,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671549447] [2024-06-27 22:35:38,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671549447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:38,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:38,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:38,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92053848] [2024-06-27 22:35:38,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:38,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:38,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:38,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:38,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:38,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:35:38,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 1049 transitions, 32220 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:38,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:38,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:35:38,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:40,418 INFO L124 PetriNetUnfolderBase]: 2730/4542 cut-off events. [2024-06-27 22:35:40,418 INFO L125 PetriNetUnfolderBase]: For 281398/281398 co-relation queries the response was YES. [2024-06-27 22:35:40,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57272 conditions, 4542 events. 2730/4542 cut-off events. For 281398/281398 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 28619 event pairs, 263 based on Foata normal form. 1/4537 useless extension candidates. Maximal degree in co-relation 57045. Up to 3195 conditions per place. [2024-06-27 22:35:40,507 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 582 selfloop transitions, 483 changer transitions 0/1072 dead transitions. [2024-06-27 22:35:40,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 1072 transitions, 34796 flow [2024-06-27 22:35:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 22:35:40,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4783783783783784 [2024-06-27 22:35:40,509 INFO L175 Difference]: Start difference. First operand has 523 places, 1049 transitions, 32220 flow. Second operand 10 states and 177 transitions. [2024-06-27 22:35:40,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 1072 transitions, 34796 flow [2024-06-27 22:35:42,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 1072 transitions, 33917 flow, removed 104 selfloop flow, removed 6 redundant places. [2024-06-27 22:35:42,948 INFO L231 Difference]: Finished difference. Result has 527 places, 1050 transitions, 32382 flow [2024-06-27 22:35:42,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=31348, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=482, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=32382, PETRI_PLACES=527, PETRI_TRANSITIONS=1050} [2024-06-27 22:35:42,949 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 486 predicate places. [2024-06-27 22:35:42,949 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 1050 transitions, 32382 flow [2024-06-27 22:35:42,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:42,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:42,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:42,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-06-27 22:35:42,950 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:42,950 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 638821002, now seen corresponding path program 15 times [2024-06-27 22:35:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25470405] [2024-06-27 22:35:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:44,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:44,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25470405] [2024-06-27 22:35:44,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25470405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:44,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:44,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:44,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218108564] [2024-06-27 22:35:44,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:44,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:44,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:44,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:44,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:44,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:35:44,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 1050 transitions, 32382 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:44,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:44,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:35:44,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:46,298 INFO L124 PetriNetUnfolderBase]: 2727/4537 cut-off events. [2024-06-27 22:35:46,299 INFO L125 PetriNetUnfolderBase]: For 280914/280914 co-relation queries the response was YES. [2024-06-27 22:35:46,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56994 conditions, 4537 events. 2727/4537 cut-off events. For 280914/280914 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 28621 event pairs, 261 based on Foata normal form. 1/4532 useless extension candidates. Maximal degree in co-relation 56767. Up to 3191 conditions per place. [2024-06-27 22:35:46,390 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 543 selfloop transitions, 521 changer transitions 0/1071 dead transitions. [2024-06-27 22:35:46,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 1071 transitions, 34742 flow [2024-06-27 22:35:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:35:46,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:35:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-27 22:35:46,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46756756756756757 [2024-06-27 22:35:46,392 INFO L175 Difference]: Start difference. First operand has 527 places, 1050 transitions, 32382 flow. Second operand 10 states and 173 transitions. [2024-06-27 22:35:46,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 1071 transitions, 34742 flow [2024-06-27 22:35:48,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 1071 transitions, 33295 flow, removed 110 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:48,738 INFO L231 Difference]: Finished difference. Result has 529 places, 1050 transitions, 31990 flow [2024-06-27 22:35:48,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=30937, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=521, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=529, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=31990, PETRI_PLACES=529, PETRI_TRANSITIONS=1050} [2024-06-27 22:35:48,738 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 488 predicate places. [2024-06-27 22:35:48,739 INFO L495 AbstractCegarLoop]: Abstraction has has 529 places, 1050 transitions, 31990 flow [2024-06-27 22:35:48,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:48,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:48,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:48,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-06-27 22:35:48,739 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:48,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:48,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1840143998, now seen corresponding path program 12 times [2024-06-27 22:35:48,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:48,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050655275] [2024-06-27 22:35:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:48,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:50,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:50,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050655275] [2024-06-27 22:35:50,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050655275] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:50,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:35:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268120026] [2024-06-27 22:35:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:50,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:35:50,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:35:50,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:35:50,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:35:50,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 1050 transitions, 31990 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:50,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:50,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:35:50,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:51,675 INFO L124 PetriNetUnfolderBase]: 2442/4121 cut-off events. [2024-06-27 22:35:51,675 INFO L125 PetriNetUnfolderBase]: For 271889/271889 co-relation queries the response was YES. [2024-06-27 22:35:51,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52030 conditions, 4121 events. 2442/4121 cut-off events. For 271889/271889 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 26463 event pairs, 255 based on Foata normal form. 1/4105 useless extension candidates. Maximal degree in co-relation 51803. Up to 2923 conditions per place. [2024-06-27 22:35:51,757 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 777 selfloop transitions, 354 changer transitions 0/1146 dead transitions. [2024-06-27 22:35:51,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 1146 transitions, 37258 flow [2024-06-27 22:35:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:35:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:35:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 22:35:51,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105105105105106 [2024-06-27 22:35:51,758 INFO L175 Difference]: Start difference. First operand has 529 places, 1050 transitions, 31990 flow. Second operand 9 states and 170 transitions. [2024-06-27 22:35:51,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 1146 transitions, 37258 flow [2024-06-27 22:35:53,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 1146 transitions, 36180 flow, removed 31 selfloop flow, removed 8 redundant places. [2024-06-27 22:35:53,688 INFO L231 Difference]: Finished difference. Result has 535 places, 1104 transitions, 33866 flow [2024-06-27 22:35:53,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=30936, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=302, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=33866, PETRI_PLACES=535, PETRI_TRANSITIONS=1104} [2024-06-27 22:35:53,689 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 494 predicate places. [2024-06-27 22:35:53,689 INFO L495 AbstractCegarLoop]: Abstraction has has 535 places, 1104 transitions, 33866 flow [2024-06-27 22:35:53,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:53,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:53,690 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:53,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-06-27 22:35:53,690 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:53,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:53,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1618490588, now seen corresponding path program 13 times [2024-06-27 22:35:53,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:53,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081383483] [2024-06-27 22:35:53,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:53,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:35:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:35:55,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:35:55,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081383483] [2024-06-27 22:35:55,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081383483] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:35:55,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:35:55,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:35:55,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595886098] [2024-06-27 22:35:55,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:35:55,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:35:55,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:35:55,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:35:55,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:35:55,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:35:55,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 1104 transitions, 33866 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:55,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:35:55,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:35:55,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:35:57,179 INFO L124 PetriNetUnfolderBase]: 2459/4147 cut-off events. [2024-06-27 22:35:57,179 INFO L125 PetriNetUnfolderBase]: For 265390/265390 co-relation queries the response was YES. [2024-06-27 22:35:57,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53120 conditions, 4147 events. 2459/4147 cut-off events. For 265390/265390 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 26632 event pairs, 264 based on Foata normal form. 2/4125 useless extension candidates. Maximal degree in co-relation 52889. Up to 2276 conditions per place. [2024-06-27 22:35:57,257 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 675 selfloop transitions, 452 changer transitions 0/1142 dead transitions. [2024-06-27 22:35:57,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 1142 transitions, 37499 flow [2024-06-27 22:35:57,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:35:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:35:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-06-27 22:35:57,258 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5315315315315315 [2024-06-27 22:35:57,258 INFO L175 Difference]: Start difference. First operand has 535 places, 1104 transitions, 33866 flow. Second operand 9 states and 177 transitions. [2024-06-27 22:35:57,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 1142 transitions, 37499 flow [2024-06-27 22:35:59,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 1142 transitions, 36626 flow, removed 99 selfloop flow, removed 3 redundant places. [2024-06-27 22:35:59,408 INFO L231 Difference]: Finished difference. Result has 542 places, 1110 transitions, 34181 flow [2024-06-27 22:35:59,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=33013, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=446, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=34181, PETRI_PLACES=542, PETRI_TRANSITIONS=1110} [2024-06-27 22:35:59,409 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 501 predicate places. [2024-06-27 22:35:59,409 INFO L495 AbstractCegarLoop]: Abstraction has has 542 places, 1110 transitions, 34181 flow [2024-06-27 22:35:59,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:35:59,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:35:59,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:35:59,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-06-27 22:35:59,409 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:35:59,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:35:59,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1840144308, now seen corresponding path program 2 times [2024-06-27 22:35:59,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:35:59,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612387147] [2024-06-27 22:35:59,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:35:59,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:35:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:00,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:00,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612387147] [2024-06-27 22:36:00,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612387147] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:00,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:00,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042067527] [2024-06-27 22:36:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:00,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:00,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:00,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:00,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:36:00,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 1110 transitions, 34181 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:00,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:00,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:36:00,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:02,710 INFO L124 PetriNetUnfolderBase]: 2501/4210 cut-off events. [2024-06-27 22:36:02,711 INFO L125 PetriNetUnfolderBase]: For 284016/284016 co-relation queries the response was YES. [2024-06-27 22:36:02,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54748 conditions, 4210 events. 2501/4210 cut-off events. For 284016/284016 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 27037 event pairs, 253 based on Foata normal form. 3/4196 useless extension candidates. Maximal degree in co-relation 54514. Up to 3151 conditions per place. [2024-06-27 22:36:02,792 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 748 selfloop transitions, 406 changer transitions 0/1169 dead transitions. [2024-06-27 22:36:02,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 1169 transitions, 38416 flow [2024-06-27 22:36:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:36:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:36:02,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-27 22:36:02,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165165165165165 [2024-06-27 22:36:02,794 INFO L175 Difference]: Start difference. First operand has 542 places, 1110 transitions, 34181 flow. Second operand 9 states and 172 transitions. [2024-06-27 22:36:02,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 1169 transitions, 38416 flow [2024-06-27 22:36:05,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 1169 transitions, 37417 flow, removed 79 selfloop flow, removed 4 redundant places. [2024-06-27 22:36:05,042 INFO L231 Difference]: Finished difference. Result has 550 places, 1146 transitions, 35770 flow [2024-06-27 22:36:05,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=33242, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=372, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=35770, PETRI_PLACES=550, PETRI_TRANSITIONS=1146} [2024-06-27 22:36:05,042 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 509 predicate places. [2024-06-27 22:36:05,042 INFO L495 AbstractCegarLoop]: Abstraction has has 550 places, 1146 transitions, 35770 flow [2024-06-27 22:36:05,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:05,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:05,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:05,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-06-27 22:36:05,043 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:05,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1265180356, now seen corresponding path program 3 times [2024-06-27 22:36:05,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:05,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073755100] [2024-06-27 22:36:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:05,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:06,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:06,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073755100] [2024-06-27 22:36:06,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073755100] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:06,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:06,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:06,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522271726] [2024-06-27 22:36:06,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:06,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:06,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:06,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:06,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:06,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:36:06,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 1146 transitions, 35770 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:06,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:06,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:36:06,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:08,388 INFO L124 PetriNetUnfolderBase]: 2527/4250 cut-off events. [2024-06-27 22:36:08,388 INFO L125 PetriNetUnfolderBase]: For 282039/282039 co-relation queries the response was YES. [2024-06-27 22:36:08,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56017 conditions, 4250 events. 2527/4250 cut-off events. For 282039/282039 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 27390 event pairs, 246 based on Foata normal form. 3/4236 useless extension candidates. Maximal degree in co-relation 55779. Up to 3193 conditions per place. [2024-06-27 22:36:08,472 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 707 selfloop transitions, 452 changer transitions 0/1174 dead transitions. [2024-06-27 22:36:08,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 1174 transitions, 38820 flow [2024-06-27 22:36:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:36:08,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:36:08,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-27 22:36:08,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 22:36:08,473 INFO L175 Difference]: Start difference. First operand has 550 places, 1146 transitions, 35770 flow. Second operand 9 states and 171 transitions. [2024-06-27 22:36:08,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 558 places, 1174 transitions, 38820 flow [2024-06-27 22:36:11,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 1174 transitions, 38120 flow, removed 245 selfloop flow, removed 3 redundant places. [2024-06-27 22:36:11,239 INFO L231 Difference]: Finished difference. Result has 556 places, 1150 transitions, 36138 flow [2024-06-27 22:36:11,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=35070, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=448, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=36138, PETRI_PLACES=556, PETRI_TRANSITIONS=1150} [2024-06-27 22:36:11,240 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 515 predicate places. [2024-06-27 22:36:11,240 INFO L495 AbstractCegarLoop]: Abstraction has has 556 places, 1150 transitions, 36138 flow [2024-06-27 22:36:11,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:11,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:11,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:11,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-06-27 22:36:11,240 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:11,240 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1618498958, now seen corresponding path program 14 times [2024-06-27 22:36:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330142522] [2024-06-27 22:36:11,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330142522] [2024-06-27 22:36:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330142522] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:12,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:36:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043260712] [2024-06-27 22:36:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:12,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:36:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:12,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:36:12,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:36:12,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:36:12,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 1150 transitions, 36138 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:12,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:12,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:36:12,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:14,473 INFO L124 PetriNetUnfolderBase]: 2525/4247 cut-off events. [2024-06-27 22:36:14,473 INFO L125 PetriNetUnfolderBase]: For 283679/283679 co-relation queries the response was YES. [2024-06-27 22:36:14,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56238 conditions, 4247 events. 2525/4247 cut-off events. For 283679/283679 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 27343 event pairs, 314 based on Foata normal form. 1/4226 useless extension candidates. Maximal degree in co-relation 55998. Up to 3047 conditions per place. [2024-06-27 22:36:14,559 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 811 selfloop transitions, 372 changer transitions 0/1198 dead transitions. [2024-06-27 22:36:14,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 1198 transitions, 39812 flow [2024-06-27 22:36:14,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:36:14,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:36:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-06-27 22:36:14,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105105105105106 [2024-06-27 22:36:14,561 INFO L175 Difference]: Start difference. First operand has 556 places, 1150 transitions, 36138 flow. Second operand 9 states and 170 transitions. [2024-06-27 22:36:14,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 1198 transitions, 39812 flow [2024-06-27 22:36:16,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 1198 transitions, 38711 flow, removed 188 selfloop flow, removed 6 redundant places. [2024-06-27 22:36:16,834 INFO L231 Difference]: Finished difference. Result has 561 places, 1168 transitions, 36401 flow [2024-06-27 22:36:16,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=35051, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=354, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=36401, PETRI_PLACES=561, PETRI_TRANSITIONS=1168} [2024-06-27 22:36:16,836 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 520 predicate places. [2024-06-27 22:36:16,836 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 1168 transitions, 36401 flow [2024-06-27 22:36:16,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:16,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:16,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:16,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-06-27 22:36:16,836 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:16,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:16,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1265180046, now seen corresponding path program 15 times [2024-06-27 22:36:16,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:16,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694063029] [2024-06-27 22:36:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:16,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:18,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:18,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694063029] [2024-06-27 22:36:18,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694063029] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:18,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:18,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:36:18,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685376189] [2024-06-27 22:36:18,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:18,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:36:18,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:18,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:36:18,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:36:18,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:36:18,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 1168 transitions, 36401 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:18,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:18,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:36:18,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:20,075 INFO L124 PetriNetUnfolderBase]: 2523/4243 cut-off events. [2024-06-27 22:36:20,075 INFO L125 PetriNetUnfolderBase]: For 279095/279095 co-relation queries the response was YES. [2024-06-27 22:36:20,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55798 conditions, 4243 events. 2523/4243 cut-off events. For 279095/279095 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 27324 event pairs, 255 based on Foata normal form. 1/4227 useless extension candidates. Maximal degree in co-relation 55555. Up to 3044 conditions per place. [2024-06-27 22:36:20,153 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 734 selfloop transitions, 456 changer transitions 0/1205 dead transitions. [2024-06-27 22:36:20,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 1205 transitions, 39652 flow [2024-06-27 22:36:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:36:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:36:20,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-06-27 22:36:20,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5045045045045045 [2024-06-27 22:36:20,154 INFO L175 Difference]: Start difference. First operand has 561 places, 1168 transitions, 36401 flow. Second operand 9 states and 168 transitions. [2024-06-27 22:36:20,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 1205 transitions, 39652 flow [2024-06-27 22:36:22,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 1205 transitions, 38411 flow, removed 293 selfloop flow, removed 3 redundant places. [2024-06-27 22:36:22,574 INFO L231 Difference]: Finished difference. Result has 569 places, 1181 transitions, 36736 flow [2024-06-27 22:36:22,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=35242, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=443, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=36736, PETRI_PLACES=569, PETRI_TRANSITIONS=1181} [2024-06-27 22:36:22,575 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 528 predicate places. [2024-06-27 22:36:22,575 INFO L495 AbstractCegarLoop]: Abstraction has has 569 places, 1181 transitions, 36736 flow [2024-06-27 22:36:22,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:22,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:22,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:22,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-06-27 22:36:22,576 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:22,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:22,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1275299686, now seen corresponding path program 4 times [2024-06-27 22:36:22,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:22,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514206234] [2024-06-27 22:36:22,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:22,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:23,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:23,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514206234] [2024-06-27 22:36:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514206234] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:23,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:23,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:23,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038019736] [2024-06-27 22:36:23,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:23,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:23,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:23,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:36:23,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 1181 transitions, 36736 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:23,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:23,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:36:23,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:26,156 INFO L124 PetriNetUnfolderBase]: 2854/4744 cut-off events. [2024-06-27 22:36:26,157 INFO L125 PetriNetUnfolderBase]: For 299036/299036 co-relation queries the response was YES. [2024-06-27 22:36:26,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61753 conditions, 4744 events. 2854/4744 cut-off events. For 299036/299036 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 30148 event pairs, 636 based on Foata normal form. 3/4744 useless extension candidates. Maximal degree in co-relation 61507. Up to 4494 conditions per place. [2024-06-27 22:36:26,249 INFO L140 encePairwiseOnDemand]: 21/37 looper letters, 1160 selfloop transitions, 43 changer transitions 0/1210 dead transitions. [2024-06-27 22:36:26,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 1210 transitions, 39498 flow [2024-06-27 22:36:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 162 transitions. [2024-06-27 22:36:26,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43783783783783786 [2024-06-27 22:36:26,250 INFO L175 Difference]: Start difference. First operand has 569 places, 1181 transitions, 36736 flow. Second operand 10 states and 162 transitions. [2024-06-27 22:36:26,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 1210 transitions, 39498 flow [2024-06-27 22:36:28,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 1210 transitions, 38098 flow, removed 239 selfloop flow, removed 6 redundant places. [2024-06-27 22:36:28,968 INFO L231 Difference]: Finished difference. Result has 573 places, 1185 transitions, 35593 flow [2024-06-27 22:36:28,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=35336, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=35593, PETRI_PLACES=573, PETRI_TRANSITIONS=1185} [2024-06-27 22:36:28,969 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 532 predicate places. [2024-06-27 22:36:28,969 INFO L495 AbstractCegarLoop]: Abstraction has has 573 places, 1185 transitions, 35593 flow [2024-06-27 22:36:28,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:28,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:28,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:28,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-06-27 22:36:28,969 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:28,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:28,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1275655876, now seen corresponding path program 5 times [2024-06-27 22:36:28,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:28,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669392232] [2024-06-27 22:36:28,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:28,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:28,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:30,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:30,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:30,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669392232] [2024-06-27 22:36:30,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669392232] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:30,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:30,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:36:30,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256797102] [2024-06-27 22:36:30,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:30,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:36:30,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:30,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:36:30,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:36:30,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:36:30,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 1185 transitions, 35593 flow. Second operand has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:30,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:30,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:36:30,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:32,652 INFO L124 PetriNetUnfolderBase]: 2864/4759 cut-off events. [2024-06-27 22:36:32,652 INFO L125 PetriNetUnfolderBase]: For 285342/285342 co-relation queries the response was YES. [2024-06-27 22:36:32,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60846 conditions, 4759 events. 2864/4759 cut-off events. For 285342/285342 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 30248 event pairs, 634 based on Foata normal form. 1/4757 useless extension candidates. Maximal degree in co-relation 60599. Up to 4490 conditions per place. [2024-06-27 22:36:32,753 INFO L140 encePairwiseOnDemand]: 21/37 looper letters, 1156 selfloop transitions, 54 changer transitions 0/1217 dead transitions. [2024-06-27 22:36:32,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 1217 transitions, 38433 flow [2024-06-27 22:36:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:36:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:36:32,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 186 transitions. [2024-06-27 22:36:32,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4189189189189189 [2024-06-27 22:36:32,755 INFO L175 Difference]: Start difference. First operand has 573 places, 1185 transitions, 35593 flow. Second operand 12 states and 186 transitions. [2024-06-27 22:36:32,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 1217 transitions, 38433 flow [2024-06-27 22:36:35,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 1217 transitions, 38238 flow, removed 62 selfloop flow, removed 7 redundant places. [2024-06-27 22:36:35,810 INFO L231 Difference]: Finished difference. Result has 578 places, 1188 transitions, 35642 flow [2024-06-27 22:36:35,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=35398, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=35642, PETRI_PLACES=578, PETRI_TRANSITIONS=1188} [2024-06-27 22:36:35,811 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 537 predicate places. [2024-06-27 22:36:35,811 INFO L495 AbstractCegarLoop]: Abstraction has has 578 places, 1188 transitions, 35642 flow [2024-06-27 22:36:35,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.272727272727273) internal successors, (102), 11 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:35,812 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:35,812 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:35,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-06-27 22:36:35,812 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:35,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1618499268, now seen corresponding path program 6 times [2024-06-27 22:36:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:35,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385361161] [2024-06-27 22:36:35,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:37,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:37,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385361161] [2024-06-27 22:36:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385361161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:37,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:37,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786173262] [2024-06-27 22:36:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:37,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:37,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:37,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:37,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:37,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:36:37,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 1188 transitions, 35642 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:37,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:37,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:36:37,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:39,297 INFO L124 PetriNetUnfolderBase]: 2571/4315 cut-off events. [2024-06-27 22:36:39,298 INFO L125 PetriNetUnfolderBase]: For 273827/273827 co-relation queries the response was YES. [2024-06-27 22:36:39,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55858 conditions, 4315 events. 2571/4315 cut-off events. For 273827/273827 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 27731 event pairs, 249 based on Foata normal form. 3/4296 useless extension candidates. Maximal degree in co-relation 55610. Up to 3254 conditions per place. [2024-06-27 22:36:39,383 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 813 selfloop transitions, 387 changer transitions 0/1215 dead transitions. [2024-06-27 22:36:39,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 1215 transitions, 38654 flow [2024-06-27 22:36:39,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:36:39,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:36:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 171 transitions. [2024-06-27 22:36:39,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135135135135135 [2024-06-27 22:36:39,385 INFO L175 Difference]: Start difference. First operand has 578 places, 1188 transitions, 35642 flow. Second operand 9 states and 171 transitions. [2024-06-27 22:36:39,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 1215 transitions, 38654 flow [2024-06-27 22:36:41,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 1215 transitions, 38414 flow, removed 38 selfloop flow, removed 13 redundant places. [2024-06-27 22:36:41,749 INFO L231 Difference]: Finished difference. Result has 574 places, 1192 transitions, 36364 flow [2024-06-27 22:36:41,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=35402, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=383, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=801, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=36364, PETRI_PLACES=574, PETRI_TRANSITIONS=1192} [2024-06-27 22:36:41,750 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 533 predicate places. [2024-06-27 22:36:41,750 INFO L495 AbstractCegarLoop]: Abstraction has has 574 places, 1192 transitions, 36364 flow [2024-06-27 22:36:41,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:41,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:41,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:41,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-06-27 22:36:41,751 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:41,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:41,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1618490340, now seen corresponding path program 16 times [2024-06-27 22:36:41,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:41,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707046831] [2024-06-27 22:36:41,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:41,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:42,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:42,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707046831] [2024-06-27 22:36:42,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707046831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:42,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:42,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:42,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580253767] [2024-06-27 22:36:42,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:42,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:42,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:42,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:42,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:42,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:36:42,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 1192 transitions, 36364 flow. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:42,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:42,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:36:42,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:45,138 INFO L124 PetriNetUnfolderBase]: 2881/4768 cut-off events. [2024-06-27 22:36:45,139 INFO L125 PetriNetUnfolderBase]: For 286521/286521 co-relation queries the response was YES. [2024-06-27 22:36:45,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61830 conditions, 4768 events. 2881/4768 cut-off events. For 286521/286521 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 30077 event pairs, 255 based on Foata normal form. 1/4763 useless extension candidates. Maximal degree in co-relation 61584. Up to 3423 conditions per place. [2024-06-27 22:36:45,234 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 719 selfloop transitions, 486 changer transitions 0/1212 dead transitions. [2024-06-27 22:36:45,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 1212 transitions, 38852 flow [2024-06-27 22:36:45,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-27 22:36:45,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46756756756756757 [2024-06-27 22:36:45,236 INFO L175 Difference]: Start difference. First operand has 574 places, 1192 transitions, 36364 flow. Second operand 10 states and 173 transitions. [2024-06-27 22:36:45,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 1212 transitions, 38852 flow [2024-06-27 22:36:48,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 1212 transitions, 37210 flow, removed 241 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:48,088 INFO L231 Difference]: Finished difference. Result has 576 places, 1192 transitions, 35705 flow [2024-06-27 22:36:48,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=34722, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=486, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=35705, PETRI_PLACES=576, PETRI_TRANSITIONS=1192} [2024-06-27 22:36:48,089 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 535 predicate places. [2024-06-27 22:36:48,089 INFO L495 AbstractCegarLoop]: Abstraction has has 576 places, 1192 transitions, 35705 flow [2024-06-27 22:36:48,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:48,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:48,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:48,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-06-27 22:36:48,090 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:48,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1169338712, now seen corresponding path program 1 times [2024-06-27 22:36:48,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:48,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845688951] [2024-06-27 22:36:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:49,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:49,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:49,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845688951] [2024-06-27 22:36:49,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845688951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:49,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:49,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:49,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692691887] [2024-06-27 22:36:49,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:49,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:49,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:49,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:49,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:49,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:36:49,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 1192 transitions, 35705 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:49,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:49,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:36:49,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:51,327 INFO L124 PetriNetUnfolderBase]: 2899/4853 cut-off events. [2024-06-27 22:36:51,327 INFO L125 PetriNetUnfolderBase]: For 297797/297828 co-relation queries the response was YES. [2024-06-27 22:36:51,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61451 conditions, 4853 events. 2899/4853 cut-off events. For 297797/297828 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 31243 event pairs, 328 based on Foata normal form. 30/4881 useless extension candidates. Maximal degree in co-relation 61203. Up to 4265 conditions per place. [2024-06-27 22:36:51,426 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 1041 selfloop transitions, 125 changer transitions 0/1245 dead transitions. [2024-06-27 22:36:51,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 1245 transitions, 38619 flow [2024-06-27 22:36:51,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:51,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-06-27 22:36:51,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46216216216216216 [2024-06-27 22:36:51,427 INFO L175 Difference]: Start difference. First operand has 576 places, 1192 transitions, 35705 flow. Second operand 10 states and 171 transitions. [2024-06-27 22:36:51,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 1245 transitions, 38619 flow [2024-06-27 22:36:54,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 1245 transitions, 37463 flow, removed 103 selfloop flow, removed 8 redundant places. [2024-06-27 22:36:54,187 INFO L231 Difference]: Finished difference. Result has 581 places, 1215 transitions, 35353 flow [2024-06-27 22:36:54,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=34549, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1071, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=35353, PETRI_PLACES=581, PETRI_TRANSITIONS=1215} [2024-06-27 22:36:54,188 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 540 predicate places. [2024-06-27 22:36:54,188 INFO L495 AbstractCegarLoop]: Abstraction has has 581 places, 1215 transitions, 35353 flow [2024-06-27 22:36:54,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:54,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:36:54,189 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:36:54,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-06-27 22:36:54,189 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:36:54,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:36:54,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1446665386, now seen corresponding path program 2 times [2024-06-27 22:36:54,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:36:54,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268116739] [2024-06-27 22:36:54,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:36:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:36:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:36:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:36:55,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:36:55,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268116739] [2024-06-27 22:36:55,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268116739] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:36:55,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:36:55,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:36:55,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083165123] [2024-06-27 22:36:55,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:36:55,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:36:55,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:36:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:36:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:36:55,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:36:55,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 1215 transitions, 35353 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:36:55,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:36:55,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:36:55,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:36:57,749 INFO L124 PetriNetUnfolderBase]: 3008/5034 cut-off events. [2024-06-27 22:36:57,749 INFO L125 PetriNetUnfolderBase]: For 305194/305220 co-relation queries the response was YES. [2024-06-27 22:36:57,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63100 conditions, 5034 events. 3008/5034 cut-off events. For 305194/305220 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 32686 event pairs, 318 based on Foata normal form. 20/5051 useless extension candidates. Maximal degree in co-relation 62849. Up to 4050 conditions per place. [2024-06-27 22:36:57,855 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 969 selfloop transitions, 277 changer transitions 0/1325 dead transitions. [2024-06-27 22:36:57,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 1325 transitions, 40480 flow [2024-06-27 22:36:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:36:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:36:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-06-27 22:36:57,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47297297297297297 [2024-06-27 22:36:57,856 INFO L175 Difference]: Start difference. First operand has 581 places, 1215 transitions, 35353 flow. Second operand 10 states and 175 transitions. [2024-06-27 22:36:57,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 1325 transitions, 40480 flow [2024-06-27 22:37:00,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 1325 transitions, 40223 flow, removed 124 selfloop flow, removed 2 redundant places. [2024-06-27 22:37:00,807 INFO L231 Difference]: Finished difference. Result has 592 places, 1279 transitions, 37907 flow [2024-06-27 22:37:00,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=35096, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=215, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=37907, PETRI_PLACES=592, PETRI_TRANSITIONS=1279} [2024-06-27 22:37:00,808 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 551 predicate places. [2024-06-27 22:37:00,808 INFO L495 AbstractCegarLoop]: Abstraction has has 592 places, 1279 transitions, 37907 flow [2024-06-27 22:37:00,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:00,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:00,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:00,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-06-27 22:37:00,809 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:00,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1446659806, now seen corresponding path program 3 times [2024-06-27 22:37:00,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221693543] [2024-06-27 22:37:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:01,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:01,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:01,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221693543] [2024-06-27 22:37:01,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221693543] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:01,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:01,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:37:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902007039] [2024-06-27 22:37:01,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:01,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:37:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:37:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:37:02,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:37:02,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 1279 transitions, 37907 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:02,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:02,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:37:02,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:04,330 INFO L124 PetriNetUnfolderBase]: 3005/5029 cut-off events. [2024-06-27 22:37:04,330 INFO L125 PetriNetUnfolderBase]: For 309619/309645 co-relation queries the response was YES. [2024-06-27 22:37:04,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63423 conditions, 5029 events. 3005/5029 cut-off events. For 309619/309645 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 32628 event pairs, 331 based on Foata normal form. 20/5046 useless extension candidates. Maximal degree in co-relation 63167. Up to 4188 conditions per place. [2024-06-27 22:37:04,431 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 961 selfloop transitions, 283 changer transitions 0/1323 dead transitions. [2024-06-27 22:37:04,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 1323 transitions, 40965 flow [2024-06-27 22:37:04,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:37:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:37:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-06-27 22:37:04,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46756756756756757 [2024-06-27 22:37:04,433 INFO L175 Difference]: Start difference. First operand has 592 places, 1279 transitions, 37907 flow. Second operand 10 states and 173 transitions. [2024-06-27 22:37:04,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 1323 transitions, 40965 flow [2024-06-27 22:37:07,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 1323 transitions, 40531 flow, removed 161 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:07,346 INFO L231 Difference]: Finished difference. Result has 598 places, 1279 transitions, 38057 flow [2024-06-27 22:37:07,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=37473, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=283, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=38057, PETRI_PLACES=598, PETRI_TRANSITIONS=1279} [2024-06-27 22:37:07,347 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 557 predicate places. [2024-06-27 22:37:07,348 INFO L495 AbstractCegarLoop]: Abstraction has has 598 places, 1279 transitions, 38057 flow [2024-06-27 22:37:07,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:07,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:07,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:07,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-06-27 22:37:07,348 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:07,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:07,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1446809536, now seen corresponding path program 4 times [2024-06-27 22:37:07,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:07,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101457059] [2024-06-27 22:37:07,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:07,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:08,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:08,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101457059] [2024-06-27 22:37:08,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101457059] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:08,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:08,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:08,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789437802] [2024-06-27 22:37:08,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:08,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:08,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:08,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:37:08,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 1279 transitions, 38057 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:08,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:08,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:37:08,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:11,122 INFO L124 PetriNetUnfolderBase]: 3219/5344 cut-off events. [2024-06-27 22:37:11,122 INFO L125 PetriNetUnfolderBase]: For 315637/315637 co-relation queries the response was YES. [2024-06-27 22:37:11,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66183 conditions, 5344 events. 3219/5344 cut-off events. For 315637/315637 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 34925 event pairs, 384 based on Foata normal form. 2/5344 useless extension candidates. Maximal degree in co-relation 65925. Up to 4438 conditions per place. [2024-06-27 22:37:11,228 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 1116 selfloop transitions, 228 changer transitions 0/1351 dead transitions. [2024-06-27 22:37:11,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 1351 transitions, 42011 flow [2024-06-27 22:37:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 187 transitions. [2024-06-27 22:37:11,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-27 22:37:11,229 INFO L175 Difference]: Start difference. First operand has 598 places, 1279 transitions, 38057 flow. Second operand 11 states and 187 transitions. [2024-06-27 22:37:11,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 1351 transitions, 42011 flow [2024-06-27 22:37:14,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 1351 transitions, 41384 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-06-27 22:37:14,305 INFO L231 Difference]: Finished difference. Result has 604 places, 1310 transitions, 38903 flow [2024-06-27 22:37:14,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=37442, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=38903, PETRI_PLACES=604, PETRI_TRANSITIONS=1310} [2024-06-27 22:37:14,306 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 563 predicate places. [2024-06-27 22:37:14,306 INFO L495 AbstractCegarLoop]: Abstraction has has 604 places, 1310 transitions, 38903 flow [2024-06-27 22:37:14,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:14,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:14,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:14,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-06-27 22:37:14,306 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:14,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:14,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1792143984, now seen corresponding path program 5 times [2024-06-27 22:37:14,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:14,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749986899] [2024-06-27 22:37:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:14,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:15,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:15,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749986899] [2024-06-27 22:37:15,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749986899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:15,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:15,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:37:15,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991384905] [2024-06-27 22:37:15,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:15,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:37:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:37:15,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:37:15,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 22:37:15,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 1310 transitions, 38903 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:15,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:15,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 22:37:15,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:17,759 INFO L124 PetriNetUnfolderBase]: 3101/5253 cut-off events. [2024-06-27 22:37:17,759 INFO L125 PetriNetUnfolderBase]: For 336006/336046 co-relation queries the response was YES. [2024-06-27 22:37:17,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66060 conditions, 5253 events. 3101/5253 cut-off events. For 336006/336046 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 35008 event pairs, 131 based on Foata normal form. 43/5291 useless extension candidates. Maximal degree in co-relation 65798. Up to 3316 conditions per place. [2024-06-27 22:37:17,873 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 856 selfloop transitions, 293 changer transitions 0/1371 dead transitions. [2024-06-27 22:37:17,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 1371 transitions, 42138 flow [2024-06-27 22:37:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:37:17,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:37:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 184 transitions. [2024-06-27 22:37:17,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972972972972973 [2024-06-27 22:37:17,874 INFO L175 Difference]: Start difference. First operand has 604 places, 1310 transitions, 38903 flow. Second operand 10 states and 184 transitions. [2024-06-27 22:37:17,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 1371 transitions, 42138 flow [2024-06-27 22:37:21,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 1371 transitions, 41632 flow, removed 202 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:21,428 INFO L231 Difference]: Finished difference. Result has 613 places, 1334 transitions, 40006 flow [2024-06-27 22:37:21,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=38397, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=40006, PETRI_PLACES=613, PETRI_TRANSITIONS=1334} [2024-06-27 22:37:21,429 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 572 predicate places. [2024-06-27 22:37:21,429 INFO L495 AbstractCegarLoop]: Abstraction has has 613 places, 1334 transitions, 40006 flow [2024-06-27 22:37:21,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:21,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:21,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:21,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99 [2024-06-27 22:37:21,429 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:21,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:21,430 INFO L85 PathProgramCache]: Analyzing trace with hash -120329527, now seen corresponding path program 1 times [2024-06-27 22:37:21,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:21,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318783576] [2024-06-27 22:37:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:21,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:22,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:22,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318783576] [2024-06-27 22:37:22,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318783576] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:22,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:22,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:37:22,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202021524] [2024-06-27 22:37:22,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:22,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:37:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:22,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:37:22,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:37:22,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 37 [2024-06-27 22:37:22,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 1334 transitions, 40006 flow. Second operand has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:22,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:22,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 37 [2024-06-27 22:37:22,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:25,056 INFO L124 PetriNetUnfolderBase]: 2881/4895 cut-off events. [2024-06-27 22:37:25,056 INFO L125 PetriNetUnfolderBase]: For 305874/305874 co-relation queries the response was YES. [2024-06-27 22:37:25,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62080 conditions, 4895 events. 2881/4895 cut-off events. For 305874/305874 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 32797 event pairs, 511 based on Foata normal form. 1/4866 useless extension candidates. Maximal degree in co-relation 61814. Up to 4047 conditions per place. [2024-06-27 22:37:25,147 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 1087 selfloop transitions, 268 changer transitions 0/1372 dead transitions. [2024-06-27 22:37:25,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 1372 transitions, 43487 flow [2024-06-27 22:37:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:37:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:37:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-06-27 22:37:25,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5165165165165165 [2024-06-27 22:37:25,148 INFO L175 Difference]: Start difference. First operand has 613 places, 1334 transitions, 40006 flow. Second operand 9 states and 172 transitions. [2024-06-27 22:37:25,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 1372 transitions, 43487 flow [2024-06-27 22:37:28,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 1372 transitions, 42792 flow, removed 328 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:28,317 INFO L231 Difference]: Finished difference. Result has 620 places, 1345 transitions, 40574 flow [2024-06-27 22:37:28,317 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=39429, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=257, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1066, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=40574, PETRI_PLACES=620, PETRI_TRANSITIONS=1345} [2024-06-27 22:37:28,318 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 579 predicate places. [2024-06-27 22:37:28,318 INFO L495 AbstractCegarLoop]: Abstraction has has 620 places, 1345 transitions, 40574 flow [2024-06-27 22:37:28,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.4) internal successors, (114), 10 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:28,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:28,318 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:28,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100 [2024-06-27 22:37:28,318 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:28,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1234297002, now seen corresponding path program 1 times [2024-06-27 22:37:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:28,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923666815] [2024-06-27 22:37:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:28,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923666815] [2024-06-27 22:37:28,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923666815] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:28,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:28,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:37:28,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545671554] [2024-06-27 22:37:28,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:28,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:37:28,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:28,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:37:28,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:37:28,385 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 37 [2024-06-27 22:37:28,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 1345 transitions, 40574 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:28,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:28,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 37 [2024-06-27 22:37:28,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:29,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([306] L751-->L754: Formula: (= v_~__unbuffered_cnt~0_1 (+ v_~__unbuffered_cnt~0_2 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_2} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_1} AuxVars[] AssignedVars[~__unbuffered_cnt~0][443], [Black: 1539#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$flush_delayed~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)), Black: 1536#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$flush_delayed~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)), Black: 1538#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$flush_delayed~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)), Black: 1030#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1029#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1031#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 516#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 530#(and (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 1044#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1042#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))), Black: 1043#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))), 1299#true, Black: 543#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 544#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 541#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 542#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 938#true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 48#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$r_buff1_thd2~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (<= ~y$r_buff1_thd2~0 ~y$w_buff1~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)), 400#true, 1328#true, Black: 1063#(and (<= 0 (div ~y$w_buff1_used~0 256)) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1065#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~__unbuffered_p1_EBX~0 0)), Black: 556#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0))), Black: 53#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$r_buff1_thd2~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (<= ~y$r_buff1_thd2~0 ~y$w_buff1~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)), Black: 565#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y~0 1))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 557#(and (= ~y$r_buff1_thd2~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$w_buff1~0) (= ~y$read_delayed~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$w_buff1~0) (= ~y$read_delayed~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 58#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$w_buff1~0) (= ~y$read_delayed~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)), Black: 69#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff1_thd2~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (<= ~y$r_buff1_thd2~0 ~y$w_buff1~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1083#(and (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 1084#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd2~0 1)), Black: 577#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 1056#true, Black: 75#(and (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 1106#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (and (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (and (= ~y$r_buff0_thd1~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 593#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 595#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 88#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), 692#true, Black: 1120#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (and (= ~y$w_buff0_used~0 0) (= 2 ~y~0)) (and (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1121#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (and (= ~y$w_buff0_used~0 0) (= 2 ~y~0)) (and (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 100#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 614#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 496#true, 537#true, 417#true, Black: 111#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0))), Black: 1134#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1138#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1137#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1135#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1136#(and (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), 464#true, 13#L754true, Black: 1141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 627#(and (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 123#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 630#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 628#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1154#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), 675#true, Black: 1156#(and (or (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)), Black: 134#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 649#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 647#(and (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 646#(and (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), 837#true, Black: 1171#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1174#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1170#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 147#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 667#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), 1442#true, Black: 1190#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1185#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 164#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 1187#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 163#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 679#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 682#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1204#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (div ~y$w_buff0_used~0 256) 0)), Black: 177#(and (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 185#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (or (and (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= 0 ~z~0)), Black: 699#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 696#(and (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 698#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 700#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 697#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 1222#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 194#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 1219#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 195#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 712#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 208#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 207#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 1233#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 206#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), 128#true, 1460#true, 202#true, Black: 727#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 226#(and (= ~__unbuffered_cnt~0 0) (or (and (<= 0 (+ ~y~0 1)) (<= ~y~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 1248#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 219#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 1251#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 222#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 741#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 743#(and (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 745#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)), Black: 237#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1262#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 759#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 251#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 255#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), 189#true, Black: 1277#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1130#true, Black: 775#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 773#(and (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 776#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 772#(and (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 265#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 263#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 774#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), 921#true, Black: 1292#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1546#(< ~main$tmp_guard0~0 (+ 1 (* (div ~main$tmp_guard0~0 256) 256))), Black: 1302#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1305#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1307#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 277#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1304#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1303#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 369#true, Black: 1306#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 83#true, Black: 294#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 1322#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1325#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), 40#L808true, Black: 817#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 818#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 815#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 816#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 309#(and (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 307#(and (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 1339#(and (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1334#(and (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1333#(and (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1337#(and (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1)), Black: 831#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (div ~y$w_buff0_used~0 256) 0)), Black: 323#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 320#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 1353#(and (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1)), Black: 847#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 846#(and (= ~x~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 337#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1362#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1365#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1363#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1375#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 863#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 350#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (and (= ~y$w_buff0_used~0 0) (= 2 ~y~0)) (and (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1373#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1377#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 856#(= ~__unbuffered_p1_EAX~0 0), 316#true, Black: 861#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 363#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1390#(and (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff0_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (= ~__unbuffered_p1_EBX~0 0)), 449#true, Black: 879#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 881#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 880#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 381#(and (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 377#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff0_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0)), Black: 895#(and (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 898#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 1406#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff0_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 896#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 897#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 396#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (or (and (<= 0 (+ ~y~0 1)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 389#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 392#(and (= ~y$r_buff0_thd2~0 1) (<= 0 (div ~y$w_buff0_used~0 256)) (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)))), Black: 1423#(and (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1)), 15#L778true, Black: 910#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 1530#true, Black: 912#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 408#(and (or (and (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 407#(and (or (and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1435#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 928#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 929#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)), Black: 927#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), 1493#true, 1148#true, Black: 424#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1448#(and (or (and (<= 0 (+ ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= ~y~0 1) (= ~y$w_buff0~0 0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 425#(and (or (and (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1451#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1449#(and (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0))), Black: 945#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1450#(and (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0))) (= ~__unbuffered_p1_EBX~0 0)), 889#true, Black: 944#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 942#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 946#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 943#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), 549#true, Black: 440#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 442#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1468#(or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1467#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1469#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1466#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 964#(and (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (= |#ghost~multithreaded| 1) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 962#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff0_used~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0)), 1512#true, Black: 456#(and (or (and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), 158#true, Black: 457#(and (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 974#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 971#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 975#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 972#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1487#(and (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 471#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 472#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 986#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)), Black: 988#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)), Black: 1502#(and (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 1501#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1500#(and (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0))), 737#true, 71#true, Black: 487#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 489#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 1004#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)), Black: 1516#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1)), Black: 1521#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= 0 (+ ~__unbuffered_cnt~0 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1))) (= ~__unbuffered_p1_EBX~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)), Black: 1519#(and (or (and (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= 0 (+ ~__unbuffered_cnt~0 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)), Black: 1520#(and (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= 0 (+ ~__unbuffered_cnt~0 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1))) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)), Black: 501#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), 854#true, Black: 1018#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 502#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 1020#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0))]) [2024-06-27 22:37:29,479 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 22:37:29,479 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:37:29,479 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:37:29,479 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:37:29,480 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([314] L778-->L785: Formula: (let ((.cse4 (not (= (mod v_~y$w_buff0_used~0_73 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (.cse3 (not (= (mod v_~y$r_buff1_thd2~0_26 256) 0)))) (let ((.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_65 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse0 (and (not (= (mod v_~y$w_buff0_used~0_74 256) 0)) .cse5))) (and (= v_~y~0_27 (ite .cse0 v_~y$w_buff0~0_30 (ite .cse1 v_~y$w_buff1~0_21 v_~y~0_28))) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_65) v_~y$w_buff1_used~0_64) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_64 256) 0))) (and (not (= (mod v_~y$r_buff0_thd2~0_36 256) 0)) .cse4)) 0 v_~y$r_buff1_thd2~0_26) v_~y$r_buff1_thd2~0_25) (= (ite .cse2 0 v_~y$r_buff0_thd2~0_37) v_~y$r_buff0_thd2~0_36) (= v_~y$w_buff0_used~0_73 (ite .cse0 0 v_~y$w_buff0_used~0_74))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_74, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_28, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_73, ~y$w_buff1~0=v_~y$w_buff1~0_21, ~y$w_buff0~0=v_~y$w_buff0~0_30, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_36, ~y~0=v_~y~0_27, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][444], [1548#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), Black: 1539#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$flush_delayed~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)), Black: 1536#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$flush_delayed~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)), Black: 1538#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$flush_delayed~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0) (= ~y$w_buff0_used~0 1)), Black: 1030#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1029#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1031#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 516#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 530#(and (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 1044#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1042#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))), Black: 1043#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))), 1299#true, Black: 543#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 544#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 541#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 542#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 938#true, P1Thread1of1ForFork1InUse, P0Thread1of1ForFork0InUse, Black: 48#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$r_buff1_thd2~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (<= ~y$r_buff1_thd2~0 ~y$w_buff1~0) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)), 400#true, 1328#true, Black: 1063#(and (<= 0 (div ~y$w_buff1_used~0 256)) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), Black: 1065#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~__unbuffered_p1_EBX~0 0)), Black: 556#(and (= ~y$r_buff0_thd2~0 0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0))), Black: 53#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$r_buff1_thd2~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (= ~y~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (<= ~y$r_buff1_thd2~0 ~y$w_buff1~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)), Black: 565#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y~0 1))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 557#(and (= ~y$r_buff1_thd2~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 57#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$w_buff1~0) (= ~y$read_delayed~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)), Black: 59#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$w_buff1~0) (= ~y$read_delayed~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 58#(and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$w_buff1~0) (= ~y$read_delayed~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)), Black: 69#(and (= ~y$r_buff0_thd0~0 0) (<= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= 0 (div ~y$r_buff1_thd2~0 256)) (= ~__unbuffered_p1_EAX~0 0) (= ~y$read_delayed~0 0) (<= ~y$w_buff1~0 ~y$w_buff0~0) (<= 0 (div ~y$flush_delayed~0 256)) (<= ~y$r_buff1_thd2~0 ~y$w_buff1~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1083#(and (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 1084#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd2~0 1)), Black: 577#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 1056#true, Black: 75#(and (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 79#(and (= ~__unbuffered_cnt~0 0) (= ~x~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 1106#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (and (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (and (= ~y$r_buff0_thd1~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (<= ~y$w_buff1_used~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 593#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 595#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 88#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), 692#true, Black: 1120#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (and (= ~y$w_buff0_used~0 0) (= 2 ~y~0)) (and (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1121#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (or (and (= ~y$w_buff0_used~0 0) (= 2 ~y~0)) (and (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 100#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 614#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 496#true, 537#true, 417#true, Black: 111#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0))), Black: 1134#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1138#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1137#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1135#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1136#(and (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), 464#true, Black: 1141#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 627#(and (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 630#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 123#(and (= ~x~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 628#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1154#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), 675#true, Black: 1156#(and (or (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$r_buff0_thd1~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 132#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)), Black: 134#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 649#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 647#(and (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 646#(and (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), 837#true, Black: 1171#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1174#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1170#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 147#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 151#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)))) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 153#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 144#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 667#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), 1442#true, Black: 1190#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1185#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 164#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 1187#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 163#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 679#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 682#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1204#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (div ~y$w_buff0_used~0 256) 0)), 31#L751true, Black: 177#(and (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 183#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 185#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (or (and (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (<= 0 ~z~0)), Black: 699#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 696#(and (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 698#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 700#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 697#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 1222#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 194#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 1219#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 195#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 712#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 208#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 207#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 1233#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 206#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), 128#true, 1460#true, 202#true, Black: 727#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 226#(and (= ~__unbuffered_cnt~0 0) (or (and (<= 0 (+ ~y~0 1)) (<= ~y~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 1248#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 219#(and (= ~__unbuffered_cnt~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 1251#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 222#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 741#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 743#(and (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 745#(and (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 234#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)), Black: 237#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1262#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 759#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 251#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 255#(and (= ~__unbuffered_cnt~0 0) (<= ~y$r_buff1_thd1~0 (* 256 (div ~y$r_buff1_thd1~0 256))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (or (and (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 ~y$r_buff1_thd1~0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), 189#true, Black: 1277#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), 1130#true, Black: 775#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 773#(and (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 776#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 772#(and (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 265#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 263#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff0_used~0 256)) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 774#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), 921#true, Black: 1292#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 1302#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1305#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 277#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1307#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1304#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 369#true, Black: 1303#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1306#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), 83#true, Black: 294#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1))), Black: 1322#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1325#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), 40#L808true, Black: 817#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 818#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 815#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 816#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= 2 ~y$w_buff0~0) (= (div ~y$w_buff0_used~0 256) 0) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~y~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)))), Black: 309#(and (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 307#(and (= ~y$r_buff1_thd2~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 1339#(and (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 1) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1334#(and (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~x~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1333#(and (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (= ~y$w_buff1_used~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 1337#(and (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1)), Black: 831#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= (div ~y$w_buff0_used~0 256) 0)), Black: 323#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 320#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 1353#(and (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1)), Black: 847#(and (= ~x~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0)), Black: 846#(and (= ~x~0 0) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (= ~y$w_buff0_used~0 0) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0))), Black: 337#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1362#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1365#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1363#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1375#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 863#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0))), Black: 350#(or (and (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (or (and (= ~y$w_buff0_used~0 0) (= 2 ~y~0)) (and (= ~y~0 1) (= ~y$w_buff0_used~0 1))) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1373#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1377#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (or (< 0 (+ (div ~y$r_buff0_thd1~0 256) 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 856#(= ~__unbuffered_p1_EAX~0 0), 316#true, Black: 861#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (= ~__unbuffered_p1_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 363#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1390#(and (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff0_used~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0))) (= ~__unbuffered_p1_EBX~0 0)), 449#true, Black: 879#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 881#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 880#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 381#(and (= ~x~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff1_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~__unbuffered_p1_EBX~0 0) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))))), Black: 377#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff0_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~x~0 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= 2 ~y~0)), Black: 895#(and (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 898#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 1406#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff0_used~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0)), Black: 896#(and (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 897#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 396#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (or (and (<= 0 (+ ~y~0 1)) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1))) (= |#ghost~multithreaded| 0))), Black: 389#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (<= 0 ~z~0)), Black: 392#(and (= ~y$r_buff0_thd2~0 1) (<= 0 (div ~y$w_buff0_used~0 256)) (or (= |#ghost~multithreaded| 0) (and (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (+ ~__unbuffered_cnt~0 1)) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y$r_buff1_thd1~0 0)))), Black: 1423#(and (= ~y$r_buff0_thd2~0 1) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y$r_buff1_thd2~0 0) (<= ~y$flush_delayed~0 0) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff1_used~0 256)) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= (+ (* 256 (div ~y$w_buff0_used~0 256)) ~y$w_buff1_used~0) ~y$w_buff0_used~0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1)), Black: 910#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), 1530#true, Black: 912#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 408#(and (or (and (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 407#(and (or (and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1435#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)), Black: 928#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)))), Black: 929#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)), Black: 927#(and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0))), 1493#true, 1148#true, Black: 424#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1448#(and (or (and (<= 0 (+ ~y~0 1)) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= ~y~0 1) (= ~y$w_buff0~0 0) (= ~x~0 1) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 425#(and (or (and (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1451#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1449#(and (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0))), Black: 945#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 1450#(and (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0))) (= ~__unbuffered_p1_EBX~0 0)), 889#true, Black: 944#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 942#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 946#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 943#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), 549#true, Black: 440#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 442#(or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1468#(or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1467#(or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 1469#(or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))), Black: 1466#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 964#(and (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (= |#ghost~multithreaded| 1) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff1_used~0 0) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 962#(and (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (= ~y$w_buff0_used~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~x~0 1) (<= ~y$w_buff1_used~0 0) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= 2 ~y~0)) (= |#ghost~multithreaded| 0)) (<= 0 (div ~y$w_buff1_used~0 256)) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0)), 1512#true, Black: 456#(and (or (and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$r_buff0_thd1~0 0) (= ~__unbuffered_p1_EAX~0 0) (= ~y$w_buff0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), 158#true, Black: 457#(and (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0))), Black: 974#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 971#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 975#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (= ~__unbuffered_p1_EBX~0 1) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)), Black: 972#(and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)), Black: 1487#(and (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= 0 (+ ~y~0 1)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (<= ~y~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 471#(or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 472#(or (and (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$r_buff0_thd1~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~__unbuffered_p1_EAX~0 0) (<= 0 (div ~y$w_buff0_used~0 256)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (<= 0 ~z~0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)), Black: 986#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)), Black: 988#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)), Black: 1502#(and (= ~y$r_buff0_thd2~0 1) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0))) (= ~__unbuffered_p1_EBX~0 0)), Black: 1501#(and (= ~y$r_buff0_thd2~0 1) (or (and (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= 1 ~__unbuffered_cnt~0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0)), Black: 1500#(and (= ~y$r_buff0_thd2~0 1) (= ~__unbuffered_p1_EBX~0 0) (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)) (= |#ghost~multithreaded| 0))), 737#true, 71#true, Black: 487#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 489#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= (div ~y$w_buff0_used~0 256) 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 1004#(and (or (and (= ~__unbuffered_cnt~0 0) (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (= ~__unbuffered_p1_EBX~0 0) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0) (= ~y$w_buff0_used~0 1)) (= |#ghost~multithreaded| 0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)), Black: 1516#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff1_used~0 0) (= ~y$r_buff0_thd1~0 0) (= ~y$w_buff0~0 0) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1)), Black: 1521#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= 0 (+ ~__unbuffered_cnt~0 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1))) (= ~__unbuffered_p1_EBX~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)), Black: 1519#(and (or (and (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= 0 (+ ~__unbuffered_cnt~0 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 0) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)), 35#L785true, Black: 1520#(and (= ~__unbuffered_p1_EBX~0 0) (or (= |#ghost~multithreaded| 0) (and (= ~z~0 1) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= (* (div ~y$r_buff0_thd1~0 256) 256) ~y$r_buff0_thd1~0) (<= 0 (+ ~__unbuffered_cnt~0 1)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1))) (= ~y$r_buff1_thd1~0 ~y$r_buff0_thd1~0)), Black: 501#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), 854#true, Black: 1018#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0)), Black: 502#(and (or (= |#ghost~multithreaded| 0) (and (= ~__unbuffered_cnt~0 0) (= ~y$w_buff1~0 0) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff1_thd2~0 0) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$r_buff0_thd1~0 (+ (* (div ~y$r_buff0_thd1~0 256) 256) 1)) (<= ~y$r_buff0_thd0~0 (+ (* 256 (div ~y$r_buff0_thd0~0 256)) 1)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0) (<= ~y$read_delayed~0 (+ (* 256 (div ~y$read_delayed~0 256)) 1)) (<= ~y$flush_delayed~0 (+ (* (div ~y$flush_delayed~0 256) 256) 1)) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0))) (= ~x~0 1) (= ~__unbuffered_p1_EBX~0 0)), Black: 1020#(and (= ~__unbuffered_p1_EAX~0 1) (= ~z~0 1) (= ~y$r_buff1_thd2~0 0) (or (and (<= ~y$read_delayed~0 0) (= ~__unbuffered_cnt~0 0) (<= 0 (div ~y$r_buff0_thd1~0 256)) (= ~y$w_buff1~0 0) (<= 0 (div ~y$read_delayed~0 256)) (<= 0 (div ~y$r_buff0_thd0~0 256)) (<= (+ ~y$w_buff1_used~0 1) (+ ~y$w_buff0_used~0 (* 256 (div ~y$w_buff1_used~0 256)))) (= ~y$r_buff0_thd2~0 1) (<= ~y$w_buff0_used~0 1) (<= ~y$flush_delayed~0 0) (<= 0 (div ~y$flush_delayed~0 256)) (= ~y$r_buff1_thd0~0 0) (<= ~y$r_buff0_thd1~0 0) (<= ~y$r_buff0_thd0~0 0) (= ~y$mem_tmp~0 0) (= ~y~0 1) (= ~y$r_buff1_thd1~0 0)) (= |#ghost~multithreaded| 0)) (= ~__unbuffered_p1_EBX~0 1) (= 2 ~y$w_buff0~0) (= ~x~0 1) (= (div ~y$w_buff0_used~0 256) 0))]) [2024-06-27 22:37:29,482 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 22:37:29,482 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:37:29,482 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:37:29,482 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-06-27 22:37:29,708 INFO L124 PetriNetUnfolderBase]: 1528/3092 cut-off events. [2024-06-27 22:37:29,708 INFO L125 PetriNetUnfolderBase]: For 196427/196636 co-relation queries the response was YES. [2024-06-27 22:37:29,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34706 conditions, 3092 events. 1528/3092 cut-off events. For 196427/196636 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 23677 event pairs, 230 based on Foata normal form. 307/3196 useless extension candidates. Maximal degree in co-relation 34438. Up to 859 conditions per place. [2024-06-27 22:37:29,769 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 271 selfloop transitions, 119 changer transitions 0/647 dead transitions. [2024-06-27 22:37:29,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 623 places, 647 transitions, 19576 flow [2024-06-27 22:37:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:37:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:37:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-06-27 22:37:29,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6959459459459459 [2024-06-27 22:37:29,770 INFO L175 Difference]: Start difference. First operand has 620 places, 1345 transitions, 40574 flow. Second operand 4 states and 103 transitions. [2024-06-27 22:37:29,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 623 places, 647 transitions, 19576 flow [2024-06-27 22:37:31,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 647 transitions, 14267 flow, removed 225 selfloop flow, removed 174 redundant places. [2024-06-27 22:37:31,313 INFO L231 Difference]: Finished difference. Result has 451 places, 623 transitions, 13577 flow [2024-06-27 22:37:31,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13033, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=13577, PETRI_PLACES=451, PETRI_TRANSITIONS=623} [2024-06-27 22:37:31,313 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 410 predicate places. [2024-06-27 22:37:31,313 INFO L495 AbstractCegarLoop]: Abstraction has has 451 places, 623 transitions, 13577 flow [2024-06-27 22:37:31,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:31,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:31,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:31,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101 [2024-06-27 22:37:31,314 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:31,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash -630658118, now seen corresponding path program 6 times [2024-06-27 22:37:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:31,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034952468] [2024-06-27 22:37:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:31,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:32,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:32,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034952468] [2024-06-27 22:37:32,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034952468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:32,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:32,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:32,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793785312] [2024-06-27 22:37:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:32,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:32,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:32,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:32,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:37:32,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 623 transitions, 13577 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:32,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:32,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:37:32,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:33,855 INFO L124 PetriNetUnfolderBase]: 2194/3857 cut-off events. [2024-06-27 22:37:33,855 INFO L125 PetriNetUnfolderBase]: For 168949/168952 co-relation queries the response was YES. [2024-06-27 22:37:33,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35188 conditions, 3857 events. 2194/3857 cut-off events. For 168949/168952 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 25484 event pairs, 420 based on Foata normal form. 3/3681 useless extension candidates. Maximal degree in co-relation 34989. Up to 3428 conditions per place. [2024-06-27 22:37:33,917 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 578 selfloop transitions, 77 changer transitions 0/663 dead transitions. [2024-06-27 22:37:33,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 663 transitions, 15265 flow [2024-06-27 22:37:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:33,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-06-27 22:37:33,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176904176904177 [2024-06-27 22:37:33,918 INFO L175 Difference]: Start difference. First operand has 451 places, 623 transitions, 13577 flow. Second operand 11 states and 170 transitions. [2024-06-27 22:37:33,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 461 places, 663 transitions, 15265 flow [2024-06-27 22:37:35,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 663 transitions, 15196 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 22:37:35,247 INFO L231 Difference]: Finished difference. Result has 459 places, 634 transitions, 13957 flow [2024-06-27 22:37:35,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13508, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=13957, PETRI_PLACES=459, PETRI_TRANSITIONS=634} [2024-06-27 22:37:35,247 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 418 predicate places. [2024-06-27 22:37:35,247 INFO L495 AbstractCegarLoop]: Abstraction has has 459 places, 634 transitions, 13957 flow [2024-06-27 22:37:35,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:35,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:35,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:35,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable102 [2024-06-27 22:37:35,248 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:35,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash 839578042, now seen corresponding path program 7 times [2024-06-27 22:37:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:35,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087937568] [2024-06-27 22:37:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:35,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:36,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087937568] [2024-06-27 22:37:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087937568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:36,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076133775] [2024-06-27 22:37:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:36,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:36,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:36,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:37:36,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 459 places, 634 transitions, 13957 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:36,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:36,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:37:36,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:37,827 INFO L124 PetriNetUnfolderBase]: 2297/4047 cut-off events. [2024-06-27 22:37:37,828 INFO L125 PetriNetUnfolderBase]: For 187464/187467 co-relation queries the response was YES. [2024-06-27 22:37:37,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37318 conditions, 4047 events. 2297/4047 cut-off events. For 187464/187467 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 27165 event pairs, 474 based on Foata normal form. 3/3886 useless extension candidates. Maximal degree in co-relation 37115. Up to 3346 conditions per place. [2024-06-27 22:37:37,892 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 559 selfloop transitions, 118 changer transitions 0/685 dead transitions. [2024-06-27 22:37:37,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 685 transitions, 16069 flow [2024-06-27 22:37:37,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:37,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:37,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-27 22:37:37,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250614250614251 [2024-06-27 22:37:37,893 INFO L175 Difference]: Start difference. First operand has 459 places, 634 transitions, 13957 flow. Second operand 11 states and 173 transitions. [2024-06-27 22:37:37,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 685 transitions, 16069 flow [2024-06-27 22:37:39,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 461 places, 685 transitions, 15764 flow, removed 84 selfloop flow, removed 8 redundant places. [2024-06-27 22:37:39,441 INFO L231 Difference]: Finished difference. Result has 464 places, 658 transitions, 14472 flow [2024-06-27 22:37:39,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=13652, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=634, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14472, PETRI_PLACES=464, PETRI_TRANSITIONS=658} [2024-06-27 22:37:39,441 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 423 predicate places. [2024-06-27 22:37:39,442 INFO L495 AbstractCegarLoop]: Abstraction has has 464 places, 658 transitions, 14472 flow [2024-06-27 22:37:39,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:39,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:39,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:39,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable103 [2024-06-27 22:37:39,442 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:39,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash 673789124, now seen corresponding path program 8 times [2024-06-27 22:37:39,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:39,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392183478] [2024-06-27 22:37:39,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:39,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:40,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-27 22:37:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:40,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392183478] [2024-06-27 22:37:40,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392183478] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:40,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:40,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746724074] [2024-06-27 22:37:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:40,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:40,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:40,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:40,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:37:40,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 464 places, 658 transitions, 14472 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:40,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:40,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:37:40,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:42,180 INFO L124 PetriNetUnfolderBase]: 2317/4084 cut-off events. [2024-06-27 22:37:42,180 INFO L125 PetriNetUnfolderBase]: For 193186/193189 co-relation queries the response was YES. [2024-06-27 22:37:42,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38006 conditions, 4084 events. 2317/4084 cut-off events. For 193186/193189 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 27485 event pairs, 533 based on Foata normal form. 3/3909 useless extension candidates. Maximal degree in co-relation 37800. Up to 3744 conditions per place. [2024-06-27 22:37:42,240 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 575 selfloop transitions, 101 changer transitions 0/684 dead transitions. [2024-06-27 22:37:42,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 473 places, 684 transitions, 16074 flow [2024-06-27 22:37:42,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:37:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:37:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 158 transitions. [2024-06-27 22:37:42,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42702702702702705 [2024-06-27 22:37:42,241 INFO L175 Difference]: Start difference. First operand has 464 places, 658 transitions, 14472 flow. Second operand 10 states and 158 transitions. [2024-06-27 22:37:42,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 473 places, 684 transitions, 16074 flow [2024-06-27 22:37:43,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 684 transitions, 15762 flow, removed 110 selfloop flow, removed 6 redundant places. [2024-06-27 22:37:43,905 INFO L231 Difference]: Finished difference. Result has 468 places, 662 transitions, 14545 flow [2024-06-27 22:37:43,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14204, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14545, PETRI_PLACES=468, PETRI_TRANSITIONS=662} [2024-06-27 22:37:43,905 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 427 predicate places. [2024-06-27 22:37:43,905 INFO L495 AbstractCegarLoop]: Abstraction has has 468 places, 662 transitions, 14545 flow [2024-06-27 22:37:43,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:43,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:43,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:43,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104 [2024-06-27 22:37:43,905 INFO L420 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:43,906 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1713462872, now seen corresponding path program 9 times [2024-06-27 22:37:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791803911] [2024-06-27 22:37:43,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791803911] [2024-06-27 22:37:45,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791803911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:45,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:45,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961596690] [2024-06-27 22:37:45,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:45,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:45,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:45,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:45,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:37:45,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 662 transitions, 14545 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:45,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:45,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:37:45,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:46,737 INFO L124 PetriNetUnfolderBase]: 2314/4079 cut-off events. [2024-06-27 22:37:46,738 INFO L125 PetriNetUnfolderBase]: For 177437/177440 co-relation queries the response was YES. [2024-06-27 22:37:46,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37329 conditions, 4079 events. 2314/4079 cut-off events. For 177437/177440 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 27474 event pairs, 508 based on Foata normal form. 3/3911 useless extension candidates. Maximal degree in co-relation 37122. Up to 3592 conditions per place. [2024-06-27 22:37:46,795 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 566 selfloop transitions, 114 changer transitions 0/688 dead transitions. [2024-06-27 22:37:46,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 478 places, 688 transitions, 16033 flow [2024-06-27 22:37:46,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:46,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2024-06-27 22:37:46,796 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4152334152334152 [2024-06-27 22:37:46,796 INFO L175 Difference]: Start difference. First operand has 468 places, 662 transitions, 14545 flow. Second operand 11 states and 169 transitions. [2024-06-27 22:37:46,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 478 places, 688 transitions, 16033 flow [2024-06-27 22:37:48,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 471 places, 688 transitions, 15749 flow, removed 62 selfloop flow, removed 7 redundant places. [2024-06-27 22:37:48,332 INFO L231 Difference]: Finished difference. Result has 473 places, 664 transitions, 14574 flow [2024-06-27 22:37:48,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14261, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14574, PETRI_PLACES=473, PETRI_TRANSITIONS=664} [2024-06-27 22:37:48,332 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 432 predicate places. [2024-06-27 22:37:48,332 INFO L495 AbstractCegarLoop]: Abstraction has has 473 places, 664 transitions, 14574 flow [2024-06-27 22:37:48,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:48,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:48,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:48,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105 [2024-06-27 22:37:48,333 INFO L420 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:48,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2043465952, now seen corresponding path program 1 times [2024-06-27 22:37:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:48,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518071417] [2024-06-27 22:37:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:48,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:49,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:49,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:49,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518071417] [2024-06-27 22:37:49,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518071417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:49,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:49,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:49,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605644208] [2024-06-27 22:37:49,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:49,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:49,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:49,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:49,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:37:49,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 664 transitions, 14574 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:49,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:49,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:37:49,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:51,253 INFO L124 PetriNetUnfolderBase]: 1941/3538 cut-off events. [2024-06-27 22:37:51,254 INFO L125 PetriNetUnfolderBase]: For 172027/172068 co-relation queries the response was YES. [2024-06-27 22:37:51,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32810 conditions, 3538 events. 1941/3538 cut-off events. For 172027/172068 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 24297 event pairs, 522 based on Foata normal form. 37/3360 useless extension candidates. Maximal degree in co-relation 32600. Up to 3039 conditions per place. [2024-06-27 22:37:51,309 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 477 selfloop transitions, 186 changer transitions 0/680 dead transitions. [2024-06-27 22:37:51,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 680 transitions, 16046 flow [2024-06-27 22:37:51,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:37:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:37:51,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-27 22:37:51,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2024-06-27 22:37:51,310 INFO L175 Difference]: Start difference. First operand has 473 places, 664 transitions, 14574 flow. Second operand 10 states and 160 transitions. [2024-06-27 22:37:51,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 680 transitions, 16046 flow [2024-06-27 22:37:52,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 473 places, 680 transitions, 15828 flow, removed 11 selfloop flow, removed 9 redundant places. [2024-06-27 22:37:52,808 INFO L231 Difference]: Finished difference. Result has 474 places, 666 transitions, 14803 flow [2024-06-27 22:37:52,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14356, PETRI_DIFFERENCE_MINUEND_PLACES=464, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=478, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=14803, PETRI_PLACES=474, PETRI_TRANSITIONS=666} [2024-06-27 22:37:52,808 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 433 predicate places. [2024-06-27 22:37:52,808 INFO L495 AbstractCegarLoop]: Abstraction has has 474 places, 666 transitions, 14803 flow [2024-06-27 22:37:52,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:52,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:52,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:52,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106 [2024-06-27 22:37:52,809 INFO L420 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:52,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:52,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2043466293, now seen corresponding path program 1 times [2024-06-27 22:37:52,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:52,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823259450] [2024-06-27 22:37:52,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:52,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:54,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:54,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823259450] [2024-06-27 22:37:54,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823259450] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:54,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:54,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:37:54,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520667786] [2024-06-27 22:37:54,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:54,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:37:54,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:54,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:37:54,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:37:54,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:37:54,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 666 transitions, 14803 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:54,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:54,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:37:54,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:37:55,804 INFO L124 PetriNetUnfolderBase]: 2014/3683 cut-off events. [2024-06-27 22:37:55,804 INFO L125 PetriNetUnfolderBase]: For 228946/228990 co-relation queries the response was YES. [2024-06-27 22:37:55,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34795 conditions, 3683 events. 2014/3683 cut-off events. For 228946/228990 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 25516 event pairs, 548 based on Foata normal form. 47/3511 useless extension candidates. Maximal degree in co-relation 34586. Up to 3048 conditions per place. [2024-06-27 22:37:55,866 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 484 selfloop transitions, 187 changer transitions 0/688 dead transitions. [2024-06-27 22:37:55,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 484 places, 688 transitions, 16487 flow [2024-06-27 22:37:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:37:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:37:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2024-06-27 22:37:55,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42997542997543 [2024-06-27 22:37:55,867 INFO L175 Difference]: Start difference. First operand has 474 places, 666 transitions, 14803 flow. Second operand 11 states and 175 transitions. [2024-06-27 22:37:55,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 484 places, 688 transitions, 16487 flow [2024-06-27 22:37:57,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 688 transitions, 16064 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-27 22:37:57,515 INFO L231 Difference]: Finished difference. Result has 477 places, 668 transitions, 14874 flow [2024-06-27 22:37:57,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14380, PETRI_DIFFERENCE_MINUEND_PLACES=466, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=666, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=185, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14874, PETRI_PLACES=477, PETRI_TRANSITIONS=668} [2024-06-27 22:37:57,515 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 436 predicate places. [2024-06-27 22:37:57,515 INFO L495 AbstractCegarLoop]: Abstraction has has 477 places, 668 transitions, 14874 flow [2024-06-27 22:37:57,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:57,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:37:57,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:37:57,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2024-06-27 22:37:57,515 INFO L420 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:37:57,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:37:57,516 INFO L85 PathProgramCache]: Analyzing trace with hash -921636958, now seen corresponding path program 10 times [2024-06-27 22:37:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:37:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395539153] [2024-06-27 22:37:57,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:37:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:37:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:37:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:37:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:37:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395539153] [2024-06-27 22:37:58,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395539153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:37:58,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:37:58,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:37:58,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245031201] [2024-06-27 22:37:58,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:37:58,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:37:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:37:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:37:58,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:37:58,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:37:58,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 668 transitions, 14874 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:37:58,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:37:58,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:37:58,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:00,408 INFO L124 PetriNetUnfolderBase]: 2424/4282 cut-off events. [2024-06-27 22:38:00,408 INFO L125 PetriNetUnfolderBase]: For 203044/203047 co-relation queries the response was YES. [2024-06-27 22:38:00,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40063 conditions, 4282 events. 2424/4282 cut-off events. For 203044/203047 co-relation queries the response was YES. Maximal size of possible extension queue 361. Compared 29065 event pairs, 547 based on Foata normal form. 3/4103 useless extension candidates. Maximal degree in co-relation 39852. Up to 3637 conditions per place. [2024-06-27 22:38:00,476 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 544 selfloop transitions, 147 changer transitions 0/699 dead transitions. [2024-06-27 22:38:00,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 699 transitions, 16566 flow [2024-06-27 22:38:00,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:00,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-06-27 22:38:00,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275184275184275 [2024-06-27 22:38:00,478 INFO L175 Difference]: Start difference. First operand has 477 places, 668 transitions, 14874 flow. Second operand 11 states and 174 transitions. [2024-06-27 22:38:00,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 699 transitions, 16566 flow [2024-06-27 22:38:02,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 699 transitions, 16172 flow, removed 12 selfloop flow, removed 9 redundant places. [2024-06-27 22:38:02,126 INFO L231 Difference]: Finished difference. Result has 480 places, 673 transitions, 15005 flow [2024-06-27 22:38:02,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14480, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15005, PETRI_PLACES=480, PETRI_TRANSITIONS=673} [2024-06-27 22:38:02,126 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 439 predicate places. [2024-06-27 22:38:02,126 INFO L495 AbstractCegarLoop]: Abstraction has has 480 places, 673 transitions, 15005 flow [2024-06-27 22:38:02,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:02,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:02,126 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:02,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108 [2024-06-27 22:38:02,126 INFO L420 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:02,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 398960442, now seen corresponding path program 11 times [2024-06-27 22:38:02,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:02,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105881662] [2024-06-27 22:38:02,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:02,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:03,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105881662] [2024-06-27 22:38:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105881662] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:03,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:03,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380847504] [2024-06-27 22:38:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:03,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:03,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:03,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:03,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:03,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:03,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 673 transitions, 15005 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:03,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:03,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:03,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:04,847 INFO L124 PetriNetUnfolderBase]: 2458/4343 cut-off events. [2024-06-27 22:38:04,847 INFO L125 PetriNetUnfolderBase]: For 213667/213670 co-relation queries the response was YES. [2024-06-27 22:38:04,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40659 conditions, 4343 events. 2458/4343 cut-off events. For 213667/213670 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 29524 event pairs, 519 based on Foata normal form. 3/4165 useless extension candidates. Maximal degree in co-relation 40446. Up to 3899 conditions per place. [2024-06-27 22:38:04,918 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 626 selfloop transitions, 77 changer transitions 0/711 dead transitions. [2024-06-27 22:38:04,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 711 transitions, 16810 flow [2024-06-27 22:38:04,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2024-06-27 22:38:04,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40786240786240785 [2024-06-27 22:38:04,919 INFO L175 Difference]: Start difference. First operand has 480 places, 673 transitions, 15005 flow. Second operand 11 states and 166 transitions. [2024-06-27 22:38:04,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 490 places, 711 transitions, 16810 flow [2024-06-27 22:38:06,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 711 transitions, 16167 flow, removed 135 selfloop flow, removed 8 redundant places. [2024-06-27 22:38:06,815 INFO L231 Difference]: Finished difference. Result has 484 places, 686 transitions, 14857 flow [2024-06-27 22:38:06,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14366, PETRI_DIFFERENCE_MINUEND_PLACES=472, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=14857, PETRI_PLACES=484, PETRI_TRANSITIONS=686} [2024-06-27 22:38:06,815 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 443 predicate places. [2024-06-27 22:38:06,824 INFO L495 AbstractCegarLoop]: Abstraction has has 484 places, 686 transitions, 14857 flow [2024-06-27 22:38:06,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:06,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:06,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:06,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109 [2024-06-27 22:38:06,825 INFO L420 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:06,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:06,825 INFO L85 PathProgramCache]: Analyzing trace with hash 315303116, now seen corresponding path program 12 times [2024-06-27 22:38:06,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:06,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948184254] [2024-06-27 22:38:06,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:06,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:08,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:08,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948184254] [2024-06-27 22:38:08,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948184254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952175319] [2024-06-27 22:38:08,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:08,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:08,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:08,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:08,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:08,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:08,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 484 places, 686 transitions, 14857 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:08,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:08,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:08,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:09,729 INFO L124 PetriNetUnfolderBase]: 2563/4539 cut-off events. [2024-06-27 22:38:09,730 INFO L125 PetriNetUnfolderBase]: For 229099/229102 co-relation queries the response was YES. [2024-06-27 22:38:09,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41636 conditions, 4539 events. 2563/4539 cut-off events. For 229099/229102 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 31306 event pairs, 587 based on Foata normal form. 3/4371 useless extension candidates. Maximal degree in co-relation 41422. Up to 3888 conditions per place. [2024-06-27 22:38:09,805 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 609 selfloop transitions, 119 changer transitions 0/736 dead transitions. [2024-06-27 22:38:09,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 494 places, 736 transitions, 17161 flow [2024-06-27 22:38:09,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:09,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2024-06-27 22:38:09,806 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4152334152334152 [2024-06-27 22:38:09,806 INFO L175 Difference]: Start difference. First operand has 484 places, 686 transitions, 14857 flow. Second operand 11 states and 169 transitions. [2024-06-27 22:38:09,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 494 places, 736 transitions, 17161 flow [2024-06-27 22:38:11,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 486 places, 736 transitions, 16848 flow, removed 90 selfloop flow, removed 8 redundant places. [2024-06-27 22:38:11,859 INFO L231 Difference]: Finished difference. Result has 489 places, 713 transitions, 15474 flow [2024-06-27 22:38:11,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=14544, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15474, PETRI_PLACES=489, PETRI_TRANSITIONS=713} [2024-06-27 22:38:11,860 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 448 predicate places. [2024-06-27 22:38:11,860 INFO L495 AbstractCegarLoop]: Abstraction has has 489 places, 713 transitions, 15474 flow [2024-06-27 22:38:11,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:11,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:11,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:11,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110 [2024-06-27 22:38:11,860 INFO L420 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:11,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash 458090772, now seen corresponding path program 13 times [2024-06-27 22:38:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:11,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815904551] [2024-06-27 22:38:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:13,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815904551] [2024-06-27 22:38:13,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815904551] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:13,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778917554] [2024-06-27 22:38:13,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:13,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:13,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:13,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:13,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:13,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 489 places, 713 transitions, 15474 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:13,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:13,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:13,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:14,751 INFO L124 PetriNetUnfolderBase]: 2583/4577 cut-off events. [2024-06-27 22:38:14,752 INFO L125 PetriNetUnfolderBase]: For 236022/236025 co-relation queries the response was YES. [2024-06-27 22:38:14,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42328 conditions, 4577 events. 2583/4577 cut-off events. For 236022/236025 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 31685 event pairs, 611 based on Foata normal form. 3/4403 useless extension candidates. Maximal degree in co-relation 42111. Up to 4099 conditions per place. [2024-06-27 22:38:14,827 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 618 selfloop transitions, 113 changer transitions 0/739 dead transitions. [2024-06-27 22:38:14,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 499 places, 739 transitions, 17399 flow [2024-06-27 22:38:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2024-06-27 22:38:14,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40786240786240785 [2024-06-27 22:38:14,828 INFO L175 Difference]: Start difference. First operand has 489 places, 713 transitions, 15474 flow. Second operand 11 states and 166 transitions. [2024-06-27 22:38:14,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 499 places, 739 transitions, 17399 flow [2024-06-27 22:38:16,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 493 places, 739 transitions, 17089 flow, removed 112 selfloop flow, removed 6 redundant places. [2024-06-27 22:38:16,900 INFO L231 Difference]: Finished difference. Result has 495 places, 718 transitions, 15631 flow [2024-06-27 22:38:16,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15208, PETRI_DIFFERENCE_MINUEND_PLACES=483, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15631, PETRI_PLACES=495, PETRI_TRANSITIONS=718} [2024-06-27 22:38:16,901 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 454 predicate places. [2024-06-27 22:38:16,901 INFO L495 AbstractCegarLoop]: Abstraction has has 495 places, 718 transitions, 15631 flow [2024-06-27 22:38:16,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:16,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:16,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable111 [2024-06-27 22:38:16,901 INFO L420 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:16,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash 458096352, now seen corresponding path program 14 times [2024-06-27 22:38:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:16,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927267326] [2024-06-27 22:38:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:16,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:18,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:18,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927267326] [2024-06-27 22:38:18,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927267326] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:18,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:18,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:18,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663129339] [2024-06-27 22:38:18,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:18,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:18,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:18,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:18,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:18,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:18,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 718 transitions, 15631 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:18,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:18,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:18,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:19,988 INFO L124 PetriNetUnfolderBase]: 2580/4572 cut-off events. [2024-06-27 22:38:19,988 INFO L125 PetriNetUnfolderBase]: For 219022/219025 co-relation queries the response was YES. [2024-06-27 22:38:20,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41885 conditions, 4572 events. 2580/4572 cut-off events. For 219022/219025 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 31667 event pairs, 637 based on Foata normal form. 3/4392 useless extension candidates. Maximal degree in co-relation 41665. Up to 4222 conditions per place. [2024-06-27 22:38:20,069 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 627 selfloop transitions, 101 changer transitions 0/736 dead transitions. [2024-06-27 22:38:20,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 736 transitions, 17163 flow [2024-06-27 22:38:20,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 162 transitions. [2024-06-27 22:38:20,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39803439803439805 [2024-06-27 22:38:20,070 INFO L175 Difference]: Start difference. First operand has 495 places, 718 transitions, 15631 flow. Second operand 11 states and 162 transitions. [2024-06-27 22:38:20,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 505 places, 736 transitions, 17163 flow [2024-06-27 22:38:22,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 497 places, 736 transitions, 16854 flow, removed 72 selfloop flow, removed 8 redundant places. [2024-06-27 22:38:22,143 INFO L231 Difference]: Finished difference. Result has 498 places, 718 transitions, 15543 flow [2024-06-27 22:38:22,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15322, PETRI_DIFFERENCE_MINUEND_PLACES=487, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=617, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15543, PETRI_PLACES=498, PETRI_TRANSITIONS=718} [2024-06-27 22:38:22,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 457 predicate places. [2024-06-27 22:38:22,144 INFO L495 AbstractCegarLoop]: Abstraction has has 498 places, 718 transitions, 15543 flow [2024-06-27 22:38:22,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:22,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:22,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:22,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112 [2024-06-27 22:38:22,144 INFO L420 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:22,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash -930526560, now seen corresponding path program 15 times [2024-06-27 22:38:22,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:22,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880273497] [2024-06-27 22:38:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:22,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:23,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880273497] [2024-06-27 22:38:23,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880273497] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:23,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:23,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:23,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111102237] [2024-06-27 22:38:23,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:23,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:23,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:23,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:23,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:23,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:23,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 718 transitions, 15543 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:23,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:23,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:23,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:25,335 INFO L124 PetriNetUnfolderBase]: 2600/4610 cut-off events. [2024-06-27 22:38:25,336 INFO L125 PetriNetUnfolderBase]: For 222581/222584 co-relation queries the response was YES. [2024-06-27 22:38:25,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42049 conditions, 4610 events. 2600/4610 cut-off events. For 222581/222584 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 31946 event pairs, 639 based on Foata normal form. 3/4425 useless extension candidates. Maximal degree in co-relation 41829. Up to 4256 conditions per place. [2024-06-27 22:38:25,411 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 614 selfloop transitions, 120 changer transitions 0/742 dead transitions. [2024-06-27 22:38:25,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 742 transitions, 17261 flow [2024-06-27 22:38:25,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:25,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:25,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2024-06-27 22:38:25,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4152334152334152 [2024-06-27 22:38:25,412 INFO L175 Difference]: Start difference. First operand has 498 places, 718 transitions, 15543 flow. Second operand 11 states and 169 transitions. [2024-06-27 22:38:25,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 508 places, 742 transitions, 17261 flow [2024-06-27 22:38:27,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 500 places, 742 transitions, 17095 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 22:38:27,441 INFO L231 Difference]: Finished difference. Result has 501 places, 722 transitions, 15793 flow [2024-06-27 22:38:27,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15377, PETRI_DIFFERENCE_MINUEND_PLACES=490, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=15793, PETRI_PLACES=501, PETRI_TRANSITIONS=722} [2024-06-27 22:38:27,442 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 460 predicate places. [2024-06-27 22:38:27,442 INFO L495 AbstractCegarLoop]: Abstraction has has 501 places, 722 transitions, 15793 flow [2024-06-27 22:38:27,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:27,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:27,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:27,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2024-06-27 22:38:27,442 INFO L420 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:27,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:27,442 INFO L85 PathProgramCache]: Analyzing trace with hash -937878210, now seen corresponding path program 16 times [2024-06-27 22:38:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732409131] [2024-06-27 22:38:27,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:29,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732409131] [2024-06-27 22:38:29,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732409131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:29,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:29,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707546266] [2024-06-27 22:38:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:29,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:29,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:29,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:29,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:29,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:29,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 722 transitions, 15793 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:29,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:29,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:29,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:30,814 INFO L124 PetriNetUnfolderBase]: 2623/4652 cut-off events. [2024-06-27 22:38:30,814 INFO L125 PetriNetUnfolderBase]: For 232095/232098 co-relation queries the response was YES. [2024-06-27 22:38:30,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42824 conditions, 4652 events. 2623/4652 cut-off events. For 232095/232098 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 32311 event pairs, 648 based on Foata normal form. 3/4466 useless extension candidates. Maximal degree in co-relation 42603. Up to 4219 conditions per place. [2024-06-27 22:38:30,894 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 615 selfloop transitions, 122 changer transitions 0/745 dead transitions. [2024-06-27 22:38:30,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 745 transitions, 17583 flow [2024-06-27 22:38:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:38:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:38:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-27 22:38:30,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2024-06-27 22:38:30,897 INFO L175 Difference]: Start difference. First operand has 501 places, 722 transitions, 15793 flow. Second operand 10 states and 160 transitions. [2024-06-27 22:38:30,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 745 transitions, 17583 flow [2024-06-27 22:38:33,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 745 transitions, 17221 flow, removed 67 selfloop flow, removed 8 redundant places. [2024-06-27 22:38:33,027 INFO L231 Difference]: Finished difference. Result has 503 places, 725 transitions, 15825 flow [2024-06-27 22:38:33,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15431, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=15825, PETRI_PLACES=503, PETRI_TRANSITIONS=725} [2024-06-27 22:38:33,027 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 462 predicate places. [2024-06-27 22:38:33,027 INFO L495 AbstractCegarLoop]: Abstraction has has 503 places, 725 transitions, 15825 flow [2024-06-27 22:38:33,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:33,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:33,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:33,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114 [2024-06-27 22:38:33,028 INFO L420 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:33,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:33,028 INFO L85 PathProgramCache]: Analyzing trace with hash -937883790, now seen corresponding path program 17 times [2024-06-27 22:38:33,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:33,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205243487] [2024-06-27 22:38:33,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:33,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:34,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:34,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205243487] [2024-06-27 22:38:34,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205243487] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:34,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:34,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314470236] [2024-06-27 22:38:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:34,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:34,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:34,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:34,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:34,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 503 places, 725 transitions, 15825 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:34,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:34,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:34,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:36,582 INFO L124 PetriNetUnfolderBase]: 2670/4739 cut-off events. [2024-06-27 22:38:36,582 INFO L125 PetriNetUnfolderBase]: For 239342/239345 co-relation queries the response was YES. [2024-06-27 22:38:36,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43606 conditions, 4739 events. 2670/4739 cut-off events. For 239342/239345 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 33109 event pairs, 652 based on Foata normal form. 3/4555 useless extension candidates. Maximal degree in co-relation 43384. Up to 4268 conditions per place. [2024-06-27 22:38:36,669 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 629 selfloop transitions, 124 changer transitions 0/761 dead transitions. [2024-06-27 22:38:36,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 761 transitions, 17988 flow [2024-06-27 22:38:36,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:36,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2024-06-27 22:38:36,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42997542997543 [2024-06-27 22:38:36,670 INFO L175 Difference]: Start difference. First operand has 503 places, 725 transitions, 15825 flow. Second operand 11 states and 175 transitions. [2024-06-27 22:38:36,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 761 transitions, 17988 flow [2024-06-27 22:38:38,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 761 transitions, 17713 flow, removed 26 selfloop flow, removed 7 redundant places. [2024-06-27 22:38:38,930 INFO L231 Difference]: Finished difference. Result has 508 places, 733 transitions, 16182 flow [2024-06-27 22:38:38,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15550, PETRI_DIFFERENCE_MINUEND_PLACES=496, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16182, PETRI_PLACES=508, PETRI_TRANSITIONS=733} [2024-06-27 22:38:38,930 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 467 predicate places. [2024-06-27 22:38:38,930 INFO L495 AbstractCegarLoop]: Abstraction has has 508 places, 733 transitions, 16182 flow [2024-06-27 22:38:38,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:38,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:38,930 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:38,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable115 [2024-06-27 22:38:38,931 INFO L420 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:38,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1131823200, now seen corresponding path program 18 times [2024-06-27 22:38:38,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:38,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371153968] [2024-06-27 22:38:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:38,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:40,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371153968] [2024-06-27 22:38:40,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371153968] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:40,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:40,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:40,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479199209] [2024-06-27 22:38:40,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:40,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:40,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:40,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:40,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:40,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:40,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 733 transitions, 16182 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:40,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:40,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:40,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:42,642 INFO L124 PetriNetUnfolderBase]: 2756/4892 cut-off events. [2024-06-27 22:38:42,643 INFO L125 PetriNetUnfolderBase]: For 265885/265888 co-relation queries the response was YES. [2024-06-27 22:38:42,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45709 conditions, 4892 events. 2756/4892 cut-off events. For 265885/265888 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 34338 event pairs, 678 based on Foata normal form. 3/4699 useless extension candidates. Maximal degree in co-relation 45485. Up to 4448 conditions per place. [2024-06-27 22:38:42,726 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 662 selfloop transitions, 109 changer transitions 0/779 dead transitions. [2024-06-27 22:38:42,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 779 transitions, 18752 flow [2024-06-27 22:38:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:38:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:38:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-27 22:38:42,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4348894348894349 [2024-06-27 22:38:42,727 INFO L175 Difference]: Start difference. First operand has 508 places, 733 transitions, 16182 flow. Second operand 11 states and 177 transitions. [2024-06-27 22:38:42,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 779 transitions, 18752 flow [2024-06-27 22:38:45,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 779 transitions, 18487 flow, removed 67 selfloop flow, removed 6 redundant places. [2024-06-27 22:38:45,212 INFO L231 Difference]: Finished difference. Result has 515 places, 748 transitions, 16665 flow [2024-06-27 22:38:45,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=15917, PETRI_DIFFERENCE_MINUEND_PLACES=502, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=16665, PETRI_PLACES=515, PETRI_TRANSITIONS=748} [2024-06-27 22:38:45,213 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 474 predicate places. [2024-06-27 22:38:45,213 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 748 transitions, 16665 flow [2024-06-27 22:38:45,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:45,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:45,213 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:45,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116 [2024-06-27 22:38:45,213 INFO L420 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:45,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:45,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1279973236, now seen corresponding path program 19 times [2024-06-27 22:38:45,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:45,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142926331] [2024-06-27 22:38:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:45,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:46,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:46,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:46,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142926331] [2024-06-27 22:38:46,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142926331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:46,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:46,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:46,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417576842] [2024-06-27 22:38:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:46,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:46,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:46,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:46,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:46,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:46,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 748 transitions, 16665 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:46,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:46,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:46,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:48,578 INFO L124 PetriNetUnfolderBase]: 2819/5008 cut-off events. [2024-06-27 22:38:48,578 INFO L125 PetriNetUnfolderBase]: For 292358/292361 co-relation queries the response was YES. [2024-06-27 22:38:48,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47378 conditions, 5008 events. 2819/5008 cut-off events. For 292358/292361 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 35455 event pairs, 681 based on Foata normal form. 3/4823 useless extension candidates. Maximal degree in co-relation 47150. Up to 4255 conditions per place. [2024-06-27 22:38:48,666 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 643 selfloop transitions, 138 changer transitions 0/789 dead transitions. [2024-06-27 22:38:48,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 789 transitions, 19151 flow [2024-06-27 22:38:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:38:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:38:48,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2024-06-27 22:38:48,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44594594594594594 [2024-06-27 22:38:48,668 INFO L175 Difference]: Start difference. First operand has 515 places, 748 transitions, 16665 flow. Second operand 10 states and 165 transitions. [2024-06-27 22:38:48,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 789 transitions, 19151 flow [2024-06-27 22:38:51,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 789 transitions, 18935 flow, removed 72 selfloop flow, removed 5 redundant places. [2024-06-27 22:38:51,209 INFO L231 Difference]: Finished difference. Result has 522 places, 766 transitions, 17430 flow [2024-06-27 22:38:51,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16489, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17430, PETRI_PLACES=522, PETRI_TRANSITIONS=766} [2024-06-27 22:38:51,210 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 481 predicate places. [2024-06-27 22:38:51,210 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 766 transitions, 17430 flow [2024-06-27 22:38:51,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:51,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:51,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:51,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117 [2024-06-27 22:38:51,210 INFO L420 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:51,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1137185580, now seen corresponding path program 20 times [2024-06-27 22:38:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:51,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617842201] [2024-06-27 22:38:51,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:51,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:52,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:52,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617842201] [2024-06-27 22:38:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617842201] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:52,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:52,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:52,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914823655] [2024-06-27 22:38:52,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:52,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:52,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:52,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:52,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:52,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:52,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 766 transitions, 17430 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:52,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:52,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:52,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:54,665 INFO L124 PetriNetUnfolderBase]: 2832/5032 cut-off events. [2024-06-27 22:38:54,665 INFO L125 PetriNetUnfolderBase]: For 299973/299976 co-relation queries the response was YES. [2024-06-27 22:38:54,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48299 conditions, 5032 events. 2832/5032 cut-off events. For 299973/299976 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 35648 event pairs, 686 based on Foata normal form. 3/4839 useless extension candidates. Maximal degree in co-relation 48067. Up to 4451 conditions per place. [2024-06-27 22:38:54,756 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 657 selfloop transitions, 129 changer transitions 0/794 dead transitions. [2024-06-27 22:38:54,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 794 transitions, 19594 flow [2024-06-27 22:38:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:38:54,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:38:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:38:54,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44324324324324327 [2024-06-27 22:38:54,757 INFO L175 Difference]: Start difference. First operand has 522 places, 766 transitions, 17430 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:38:54,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 794 transitions, 19594 flow [2024-06-27 22:38:57,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 794 transitions, 19065 flow, removed 178 selfloop flow, removed 6 redundant places. [2024-06-27 22:38:57,463 INFO L231 Difference]: Finished difference. Result has 527 places, 773 transitions, 17497 flow [2024-06-27 22:38:57,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16985, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=766, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17497, PETRI_PLACES=527, PETRI_TRANSITIONS=773} [2024-06-27 22:38:57,464 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 486 predicate places. [2024-06-27 22:38:57,464 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 773 transitions, 17497 flow [2024-06-27 22:38:57,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:57,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:57,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:57,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable118 [2024-06-27 22:38:57,464 INFO L420 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:38:57,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:57,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1137180000, now seen corresponding path program 21 times [2024-06-27 22:38:57,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:57,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506189060] [2024-06-27 22:38:57,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:57,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:58,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:58,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506189060] [2024-06-27 22:38:58,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506189060] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:58,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:58,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:38:58,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456301761] [2024-06-27 22:38:58,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:58,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:38:58,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:58,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:38:58,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:38:58,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:38:58,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 773 transitions, 17497 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:38:58,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:58,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:38:58,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:00,813 INFO L124 PetriNetUnfolderBase]: 2826/5022 cut-off events. [2024-06-27 22:39:00,813 INFO L125 PetriNetUnfolderBase]: For 268245/268248 co-relation queries the response was YES. [2024-06-27 22:39:00,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47039 conditions, 5022 events. 2826/5022 cut-off events. For 268245/268248 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 35583 event pairs, 710 based on Foata normal form. 5/4827 useless extension candidates. Maximal degree in co-relation 46804. Up to 4555 conditions per place. [2024-06-27 22:39:00,900 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 662 selfloop transitions, 121 changer transitions 0/791 dead transitions. [2024-06-27 22:39:00,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 791 transitions, 19143 flow [2024-06-27 22:39:00,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:39:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:39:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2024-06-27 22:39:00,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41277641277641275 [2024-06-27 22:39:00,901 INFO L175 Difference]: Start difference. First operand has 527 places, 773 transitions, 17497 flow. Second operand 11 states and 168 transitions. [2024-06-27 22:39:00,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 791 transitions, 19143 flow [2024-06-27 22:39:03,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 530 places, 791 transitions, 18497 flow, removed 252 selfloop flow, removed 7 redundant places. [2024-06-27 22:39:03,463 INFO L231 Difference]: Finished difference. Result has 531 places, 773 transitions, 17105 flow [2024-06-27 22:39:03,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16851, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17105, PETRI_PLACES=531, PETRI_TRANSITIONS=773} [2024-06-27 22:39:03,464 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 490 predicate places. [2024-06-27 22:39:03,464 INFO L495 AbstractCegarLoop]: Abstraction has has 531 places, 773 transitions, 17105 flow [2024-06-27 22:39:03,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:03,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:03,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:03,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119 [2024-06-27 22:39:03,465 INFO L420 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:03,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:03,465 INFO L85 PathProgramCache]: Analyzing trace with hash 391697918, now seen corresponding path program 22 times [2024-06-27 22:39:03,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:03,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262120433] [2024-06-27 22:39:03,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:03,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:04,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:04,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262120433] [2024-06-27 22:39:04,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262120433] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:04,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:04,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:39:04,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677843093] [2024-06-27 22:39:04,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:04,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:39:04,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:04,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:39:04,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:39:04,901 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:39:04,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 773 transitions, 17105 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:04,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:04,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:39:04,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:06,615 INFO L124 PetriNetUnfolderBase]: 2839/5045 cut-off events. [2024-06-27 22:39:06,615 INFO L125 PetriNetUnfolderBase]: For 252755/252758 co-relation queries the response was YES. [2024-06-27 22:39:06,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46478 conditions, 5045 events. 2839/5045 cut-off events. For 252755/252758 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 35737 event pairs, 724 based on Foata normal form. 3/4845 useless extension candidates. Maximal degree in co-relation 46242. Up to 4225 conditions per place. [2024-06-27 22:39:06,707 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 563 selfloop transitions, 222 changer transitions 0/793 dead transitions. [2024-06-27 22:39:06,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 793 transitions, 18915 flow [2024-06-27 22:39:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:39:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:39:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-27 22:39:06,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103194103194103 [2024-06-27 22:39:06,708 INFO L175 Difference]: Start difference. First operand has 531 places, 773 transitions, 17105 flow. Second operand 11 states and 167 transitions. [2024-06-27 22:39:06,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 793 transitions, 18915 flow [2024-06-27 22:39:09,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 793 transitions, 18431 flow, removed 126 selfloop flow, removed 9 redundant places. [2024-06-27 22:39:09,325 INFO L231 Difference]: Finished difference. Result has 533 places, 775 transitions, 17230 flow [2024-06-27 22:39:09,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16621, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=773, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=220, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17230, PETRI_PLACES=533, PETRI_TRANSITIONS=775} [2024-06-27 22:39:09,326 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 492 predicate places. [2024-06-27 22:39:09,326 INFO L495 AbstractCegarLoop]: Abstraction has has 533 places, 775 transitions, 17230 flow [2024-06-27 22:39:09,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:09,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:09,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:09,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120 [2024-06-27 22:39:09,326 INFO L420 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:09,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1536097666, now seen corresponding path program 23 times [2024-06-27 22:39:09,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:09,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204465464] [2024-06-27 22:39:09,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:09,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:10,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:10,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204465464] [2024-06-27 22:39:10,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204465464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:10,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:10,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:39:10,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607942160] [2024-06-27 22:39:10,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:10,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:39:10,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:10,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:39:10,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:39:10,857 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:39:10,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 775 transitions, 17230 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:10,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:10,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:39:10,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:12,641 INFO L124 PetriNetUnfolderBase]: 2881/5121 cut-off events. [2024-06-27 22:39:12,641 INFO L125 PetriNetUnfolderBase]: For 283376/283379 co-relation queries the response was YES. [2024-06-27 22:39:12,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47943 conditions, 5121 events. 2881/5121 cut-off events. For 283376/283379 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 36411 event pairs, 727 based on Foata normal form. 3/4921 useless extension candidates. Maximal degree in co-relation 47706. Up to 4241 conditions per place. [2024-06-27 22:39:12,734 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 568 selfloop transitions, 226 changer transitions 0/802 dead transitions. [2024-06-27 22:39:12,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 802 transitions, 19457 flow [2024-06-27 22:39:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:39:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:39:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-06-27 22:39:12,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176904176904177 [2024-06-27 22:39:12,735 INFO L175 Difference]: Start difference. First operand has 533 places, 775 transitions, 17230 flow. Second operand 11 states and 170 transitions. [2024-06-27 22:39:12,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 802 transitions, 19457 flow [2024-06-27 22:39:15,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 802 transitions, 18864 flow, removed 76 selfloop flow, removed 9 redundant places. [2024-06-27 22:39:15,691 INFO L231 Difference]: Finished difference. Result has 536 places, 781 transitions, 17445 flow [2024-06-27 22:39:15,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16637, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=775, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=222, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17445, PETRI_PLACES=536, PETRI_TRANSITIONS=781} [2024-06-27 22:39:15,691 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 495 predicate places. [2024-06-27 22:39:15,692 INFO L495 AbstractCegarLoop]: Abstraction has has 536 places, 781 transitions, 17445 flow [2024-06-27 22:39:15,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:15,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:15,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:15,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121 [2024-06-27 22:39:15,692 INFO L420 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:15,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:15,693 INFO L85 PathProgramCache]: Analyzing trace with hash 565877207, now seen corresponding path program 2 times [2024-06-27 22:39:15,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:15,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256451806] [2024-06-27 22:39:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:15,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:17,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:17,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256451806] [2024-06-27 22:39:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256451806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:17,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:17,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:39:17,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899463249] [2024-06-27 22:39:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:17,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:39:17,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:17,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:39:17,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:39:17,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:39:17,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 781 transitions, 17445 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:17,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:17,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:39:17,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:18,580 INFO L124 PetriNetUnfolderBase]: 2407/4418 cut-off events. [2024-06-27 22:39:18,580 INFO L125 PetriNetUnfolderBase]: For 262732/262774 co-relation queries the response was YES. [2024-06-27 22:39:18,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41880 conditions, 4418 events. 2407/4418 cut-off events. For 262732/262774 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 32139 event pairs, 704 based on Foata normal form. 28/4192 useless extension candidates. Maximal degree in co-relation 41641. Up to 3575 conditions per place. [2024-06-27 22:39:18,663 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 524 selfloop transitions, 253 changer transitions 0/794 dead transitions. [2024-06-27 22:39:18,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 794 transitions, 19501 flow [2024-06-27 22:39:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:39:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:39:18,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 22:39:18,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-27 22:39:18,664 INFO L175 Difference]: Start difference. First operand has 536 places, 781 transitions, 17445 flow. Second operand 9 states and 153 transitions. [2024-06-27 22:39:18,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 794 transitions, 19501 flow [2024-06-27 22:39:21,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 794 transitions, 18987 flow, removed 112 selfloop flow, removed 8 redundant places. [2024-06-27 22:39:21,232 INFO L231 Difference]: Finished difference. Result has 537 places, 783 transitions, 17493 flow [2024-06-27 22:39:21,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16931, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=251, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17493, PETRI_PLACES=537, PETRI_TRANSITIONS=783} [2024-06-27 22:39:21,233 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 496 predicate places. [2024-06-27 22:39:21,233 INFO L495 AbstractCegarLoop]: Abstraction has has 537 places, 783 transitions, 17493 flow [2024-06-27 22:39:21,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:21,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:21,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:21,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122 [2024-06-27 22:39:21,233 INFO L420 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:21,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:21,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1366128489, now seen corresponding path program 2 times [2024-06-27 22:39:21,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:21,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586482963] [2024-06-27 22:39:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:21,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:22,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:22,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586482963] [2024-06-27 22:39:22,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586482963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:22,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:22,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:39:22,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570975357] [2024-06-27 22:39:22,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:22,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:39:22,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:22,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:39:22,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:39:23,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:39:23,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 783 transitions, 17493 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:23,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:23,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:39:23,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:24,792 INFO L124 PetriNetUnfolderBase]: 2427/4457 cut-off events. [2024-06-27 22:39:24,792 INFO L125 PetriNetUnfolderBase]: For 277914/277956 co-relation queries the response was YES. [2024-06-27 22:39:24,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42338 conditions, 4457 events. 2427/4457 cut-off events. For 277914/277956 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 32533 event pairs, 700 based on Foata normal form. 27/4227 useless extension candidates. Maximal degree in co-relation 42099. Up to 3829 conditions per place. [2024-06-27 22:39:24,861 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 625 selfloop transitions, 158 changer transitions 0/800 dead transitions. [2024-06-27 22:39:24,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 800 transitions, 19289 flow [2024-06-27 22:39:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:39:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:39:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-27 22:39:24,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250614250614251 [2024-06-27 22:39:24,862 INFO L175 Difference]: Start difference. First operand has 537 places, 783 transitions, 17493 flow. Second operand 11 states and 173 transitions. [2024-06-27 22:39:24,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 800 transitions, 19289 flow [2024-06-27 22:39:27,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 800 transitions, 18762 flow, removed 16 selfloop flow, removed 7 redundant places. [2024-06-27 22:39:27,199 INFO L231 Difference]: Finished difference. Result has 542 places, 788 transitions, 17504 flow [2024-06-27 22:39:27,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16966, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=783, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17504, PETRI_PLACES=542, PETRI_TRANSITIONS=788} [2024-06-27 22:39:27,200 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 501 predicate places. [2024-06-27 22:39:27,200 INFO L495 AbstractCegarLoop]: Abstraction has has 542 places, 788 transitions, 17504 flow [2024-06-27 22:39:27,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:27,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:27,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:27,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable123 [2024-06-27 22:39:27,200 INFO L420 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:27,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:27,201 INFO L85 PathProgramCache]: Analyzing trace with hash 317715829, now seen corresponding path program 3 times [2024-06-27 22:39:27,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:27,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307205959] [2024-06-27 22:39:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:28,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:28,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307205959] [2024-06-27 22:39:28,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307205959] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:28,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:28,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:39:28,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434788379] [2024-06-27 22:39:28,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:28,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:39:28,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:28,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:39:28,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:39:28,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:39:28,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 788 transitions, 17504 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:28,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:28,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:39:28,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:30,241 INFO L124 PetriNetUnfolderBase]: 2425/4453 cut-off events. [2024-06-27 22:39:30,242 INFO L125 PetriNetUnfolderBase]: For 255750/255792 co-relation queries the response was YES. [2024-06-27 22:39:30,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42070 conditions, 4453 events. 2425/4453 cut-off events. For 255750/255792 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 32433 event pairs, 706 based on Foata normal form. 28/4225 useless extension candidates. Maximal degree in co-relation 41829. Up to 3609 conditions per place. [2024-06-27 22:39:30,313 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 570 selfloop transitions, 212 changer transitions 0/799 dead transitions. [2024-06-27 22:39:30,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 799 transitions, 19524 flow [2024-06-27 22:39:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:39:30,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:39:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 154 transitions. [2024-06-27 22:39:30,314 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4624624624624625 [2024-06-27 22:39:30,314 INFO L175 Difference]: Start difference. First operand has 542 places, 788 transitions, 17504 flow. Second operand 9 states and 154 transitions. [2024-06-27 22:39:30,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 799 transitions, 19524 flow [2024-06-27 22:39:33,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 799 transitions, 19008 flow, removed 106 selfloop flow, removed 8 redundant places. [2024-06-27 22:39:33,109 INFO L231 Difference]: Finished difference. Result has 543 places, 788 transitions, 17418 flow [2024-06-27 22:39:33,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16988, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17418, PETRI_PLACES=543, PETRI_TRANSITIONS=788} [2024-06-27 22:39:33,109 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 502 predicate places. [2024-06-27 22:39:33,109 INFO L495 AbstractCegarLoop]: Abstraction has has 543 places, 788 transitions, 17418 flow [2024-06-27 22:39:33,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:33,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:33,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:33,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable124 [2024-06-27 22:39:33,110 INFO L420 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:33,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:33,110 INFO L85 PathProgramCache]: Analyzing trace with hash 879576437, now seen corresponding path program 4 times [2024-06-27 22:39:33,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:33,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313474475] [2024-06-27 22:39:33,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:33,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:34,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:34,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:34,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313474475] [2024-06-27 22:39:34,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313474475] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:34,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:34,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:39:34,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709567968] [2024-06-27 22:39:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:34,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:39:34,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:34,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:39:34,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:39:34,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:39:34,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 788 transitions, 17418 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:34,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:34,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:39:34,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:36,578 INFO L124 PetriNetUnfolderBase]: 2909/5185 cut-off events. [2024-06-27 22:39:36,578 INFO L125 PetriNetUnfolderBase]: For 255071/255074 co-relation queries the response was YES. [2024-06-27 22:39:36,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47528 conditions, 5185 events. 2909/5185 cut-off events. For 255071/255074 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 37141 event pairs, 1035 based on Foata normal form. 2/4978 useless extension candidates. Maximal degree in co-relation 47287. Up to 4963 conditions per place. [2024-06-27 22:39:36,672 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 777 selfloop transitions, 19 changer transitions 0/804 dead transitions. [2024-06-27 22:39:36,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 804 transitions, 19086 flow [2024-06-27 22:39:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:39:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:39:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2024-06-27 22:39:36,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36609336609336607 [2024-06-27 22:39:36,672 INFO L175 Difference]: Start difference. First operand has 543 places, 788 transitions, 17418 flow. Second operand 11 states and 149 transitions. [2024-06-27 22:39:36,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 804 transitions, 19086 flow [2024-06-27 22:39:39,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 804 transitions, 18628 flow, removed 15 selfloop flow, removed 8 redundant places. [2024-06-27 22:39:39,396 INFO L231 Difference]: Finished difference. Result has 546 places, 788 transitions, 17004 flow [2024-06-27 22:39:39,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16960, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17004, PETRI_PLACES=546, PETRI_TRANSITIONS=788} [2024-06-27 22:39:39,397 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 505 predicate places. [2024-06-27 22:39:39,397 INFO L495 AbstractCegarLoop]: Abstraction has has 546 places, 788 transitions, 17004 flow [2024-06-27 22:39:39,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:39,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:39,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:39,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2024-06-27 22:39:39,397 INFO L420 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:39,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:39,397 INFO L85 PathProgramCache]: Analyzing trace with hash 890627906, now seen corresponding path program 2 times [2024-06-27 22:39:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184532206] [2024-06-27 22:39:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:40,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:40,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184532206] [2024-06-27 22:39:40,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184532206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:40,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:40,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:39:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160579982] [2024-06-27 22:39:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:40,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:39:40,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:40,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:39:40,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:39:40,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:39:40,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 788 transitions, 17004 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:40,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:40,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:39:40,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:42,871 INFO L124 PetriNetUnfolderBase]: 2939/5228 cut-off events. [2024-06-27 22:39:42,871 INFO L125 PetriNetUnfolderBase]: For 271398/271401 co-relation queries the response was YES. [2024-06-27 22:39:42,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47703 conditions, 5228 events. 2939/5228 cut-off events. For 271398/271401 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 37419 event pairs, 1042 based on Foata normal form. 3/5017 useless extension candidates. Maximal degree in co-relation 47460. Up to 4964 conditions per place. [2024-06-27 22:39:42,967 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 780 selfloop transitions, 27 changer transitions 0/815 dead transitions. [2024-06-27 22:39:42,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 815 transitions, 19126 flow [2024-06-27 22:39:42,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:39:42,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:39:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 170 transitions. [2024-06-27 22:39:42,968 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38288288288288286 [2024-06-27 22:39:42,968 INFO L175 Difference]: Start difference. First operand has 546 places, 788 transitions, 17004 flow. Second operand 12 states and 170 transitions. [2024-06-27 22:39:42,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 815 transitions, 19126 flow [2024-06-27 22:39:45,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 815 transitions, 19068 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-27 22:39:45,525 INFO L231 Difference]: Finished difference. Result has 547 places, 792 transitions, 17149 flow [2024-06-27 22:39:45,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=16946, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=788, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=763, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=17149, PETRI_PLACES=547, PETRI_TRANSITIONS=792} [2024-06-27 22:39:45,526 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 506 predicate places. [2024-06-27 22:39:45,526 INFO L495 AbstractCegarLoop]: Abstraction has has 547 places, 792 transitions, 17149 flow [2024-06-27 22:39:45,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:45,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:45,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:45,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126 [2024-06-27 22:39:45,527 INFO L420 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:45,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:45,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1366128830, now seen corresponding path program 3 times [2024-06-27 22:39:45,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:45,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273286545] [2024-06-27 22:39:45,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:45,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:47,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:47,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:47,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273286545] [2024-06-27 22:39:47,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273286545] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:47,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:47,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:39:47,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380425219] [2024-06-27 22:39:47,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:47,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:39:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:47,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:39:47,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:39:47,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:39:47,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 792 transitions, 17149 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:47,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:47,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:39:47,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:48,745 INFO L124 PetriNetUnfolderBase]: 2454/4496 cut-off events. [2024-06-27 22:39:48,745 INFO L125 PetriNetUnfolderBase]: For 266257/266299 co-relation queries the response was YES. [2024-06-27 22:39:48,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41971 conditions, 4496 events. 2454/4496 cut-off events. For 266257/266299 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 32704 event pairs, 707 based on Foata normal form. 25/4255 useless extension candidates. Maximal degree in co-relation 41727. Up to 3881 conditions per place. [2024-06-27 22:39:48,832 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 631 selfloop transitions, 157 changer transitions 0/805 dead transitions. [2024-06-27 22:39:48,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 805 transitions, 18847 flow [2024-06-27 22:39:48,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:39:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:39:48,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 22:39:48,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44054054054054054 [2024-06-27 22:39:48,833 INFO L175 Difference]: Start difference. First operand has 547 places, 792 transitions, 17149 flow. Second operand 10 states and 163 transitions. [2024-06-27 22:39:48,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 805 transitions, 18847 flow [2024-06-27 22:39:51,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 805 transitions, 18750 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-27 22:39:51,503 INFO L231 Difference]: Finished difference. Result has 549 places, 794 transitions, 17449 flow [2024-06-27 22:39:51,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17052, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17449, PETRI_PLACES=549, PETRI_TRANSITIONS=794} [2024-06-27 22:39:51,504 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 508 predicate places. [2024-06-27 22:39:51,504 INFO L495 AbstractCegarLoop]: Abstraction has has 549 places, 794 transitions, 17449 flow [2024-06-27 22:39:51,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:51,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:51,504 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:51,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127 [2024-06-27 22:39:51,505 INFO L420 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:51,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:51,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1366138409, now seen corresponding path program 5 times [2024-06-27 22:39:51,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:51,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932374199] [2024-06-27 22:39:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:51,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:52,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:52,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932374199] [2024-06-27 22:39:52,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932374199] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:52,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:52,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:39:52,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635637974] [2024-06-27 22:39:52,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:52,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:39:52,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:52,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:39:52,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:39:52,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:39:52,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 794 transitions, 17449 flow. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:52,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:52,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:39:52,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:54,417 INFO L124 PetriNetUnfolderBase]: 2452/4493 cut-off events. [2024-06-27 22:39:54,418 INFO L125 PetriNetUnfolderBase]: For 258403/258445 co-relation queries the response was YES. [2024-06-27 22:39:54,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42092 conditions, 4493 events. 2452/4493 cut-off events. For 258403/258445 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 32678 event pairs, 701 based on Foata normal form. 18/4245 useless extension candidates. Maximal degree in co-relation 41847. Up to 3650 conditions per place. [2024-06-27 22:39:54,503 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 598 selfloop transitions, 188 changer transitions 0/803 dead transitions. [2024-06-27 22:39:54,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 803 transitions, 19041 flow [2024-06-27 22:39:54,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:39:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:39:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-06-27 22:39:54,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4594594594594595 [2024-06-27 22:39:54,504 INFO L175 Difference]: Start difference. First operand has 549 places, 794 transitions, 17449 flow. Second operand 9 states and 153 transitions. [2024-06-27 22:39:54,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 803 transitions, 19041 flow [2024-06-27 22:39:56,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 803 transitions, 18642 flow, removed 44 selfloop flow, removed 8 redundant places. [2024-06-27 22:39:56,998 INFO L231 Difference]: Finished difference. Result has 550 places, 794 transitions, 17432 flow [2024-06-27 22:39:56,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17050, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=17432, PETRI_PLACES=550, PETRI_TRANSITIONS=794} [2024-06-27 22:39:56,998 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 509 predicate places. [2024-06-27 22:39:56,999 INFO L495 AbstractCegarLoop]: Abstraction has has 550 places, 794 transitions, 17432 flow [2024-06-27 22:39:56,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 10 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:56,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:56,999 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:56,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128 [2024-06-27 22:39:56,999 INFO L420 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:39:56,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:56,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1573058976, now seen corresponding path program 24 times [2024-06-27 22:39:56,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:57,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619630568] [2024-06-27 22:39:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:57,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:58,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-27 22:39:58,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:58,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619630568] [2024-06-27 22:39:58,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619630568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:58,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:58,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:39:58,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51040275] [2024-06-27 22:39:58,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:58,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:39:58,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:58,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:39:58,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:39:58,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:39:58,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 794 transitions, 17432 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:58,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:58,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:39:58,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:00,551 INFO L124 PetriNetUnfolderBase]: 2963/5256 cut-off events. [2024-06-27 22:40:00,551 INFO L125 PetriNetUnfolderBase]: For 283930/283933 co-relation queries the response was YES. [2024-06-27 22:40:00,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48620 conditions, 5256 events. 2963/5256 cut-off events. For 283930/283933 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 37449 event pairs, 738 based on Foata normal form. 3/5043 useless extension candidates. Maximal degree in co-relation 48374. Up to 4600 conditions per place. [2024-06-27 22:40:00,651 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 628 selfloop transitions, 184 changer transitions 0/820 dead transitions. [2024-06-27 22:40:00,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 820 transitions, 19334 flow [2024-06-27 22:40:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:40:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:40:00,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 195 transitions. [2024-06-27 22:40:00,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40540540540540543 [2024-06-27 22:40:00,652 INFO L175 Difference]: Start difference. First operand has 550 places, 794 transitions, 17432 flow. Second operand 13 states and 195 transitions. [2024-06-27 22:40:00,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 820 transitions, 19334 flow [2024-06-27 22:40:03,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 820 transitions, 18947 flow, removed 2 selfloop flow, removed 9 redundant places. [2024-06-27 22:40:03,711 INFO L231 Difference]: Finished difference. Result has 554 places, 796 transitions, 17587 flow [2024-06-27 22:40:03,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17045, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=794, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=17587, PETRI_PLACES=554, PETRI_TRANSITIONS=796} [2024-06-27 22:40:03,711 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 513 predicate places. [2024-06-27 22:40:03,712 INFO L495 AbstractCegarLoop]: Abstraction has has 554 places, 796 transitions, 17587 flow [2024-06-27 22:40:03,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:03,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:03,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:03,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable129 [2024-06-27 22:40:03,712 INFO L420 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:03,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1468505555, now seen corresponding path program 3 times [2024-06-27 22:40:03,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:03,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109644981] [2024-06-27 22:40:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:03,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:05,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:05,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:05,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109644981] [2024-06-27 22:40:05,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109644981] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:05,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:40:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818830061] [2024-06-27 22:40:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:05,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:40:05,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:40:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:40:05,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:40:05,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 796 transitions, 17587 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:05,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:05,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:40:05,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:07,451 INFO L124 PetriNetUnfolderBase]: 2979/5297 cut-off events. [2024-06-27 22:40:07,451 INFO L125 PetriNetUnfolderBase]: For 289331/289334 co-relation queries the response was YES. [2024-06-27 22:40:07,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49111 conditions, 5297 events. 2979/5297 cut-off events. For 289331/289334 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 37970 event pairs, 1045 based on Foata normal form. 3/5082 useless extension candidates. Maximal degree in co-relation 48864. Up to 5051 conditions per place. [2024-06-27 22:40:07,557 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 790 selfloop transitions, 24 changer transitions 0/822 dead transitions. [2024-06-27 22:40:07,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 822 transitions, 19549 flow [2024-06-27 22:40:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:40:07,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:40:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 176 transitions. [2024-06-27 22:40:07,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3659043659043659 [2024-06-27 22:40:07,559 INFO L175 Difference]: Start difference. First operand has 554 places, 796 transitions, 17587 flow. Second operand 13 states and 176 transitions. [2024-06-27 22:40:07,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 822 transitions, 19549 flow [2024-06-27 22:40:10,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 822 transitions, 18977 flow, removed 88 selfloop flow, removed 12 redundant places. [2024-06-27 22:40:10,561 INFO L231 Difference]: Finished difference. Result has 556 places, 799 transitions, 17212 flow [2024-06-27 22:40:10,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17015, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=772, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=17212, PETRI_PLACES=556, PETRI_TRANSITIONS=799} [2024-06-27 22:40:10,562 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 515 predicate places. [2024-06-27 22:40:10,562 INFO L495 AbstractCegarLoop]: Abstraction has has 556 places, 799 transitions, 17212 flow [2024-06-27 22:40:10,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:10,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:10,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:10,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130 [2024-06-27 22:40:10,562 INFO L420 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:10,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash 317448702, now seen corresponding path program 25 times [2024-06-27 22:40:10,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:10,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950716622] [2024-06-27 22:40:10,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:10,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:11,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:11,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950716622] [2024-06-27 22:40:11,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950716622] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:11,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:11,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:40:11,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955830786] [2024-06-27 22:40:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:11,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:40:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:40:11,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:40:12,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:40:12,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 799 transitions, 17212 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:12,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:12,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:40:12,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:14,117 INFO L124 PetriNetUnfolderBase]: 2992/5310 cut-off events. [2024-06-27 22:40:14,117 INFO L125 PetriNetUnfolderBase]: For 285488/285491 co-relation queries the response was YES. [2024-06-27 22:40:14,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48554 conditions, 5310 events. 2992/5310 cut-off events. For 285488/285491 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 37940 event pairs, 735 based on Foata normal form. 3/5095 useless extension candidates. Maximal degree in co-relation 48306. Up to 4482 conditions per place. [2024-06-27 22:40:14,204 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 590 selfloop transitions, 221 changer transitions 0/819 dead transitions. [2024-06-27 22:40:14,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 819 transitions, 19018 flow [2024-06-27 22:40:14,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:40:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:40:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 169 transitions. [2024-06-27 22:40:14,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4152334152334152 [2024-06-27 22:40:14,206 INFO L175 Difference]: Start difference. First operand has 556 places, 799 transitions, 17212 flow. Second operand 11 states and 169 transitions. [2024-06-27 22:40:14,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 819 transitions, 19018 flow [2024-06-27 22:40:17,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 556 places, 819 transitions, 18905 flow, removed 37 selfloop flow, removed 10 redundant places. [2024-06-27 22:40:17,033 INFO L231 Difference]: Finished difference. Result has 557 places, 801 transitions, 17650 flow [2024-06-27 22:40:17,033 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17099, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=799, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17650, PETRI_PLACES=557, PETRI_TRANSITIONS=801} [2024-06-27 22:40:17,033 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 516 predicate places. [2024-06-27 22:40:17,034 INFO L495 AbstractCegarLoop]: Abstraction has has 557 places, 801 transitions, 17650 flow [2024-06-27 22:40:17,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:17,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:17,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:17,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2024-06-27 22:40:17,034 INFO L420 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:17,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:17,034 INFO L85 PathProgramCache]: Analyzing trace with hash 647285842, now seen corresponding path program 4 times [2024-06-27 22:40:17,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:17,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929677667] [2024-06-27 22:40:17,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:17,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929677667] [2024-06-27 22:40:18,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929677667] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:18,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:18,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:40:18,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523096624] [2024-06-27 22:40:18,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:18,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:40:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:18,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:40:18,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:40:18,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:40:18,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 801 transitions, 17650 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:18,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:18,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:40:18,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:20,343 INFO L124 PetriNetUnfolderBase]: 2494/4567 cut-off events. [2024-06-27 22:40:20,343 INFO L125 PetriNetUnfolderBase]: For 279468/279510 co-relation queries the response was YES. [2024-06-27 22:40:20,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42911 conditions, 4567 events. 2494/4567 cut-off events. For 279468/279510 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 33308 event pairs, 711 based on Foata normal form. 35/4331 useless extension candidates. Maximal degree in co-relation 42662. Up to 3954 conditions per place. [2024-06-27 22:40:20,426 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 596 selfloop transitions, 202 changer transitions 0/815 dead transitions. [2024-06-27 22:40:20,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 815 transitions, 19398 flow [2024-06-27 22:40:20,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:40:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:40:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 22:40:20,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44054054054054054 [2024-06-27 22:40:20,426 INFO L175 Difference]: Start difference. First operand has 557 places, 801 transitions, 17650 flow. Second operand 10 states and 163 transitions. [2024-06-27 22:40:20,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 815 transitions, 19398 flow [2024-06-27 22:40:23,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 815 transitions, 18869 flow, removed 45 selfloop flow, removed 9 redundant places. [2024-06-27 22:40:23,369 INFO L231 Difference]: Finished difference. Result has 558 places, 803 transitions, 17612 flow [2024-06-27 22:40:23,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17121, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17612, PETRI_PLACES=558, PETRI_TRANSITIONS=803} [2024-06-27 22:40:23,369 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 517 predicate places. [2024-06-27 22:40:23,369 INFO L495 AbstractCegarLoop]: Abstraction has has 558 places, 803 transitions, 17612 flow [2024-06-27 22:40:23,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:23,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:23,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:23,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132 [2024-06-27 22:40:23,370 INFO L420 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:23,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1366405536, now seen corresponding path program 26 times [2024-06-27 22:40:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:23,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257116048] [2024-06-27 22:40:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:24,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:24,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257116048] [2024-06-27 22:40:24,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257116048] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:24,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:24,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:40:24,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090364150] [2024-06-27 22:40:24,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:24,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:40:24,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:24,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:40:24,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:40:24,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:40:24,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 803 transitions, 17612 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:24,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:24,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:40:24,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:26,758 INFO L124 PetriNetUnfolderBase]: 3018/5352 cut-off events. [2024-06-27 22:40:26,758 INFO L125 PetriNetUnfolderBase]: For 296466/296469 co-relation queries the response was YES. [2024-06-27 22:40:26,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49439 conditions, 5352 events. 3018/5352 cut-off events. For 296466/296469 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 38282 event pairs, 742 based on Foata normal form. 3/5134 useless extension candidates. Maximal degree in co-relation 49190. Up to 4524 conditions per place. [2024-06-27 22:40:26,859 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 621 selfloop transitions, 194 changer transitions 0/823 dead transitions. [2024-06-27 22:40:26,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 823 transitions, 19492 flow [2024-06-27 22:40:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:40:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:40:26,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-06-27 22:40:26,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176904176904177 [2024-06-27 22:40:26,860 INFO L175 Difference]: Start difference. First operand has 558 places, 803 transitions, 17612 flow. Second operand 11 states and 170 transitions. [2024-06-27 22:40:26,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 823 transitions, 19492 flow [2024-06-27 22:40:29,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 823 transitions, 19025 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-27 22:40:30,006 INFO L231 Difference]: Finished difference. Result has 561 places, 805 transitions, 17708 flow [2024-06-27 22:40:30,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17145, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=803, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17708, PETRI_PLACES=561, PETRI_TRANSITIONS=805} [2024-06-27 22:40:30,006 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 520 predicate places. [2024-06-27 22:40:30,007 INFO L495 AbstractCegarLoop]: Abstraction has has 561 places, 805 transitions, 17708 flow [2024-06-27 22:40:30,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:30,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:30,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:30,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133 [2024-06-27 22:40:30,007 INFO L420 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:30,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1209900455, now seen corresponding path program 4 times [2024-06-27 22:40:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185384226] [2024-06-27 22:40:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:31,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:31,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185384226] [2024-06-27 22:40:31,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185384226] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:31,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:31,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:40:31,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964506056] [2024-06-27 22:40:31,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:31,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:40:31,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:40:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:40:31,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:40:31,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 805 transitions, 17708 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:31,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:31,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:40:31,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:33,452 INFO L124 PetriNetUnfolderBase]: 2524/4623 cut-off events. [2024-06-27 22:40:33,452 INFO L125 PetriNetUnfolderBase]: For 311919/311961 co-relation queries the response was YES. [2024-06-27 22:40:33,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43662 conditions, 4623 events. 2524/4623 cut-off events. For 311919/311961 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 33850 event pairs, 718 based on Foata normal form. 37/4386 useless extension candidates. Maximal degree in co-relation 43411. Up to 3993 conditions per place. [2024-06-27 22:40:33,541 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 628 selfloop transitions, 177 changer transitions 0/822 dead transitions. [2024-06-27 22:40:33,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 822 transitions, 19558 flow [2024-06-27 22:40:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:40:33,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:40:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-27 22:40:33,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250614250614251 [2024-06-27 22:40:33,542 INFO L175 Difference]: Start difference. First operand has 561 places, 805 transitions, 17708 flow. Second operand 11 states and 173 transitions. [2024-06-27 22:40:33,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 822 transitions, 19558 flow [2024-06-27 22:40:36,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 822 transitions, 19011 flow, removed 81 selfloop flow, removed 9 redundant places. [2024-06-27 22:40:36,334 INFO L231 Difference]: Finished difference. Result has 564 places, 810 transitions, 17746 flow [2024-06-27 22:40:36,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17161, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=805, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17746, PETRI_PLACES=564, PETRI_TRANSITIONS=810} [2024-06-27 22:40:36,335 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 523 predicate places. [2024-06-27 22:40:36,335 INFO L495 AbstractCegarLoop]: Abstraction has has 564 places, 810 transitions, 17746 flow [2024-06-27 22:40:36,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:36,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:36,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:36,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134 [2024-06-27 22:40:36,335 INFO L420 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:36,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:36,335 INFO L85 PathProgramCache]: Analyzing trace with hash 317725408, now seen corresponding path program 5 times [2024-06-27 22:40:36,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:36,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49281204] [2024-06-27 22:40:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:36,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:36,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:37,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:37,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49281204] [2024-06-27 22:40:37,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49281204] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:37,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:37,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:40:37,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806482970] [2024-06-27 22:40:37,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:37,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:40:37,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:37,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:40:37,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:40:38,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:40:38,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 810 transitions, 17746 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:38,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:38,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:40:38,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:39,603 INFO L124 PetriNetUnfolderBase]: 2527/4627 cut-off events. [2024-06-27 22:40:39,603 INFO L125 PetriNetUnfolderBase]: For 288533/288575 co-relation queries the response was YES. [2024-06-27 22:40:39,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43414 conditions, 4627 events. 2527/4627 cut-off events. For 288533/288575 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 33855 event pairs, 719 based on Foata normal form. 35/4386 useless extension candidates. Maximal degree in co-relation 43161. Up to 4010 conditions per place. [2024-06-27 22:40:39,691 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 630 selfloop transitions, 176 changer transitions 0/823 dead transitions. [2024-06-27 22:40:39,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 823 transitions, 19490 flow [2024-06-27 22:40:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:40:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:40:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 163 transitions. [2024-06-27 22:40:39,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44054054054054054 [2024-06-27 22:40:39,692 INFO L175 Difference]: Start difference. First operand has 564 places, 810 transitions, 17746 flow. Second operand 10 states and 163 transitions. [2024-06-27 22:40:39,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 823 transitions, 19490 flow [2024-06-27 22:40:42,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 823 transitions, 19072 flow, removed 97 selfloop flow, removed 7 redundant places. [2024-06-27 22:40:42,635 INFO L231 Difference]: Finished difference. Result has 567 places, 812 transitions, 17771 flow [2024-06-27 22:40:42,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17328, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=810, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=17771, PETRI_PLACES=567, PETRI_TRANSITIONS=812} [2024-06-27 22:40:42,635 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 526 predicate places. [2024-06-27 22:40:42,635 INFO L495 AbstractCegarLoop]: Abstraction has has 567 places, 812 transitions, 17771 flow [2024-06-27 22:40:42,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:42,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:42,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:42,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable135 [2024-06-27 22:40:42,636 INFO L420 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:42,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash 879586357, now seen corresponding path program 5 times [2024-06-27 22:40:42,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:42,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287746698] [2024-06-27 22:40:42,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:44,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:44,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287746698] [2024-06-27 22:40:44,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287746698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:44,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:44,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:40:44,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472056144] [2024-06-27 22:40:44,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:44,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:40:44,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:44,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:40:44,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:40:44,212 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:40:44,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 812 transitions, 17771 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:44,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:44,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:40:44,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:46,120 INFO L124 PetriNetUnfolderBase]: 3075/5466 cut-off events. [2024-06-27 22:40:46,120 INFO L125 PetriNetUnfolderBase]: For 317696/317699 co-relation queries the response was YES. [2024-06-27 22:40:46,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50301 conditions, 5466 events. 3075/5466 cut-off events. For 317696/317699 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 39403 event pairs, 1057 based on Foata normal form. 5/5246 useless extension candidates. Maximal degree in co-relation 50047. Up to 5203 conditions per place. [2024-06-27 22:40:46,228 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 805 selfloop transitions, 24 changer transitions 0/837 dead transitions. [2024-06-27 22:40:46,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 837 transitions, 19745 flow [2024-06-27 22:40:46,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:40:46,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:40:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 157 transitions. [2024-06-27 22:40:46,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3857493857493858 [2024-06-27 22:40:46,229 INFO L175 Difference]: Start difference. First operand has 567 places, 812 transitions, 17771 flow. Second operand 11 states and 157 transitions. [2024-06-27 22:40:46,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 837 transitions, 19745 flow [2024-06-27 22:40:49,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 837 transitions, 19326 flow, removed 35 selfloop flow, removed 8 redundant places. [2024-06-27 22:40:49,674 INFO L231 Difference]: Finished difference. Result has 571 places, 817 transitions, 17643 flow [2024-06-27 22:40:49,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17352, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=812, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17643, PETRI_PLACES=571, PETRI_TRANSITIONS=817} [2024-06-27 22:40:49,675 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 530 predicate places. [2024-06-27 22:40:49,675 INFO L495 AbstractCegarLoop]: Abstraction has has 571 places, 817 transitions, 17643 flow [2024-06-27 22:40:49,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:49,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:49,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:49,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable136 [2024-06-27 22:40:49,675 INFO L420 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:49,676 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash 891014197, now seen corresponding path program 6 times [2024-06-27 22:40:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:49,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317837505] [2024-06-27 22:40:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:49,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:51,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:51,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317837505] [2024-06-27 22:40:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317837505] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:51,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:51,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:40:51,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414966421] [2024-06-27 22:40:51,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:51,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:40:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:51,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:40:51,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:40:51,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:40:51,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 817 transitions, 17643 flow. Second operand has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:51,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:51,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:40:51,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:53,850 INFO L124 PetriNetUnfolderBase]: 3159/5623 cut-off events. [2024-06-27 22:40:53,850 INFO L125 PetriNetUnfolderBase]: For 378400/378403 co-relation queries the response was YES. [2024-06-27 22:40:53,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53027 conditions, 5623 events. 3159/5623 cut-off events. For 378400/378403 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 40562 event pairs, 1095 based on Foata normal form. 3/5402 useless extension candidates. Maximal degree in co-relation 52770. Up to 5146 conditions per place. [2024-06-27 22:40:53,954 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 810 selfloop transitions, 34 changer transitions 0/852 dead transitions. [2024-06-27 22:40:53,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 852 transitions, 20245 flow [2024-06-27 22:40:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:40:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:40:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 188 transitions. [2024-06-27 22:40:53,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3908523908523909 [2024-06-27 22:40:53,956 INFO L175 Difference]: Start difference. First operand has 571 places, 817 transitions, 17643 flow. Second operand 13 states and 188 transitions. [2024-06-27 22:40:53,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 852 transitions, 20245 flow [2024-06-27 22:40:57,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 852 transitions, 20019 flow, removed 101 selfloop flow, removed 7 redundant places. [2024-06-27 22:40:57,778 INFO L231 Difference]: Finished difference. Result has 577 places, 821 transitions, 17754 flow [2024-06-27 22:40:57,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17417, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=785, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=17754, PETRI_PLACES=577, PETRI_TRANSITIONS=821} [2024-06-27 22:40:57,779 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 536 predicate places. [2024-06-27 22:40:57,779 INFO L495 AbstractCegarLoop]: Abstraction has has 577 places, 821 transitions, 17754 flow [2024-06-27 22:40:57,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.25) internal successors, (111), 12 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:57,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:57,779 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:57,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137 [2024-06-27 22:40:57,780 INFO L420 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:40:57,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1549587140, now seen corresponding path program 6 times [2024-06-27 22:40:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:57,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31595613] [2024-06-27 22:40:57,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:57,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:59,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:59,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31595613] [2024-06-27 22:40:59,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31595613] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:59,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:59,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:40:59,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114900874] [2024-06-27 22:40:59,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:59,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:40:59,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:59,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:40:59,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:40:59,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:40:59,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 821 transitions, 17754 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:59,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:59,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:40:59,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:01,384 INFO L124 PetriNetUnfolderBase]: 3155/5617 cut-off events. [2024-06-27 22:41:01,385 INFO L125 PetriNetUnfolderBase]: For 365559/365562 co-relation queries the response was YES. [2024-06-27 22:41:01,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52304 conditions, 5617 events. 3155/5617 cut-off events. For 365559/365562 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 40623 event pairs, 1102 based on Foata normal form. 3/5395 useless extension candidates. Maximal degree in co-relation 52045. Up to 5368 conditions per place. [2024-06-27 22:41:01,496 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 808 selfloop transitions, 24 changer transitions 0/840 dead transitions. [2024-06-27 22:41:01,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 840 transitions, 19534 flow [2024-06-27 22:41:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 156 transitions. [2024-06-27 22:41:01,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3832923832923833 [2024-06-27 22:41:01,497 INFO L175 Difference]: Start difference. First operand has 577 places, 821 transitions, 17754 flow. Second operand 11 states and 156 transitions. [2024-06-27 22:41:01,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 840 transitions, 19534 flow [2024-06-27 22:41:05,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 840 transitions, 19367 flow, removed 66 selfloop flow, removed 9 redundant places. [2024-06-27 22:41:05,495 INFO L231 Difference]: Finished difference. Result has 579 places, 821 transitions, 17640 flow [2024-06-27 22:41:05,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17587, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=797, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=17640, PETRI_PLACES=579, PETRI_TRANSITIONS=821} [2024-06-27 22:41:05,496 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 538 predicate places. [2024-06-27 22:41:05,496 INFO L495 AbstractCegarLoop]: Abstraction has has 579 places, 821 transitions, 17640 flow [2024-06-27 22:41:05,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:05,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:05,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:05,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138 [2024-06-27 22:41:05,496 INFO L420 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:05,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:05,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1459251125, now seen corresponding path program 7 times [2024-06-27 22:41:05,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:05,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584291108] [2024-06-27 22:41:05,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:05,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:07,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:07,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:07,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584291108] [2024-06-27 22:41:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584291108] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:07,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:07,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:41:07,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646650174] [2024-06-27 22:41:07,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:07,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:41:07,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:07,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:41:07,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:41:07,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:41:07,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 821 transitions, 17640 flow. Second operand has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:07,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:07,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:41:07,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:09,061 INFO L124 PetriNetUnfolderBase]: 2621/4808 cut-off events. [2024-06-27 22:41:09,061 INFO L125 PetriNetUnfolderBase]: For 360892/360937 co-relation queries the response was YES. [2024-06-27 22:41:09,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45502 conditions, 4808 events. 2621/4808 cut-off events. For 360892/360937 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 35418 event pairs, 758 based on Foata normal form. 37/4562 useless extension candidates. Maximal degree in co-relation 45241. Up to 4175 conditions per place. [2024-06-27 22:41:09,157 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 617 selfloop transitions, 204 changer transitions 0/838 dead transitions. [2024-06-27 22:41:09,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 838 transitions, 19540 flow [2024-06-27 22:41:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-27 22:41:09,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250614250614251 [2024-06-27 22:41:09,158 INFO L175 Difference]: Start difference. First operand has 579 places, 821 transitions, 17640 flow. Second operand 11 states and 173 transitions. [2024-06-27 22:41:09,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 838 transitions, 19540 flow [2024-06-27 22:41:12,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 838 transitions, 19478 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-27 22:41:12,608 INFO L231 Difference]: Finished difference. Result has 581 places, 826 transitions, 18234 flow [2024-06-27 22:41:12,608 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17578, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=200, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=618, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18234, PETRI_PLACES=581, PETRI_TRANSITIONS=826} [2024-06-27 22:41:12,608 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 540 predicate places. [2024-06-27 22:41:12,608 INFO L495 AbstractCegarLoop]: Abstraction has has 581 places, 826 transitions, 18234 flow [2024-06-27 22:41:12,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.25) internal successors, (123), 12 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:12,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:12,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:12,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139 [2024-06-27 22:41:12,608 INFO L420 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:12,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:12,609 INFO L85 PathProgramCache]: Analyzing trace with hash 42822956, now seen corresponding path program 27 times [2024-06-27 22:41:12,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:12,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103129241] [2024-06-27 22:41:12,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:12,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:12,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:14,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:14,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:14,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103129241] [2024-06-27 22:41:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103129241] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:14,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:41:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744852333] [2024-06-27 22:41:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:14,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:41:14,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:14,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:41:14,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:41:14,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:41:14,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 826 transitions, 18234 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:14,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:14,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:41:14,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:16,216 INFO L124 PetriNetUnfolderBase]: 3207/5702 cut-off events. [2024-06-27 22:41:16,216 INFO L125 PetriNetUnfolderBase]: For 395105/395108 co-relation queries the response was YES. [2024-06-27 22:41:16,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54019 conditions, 5702 events. 3207/5702 cut-off events. For 395105/395108 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 41201 event pairs, 788 based on Foata normal form. 3/5480 useless extension candidates. Maximal degree in co-relation 53756. Up to 4811 conditions per place. [2024-06-27 22:41:16,329 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 650 selfloop transitions, 195 changer transitions 0/853 dead transitions. [2024-06-27 22:41:16,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 853 transitions, 20631 flow [2024-06-27 22:41:16,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:16,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:16,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-06-27 22:41:16,330 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275184275184275 [2024-06-27 22:41:16,330 INFO L175 Difference]: Start difference. First operand has 581 places, 826 transitions, 18234 flow. Second operand 11 states and 174 transitions. [2024-06-27 22:41:16,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 853 transitions, 20631 flow [2024-06-27 22:41:20,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 853 transitions, 20141 flow, removed 106 selfloop flow, removed 7 redundant places. [2024-06-27 22:41:20,034 INFO L231 Difference]: Finished difference. Result has 586 places, 832 transitions, 18525 flow [2024-06-27 22:41:20,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17744, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=826, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18525, PETRI_PLACES=586, PETRI_TRANSITIONS=832} [2024-06-27 22:41:20,034 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 545 predicate places. [2024-06-27 22:41:20,034 INFO L495 AbstractCegarLoop]: Abstraction has has 586 places, 832 transitions, 18525 flow [2024-06-27 22:41:20,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:20,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:20,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:20,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140 [2024-06-27 22:41:20,035 INFO L420 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:20,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:20,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1373757186, now seen corresponding path program 28 times [2024-06-27 22:41:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:20,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791976558] [2024-06-27 22:41:20,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:20,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:21,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:21,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:21,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791976558] [2024-06-27 22:41:21,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791976558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:21,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:21,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:41:21,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092111946] [2024-06-27 22:41:21,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:21,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:41:21,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:21,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:41:21,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:41:21,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:41:21,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 832 transitions, 18525 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:21,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:21,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:41:21,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:24,203 INFO L124 PetriNetUnfolderBase]: 3207/5701 cut-off events. [2024-06-27 22:41:24,204 INFO L125 PetriNetUnfolderBase]: For 378569/378572 co-relation queries the response was YES. [2024-06-27 22:41:24,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53720 conditions, 5701 events. 3207/5701 cut-off events. For 378569/378572 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 41182 event pairs, 801 based on Foata normal form. 3/5478 useless extension candidates. Maximal degree in co-relation 53454. Up to 4862 conditions per place. [2024-06-27 22:41:24,322 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 652 selfloop transitions, 192 changer transitions 0/852 dead transitions. [2024-06-27 22:41:24,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 852 transitions, 20447 flow [2024-06-27 22:41:24,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:24,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-06-27 22:41:24,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226044226044226 [2024-06-27 22:41:24,324 INFO L175 Difference]: Start difference. First operand has 586 places, 832 transitions, 18525 flow. Second operand 11 states and 172 transitions. [2024-06-27 22:41:24,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 852 transitions, 20447 flow [2024-06-27 22:41:28,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 852 transitions, 19885 flow, removed 171 selfloop flow, removed 7 redundant places. [2024-06-27 22:41:28,320 INFO L231 Difference]: Finished difference. Result has 590 places, 834 transitions, 18507 flow [2024-06-27 22:41:28,320 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17963, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=832, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18507, PETRI_PLACES=590, PETRI_TRANSITIONS=834} [2024-06-27 22:41:28,321 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 549 predicate places. [2024-06-27 22:41:28,321 INFO L495 AbstractCegarLoop]: Abstraction has has 590 places, 834 transitions, 18507 flow [2024-06-27 22:41:28,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:28,321 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:28,321 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:28,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141 [2024-06-27 22:41:28,321 INFO L420 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:28,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:28,322 INFO L85 PathProgramCache]: Analyzing trace with hash 565610080, now seen corresponding path program 29 times [2024-06-27 22:41:28,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:28,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362375417] [2024-06-27 22:41:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:28,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:29,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:29,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362375417] [2024-06-27 22:41:29,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362375417] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:29,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:29,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:41:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212556336] [2024-06-27 22:41:29,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:29,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:41:29,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:29,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:41:29,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:41:29,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:41:29,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 834 transitions, 18507 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:29,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:29,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:41:29,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:31,866 INFO L124 PetriNetUnfolderBase]: 3204/5697 cut-off events. [2024-06-27 22:41:31,866 INFO L125 PetriNetUnfolderBase]: For 352395/352398 co-relation queries the response was YES. [2024-06-27 22:41:31,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53072 conditions, 5697 events. 3204/5697 cut-off events. For 352395/352398 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 41132 event pairs, 794 based on Foata normal form. 3/5473 useless extension candidates. Maximal degree in co-relation 52804. Up to 4860 conditions per place. [2024-06-27 22:41:31,981 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 580 selfloop transitions, 264 changer transitions 0/852 dead transitions. [2024-06-27 22:41:31,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 852 transitions, 20279 flow [2024-06-27 22:41:31,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2024-06-27 22:41:31,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40786240786240785 [2024-06-27 22:41:31,983 INFO L175 Difference]: Start difference. First operand has 590 places, 834 transitions, 18507 flow. Second operand 11 states and 166 transitions. [2024-06-27 22:41:31,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 852 transitions, 20279 flow [2024-06-27 22:41:35,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 852 transitions, 19675 flow, removed 112 selfloop flow, removed 9 redundant places. [2024-06-27 22:41:35,802 INFO L231 Difference]: Finished difference. Result has 592 places, 834 transitions, 18436 flow [2024-06-27 22:41:35,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17903, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18436, PETRI_PLACES=592, PETRI_TRANSITIONS=834} [2024-06-27 22:41:35,803 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 551 predicate places. [2024-06-27 22:41:35,803 INFO L495 AbstractCegarLoop]: Abstraction has has 592 places, 834 transitions, 18436 flow [2024-06-27 22:41:35,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:35,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:35,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:35,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142 [2024-06-27 22:41:35,804 INFO L420 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:35,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1567702176, now seen corresponding path program 30 times [2024-06-27 22:41:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:35,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379832965] [2024-06-27 22:41:35,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:35,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:37,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379832965] [2024-06-27 22:41:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379832965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:37,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:37,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:41:37,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820291566] [2024-06-27 22:41:37,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:37,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:41:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:37,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:41:37,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:41:37,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:41:37,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 834 transitions, 18436 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:37,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:37,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:41:37,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:39,521 INFO L124 PetriNetUnfolderBase]: 3230/5742 cut-off events. [2024-06-27 22:41:39,521 INFO L125 PetriNetUnfolderBase]: For 359067/359070 co-relation queries the response was YES. [2024-06-27 22:41:39,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53580 conditions, 5742 events. 3230/5742 cut-off events. For 359067/359070 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 41540 event pairs, 807 based on Foata normal form. 3/5520 useless extension candidates. Maximal degree in co-relation 53311. Up to 4862 conditions per place. [2024-06-27 22:41:39,643 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 654 selfloop transitions, 196 changer transitions 0/858 dead transitions. [2024-06-27 22:41:39,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 858 transitions, 20431 flow [2024-06-27 22:41:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:39,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-06-27 22:41:39,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201474201474201 [2024-06-27 22:41:39,644 INFO L175 Difference]: Start difference. First operand has 592 places, 834 transitions, 18436 flow. Second operand 11 states and 171 transitions. [2024-06-27 22:41:39,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 858 transitions, 20431 flow [2024-06-27 22:41:43,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 858 transitions, 19896 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-27 22:41:43,823 INFO L231 Difference]: Finished difference. Result has 595 places, 838 transitions, 18517 flow [2024-06-27 22:41:43,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17901, PETRI_DIFFERENCE_MINUEND_PLACES=583, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=18517, PETRI_PLACES=595, PETRI_TRANSITIONS=838} [2024-06-27 22:41:43,824 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 554 predicate places. [2024-06-27 22:41:43,824 INFO L495 AbstractCegarLoop]: Abstraction has has 595 places, 838 transitions, 18517 flow [2024-06-27 22:41:43,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:43,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:43,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:43,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2024-06-27 22:41:43,824 INFO L420 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:43,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1573208706, now seen corresponding path program 31 times [2024-06-27 22:41:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:43,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252701823] [2024-06-27 22:41:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:46,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:46,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252701823] [2024-06-27 22:41:46,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252701823] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:46,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:46,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:41:46,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481519669] [2024-06-27 22:41:46,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:46,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:41:46,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:46,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:41:46,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:41:46,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:41:46,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 838 transitions, 18517 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:46,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:46,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:41:46,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:48,426 INFO L124 PetriNetUnfolderBase]: 3236/5757 cut-off events. [2024-06-27 22:41:48,426 INFO L125 PetriNetUnfolderBase]: For 354754/354757 co-relation queries the response was YES. [2024-06-27 22:41:48,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53712 conditions, 5757 events. 3236/5757 cut-off events. For 354754/354757 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 41658 event pairs, 796 based on Foata normal form. 3/5542 useless extension candidates. Maximal degree in co-relation 53441. Up to 4630 conditions per place. [2024-06-27 22:41:48,548 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 655 selfloop transitions, 206 changer transitions 0/869 dead transitions. [2024-06-27 22:41:48,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 869 transitions, 20924 flow [2024-06-27 22:41:48,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:41:48,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:41:48,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 22:41:48,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2024-06-27 22:41:48,549 INFO L175 Difference]: Start difference. First operand has 595 places, 838 transitions, 18517 flow. Second operand 10 states and 166 transitions. [2024-06-27 22:41:48,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 869 transitions, 20924 flow [2024-06-27 22:41:52,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 869 transitions, 20357 flow, removed 93 selfloop flow, removed 8 redundant places. [2024-06-27 22:41:52,721 INFO L231 Difference]: Finished difference. Result has 599 places, 844 transitions, 18806 flow [2024-06-27 22:41:52,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=17950, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=838, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=18806, PETRI_PLACES=599, PETRI_TRANSITIONS=844} [2024-06-27 22:41:52,721 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 558 predicate places. [2024-06-27 22:41:52,721 INFO L495 AbstractCegarLoop]: Abstraction has has 599 places, 844 transitions, 18806 flow [2024-06-27 22:41:52,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:52,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:52,721 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-27 22:41:52,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144 [2024-06-27 22:41:52,722 INFO L420 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:41:52,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1889763397, now seen corresponding path program 1 times [2024-06-27 22:41:52,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:52,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202831260] [2024-06-27 22:41:52,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:54,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:54,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202831260] [2024-06-27 22:41:54,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202831260] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:54,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:54,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:41:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885815003] [2024-06-27 22:41:54,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:54,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:41:54,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:54,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:41:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:41:54,218 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:41:54,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 844 transitions, 18806 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:54,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:54,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:41:54,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:56,353 INFO L124 PetriNetUnfolderBase]: 3257/5799 cut-off events. [2024-06-27 22:41:56,353 INFO L125 PetriNetUnfolderBase]: For 356039/356042 co-relation queries the response was YES. [2024-06-27 22:41:56,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54118 conditions, 5799 events. 3257/5799 cut-off events. For 356039/356042 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 42024 event pairs, 647 based on Foata normal form. 3/5576 useless extension candidates. Maximal degree in co-relation 53844. Up to 4675 conditions per place. [2024-06-27 22:41:56,476 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 772 selfloop transitions, 105 changer transitions 0/885 dead transitions. [2024-06-27 22:41:56,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 885 transitions, 21203 flow [2024-06-27 22:41:56,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:56,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 170 transitions. [2024-06-27 22:41:56,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176904176904177 [2024-06-27 22:41:56,478 INFO L175 Difference]: Start difference. First operand has 599 places, 844 transitions, 18806 flow. Second operand 11 states and 170 transitions. [2024-06-27 22:41:56,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 885 transitions, 21203 flow [2024-06-27 22:42:01,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 885 transitions, 20727 flow, removed 127 selfloop flow, removed 5 redundant places. [2024-06-27 22:42:01,032 INFO L231 Difference]: Finished difference. Result has 608 places, 852 transitions, 19038 flow [2024-06-27 22:42:01,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18330, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=844, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=740, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19038, PETRI_PLACES=608, PETRI_TRANSITIONS=852} [2024-06-27 22:42:01,032 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 567 predicate places. [2024-06-27 22:42:01,033 INFO L495 AbstractCegarLoop]: Abstraction has has 608 places, 852 transitions, 19038 flow [2024-06-27 22:42:01,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:01,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:01,033 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-27 22:42:01,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable145 [2024-06-27 22:42:01,033 INFO L420 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:01,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:01,034 INFO L85 PathProgramCache]: Analyzing trace with hash 644875681, now seen corresponding path program 2 times [2024-06-27 22:42:01,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292772197] [2024-06-27 22:42:01,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:01,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:01,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:02,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:02,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292772197] [2024-06-27 22:42:02,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292772197] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:02,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:02,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:42:02,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348321458] [2024-06-27 22:42:02,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:02,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:42:02,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:02,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:42:02,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:42:02,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:42:02,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 852 transitions, 19038 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:02,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:02,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:42:02,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:05,111 INFO L124 PetriNetUnfolderBase]: 3301/5882 cut-off events. [2024-06-27 22:42:05,111 INFO L125 PetriNetUnfolderBase]: For 383065/383068 co-relation queries the response was YES. [2024-06-27 22:42:05,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55880 conditions, 5882 events. 3301/5882 cut-off events. For 383065/383068 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 42714 event pairs, 763 based on Foata normal form. 3/5662 useless extension candidates. Maximal degree in co-relation 55601. Up to 3975 conditions per place. [2024-06-27 22:42:05,224 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 763 selfloop transitions, 125 changer transitions 0/896 dead transitions. [2024-06-27 22:42:05,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 896 transitions, 22034 flow [2024-06-27 22:42:05,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:42:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:42:05,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-27 22:42:05,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4348894348894349 [2024-06-27 22:42:05,225 INFO L175 Difference]: Start difference. First operand has 608 places, 852 transitions, 19038 flow. Second operand 11 states and 177 transitions. [2024-06-27 22:42:05,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 896 transitions, 22034 flow [2024-06-27 22:42:10,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 896 transitions, 21720 flow, removed 134 selfloop flow, removed 4 redundant places. [2024-06-27 22:42:10,070 INFO L231 Difference]: Finished difference. Result has 618 places, 860 transitions, 19555 flow [2024-06-27 22:42:10,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=18728, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=852, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=19555, PETRI_PLACES=618, PETRI_TRANSITIONS=860} [2024-06-27 22:42:10,071 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 577 predicate places. [2024-06-27 22:42:10,071 INFO L495 AbstractCegarLoop]: Abstraction has has 618 places, 860 transitions, 19555 flow [2024-06-27 22:42:10,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:10,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:10,071 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-27 22:42:10,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2024-06-27 22:42:10,071 INFO L420 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:10,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:10,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1896952313, now seen corresponding path program 3 times [2024-06-27 22:42:10,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:10,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515484067] [2024-06-27 22:42:10,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:10,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:11,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:11,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515484067] [2024-06-27 22:42:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515484067] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:11,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:11,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:42:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508936727] [2024-06-27 22:42:11,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:11,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:42:11,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:11,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:42:11,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:42:11,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:42:11,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 860 transitions, 19555 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:11,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:11,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:42:11,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:14,105 INFO L124 PetriNetUnfolderBase]: 3333/5941 cut-off events. [2024-06-27 22:42:14,105 INFO L125 PetriNetUnfolderBase]: For 394881/394884 co-relation queries the response was YES. [2024-06-27 22:42:14,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57059 conditions, 5941 events. 3333/5941 cut-off events. For 394881/394884 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 43343 event pairs, 850 based on Foata normal form. 3/5742 useless extension candidates. Maximal degree in co-relation 56775. Up to 4652 conditions per place. [2024-06-27 22:42:14,233 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 749 selfloop transitions, 143 changer transitions 0/900 dead transitions. [2024-06-27 22:42:14,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 900 transitions, 22399 flow [2024-06-27 22:42:14,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:42:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:42:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-27 22:42:14,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486486486486487 [2024-06-27 22:42:14,234 INFO L175 Difference]: Start difference. First operand has 618 places, 860 transitions, 19555 flow. Second operand 10 states and 166 transitions. [2024-06-27 22:42:14,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 900 transitions, 22399 flow [2024-06-27 22:42:19,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 900 transitions, 21965 flow, removed 160 selfloop flow, removed 5 redundant places. [2024-06-27 22:42:19,175 INFO L231 Difference]: Finished difference. Result has 625 places, 866 transitions, 19862 flow [2024-06-27 22:42:19,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19143, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=860, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19862, PETRI_PLACES=625, PETRI_TRANSITIONS=866} [2024-06-27 22:42:19,176 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 584 predicate places. [2024-06-27 22:42:19,176 INFO L495 AbstractCegarLoop]: Abstraction has has 625 places, 866 transitions, 19862 flow [2024-06-27 22:42:19,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:19,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:19,176 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-27 22:42:19,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable147 [2024-06-27 22:42:19,176 INFO L420 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:19,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1896779333, now seen corresponding path program 4 times [2024-06-27 22:42:19,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:19,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866180899] [2024-06-27 22:42:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:19,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:20,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:20,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866180899] [2024-06-27 22:42:20,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866180899] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:20,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:20,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:42:20,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779693856] [2024-06-27 22:42:20,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:20,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:42:20,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:20,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:42:20,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:42:20,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:42:20,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 866 transitions, 19862 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:20,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:20,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:42:20,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:23,345 INFO L124 PetriNetUnfolderBase]: 3402/6071 cut-off events. [2024-06-27 22:42:23,345 INFO L125 PetriNetUnfolderBase]: For 419472/419475 co-relation queries the response was YES. [2024-06-27 22:42:23,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58706 conditions, 6071 events. 3402/6071 cut-off events. For 419472/419475 co-relation queries the response was YES. Maximal size of possible extension queue 534. Compared 44556 event pairs, 963 based on Foata normal form. 3/5853 useless extension candidates. Maximal degree in co-relation 58419. Up to 5442 conditions per place. [2024-06-27 22:42:23,458 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 757 selfloop transitions, 142 changer transitions 0/907 dead transitions. [2024-06-27 22:42:23,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 907 transitions, 22455 flow [2024-06-27 22:42:23,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:42:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:42:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-06-27 22:42:23,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2024-06-27 22:42:23,459 INFO L175 Difference]: Start difference. First operand has 625 places, 866 transitions, 19862 flow. Second operand 10 states and 160 transitions. [2024-06-27 22:42:23,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 907 transitions, 22455 flow [2024-06-27 22:42:28,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 907 transitions, 22053 flow, removed 103 selfloop flow, removed 6 redundant places. [2024-06-27 22:42:28,644 INFO L231 Difference]: Finished difference. Result has 631 places, 880 transitions, 20265 flow [2024-06-27 22:42:28,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19462, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=866, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=20265, PETRI_PLACES=631, PETRI_TRANSITIONS=880} [2024-06-27 22:42:28,645 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 590 predicate places. [2024-06-27 22:42:28,645 INFO L495 AbstractCegarLoop]: Abstraction has has 631 places, 880 transitions, 20265 flow [2024-06-27 22:42:28,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:28,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:28,645 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-27 22:42:28,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2024-06-27 22:42:28,645 INFO L420 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:28,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1997562607, now seen corresponding path program 5 times [2024-06-27 22:42:28,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:28,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209340915] [2024-06-27 22:42:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:30,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:30,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:30,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209340915] [2024-06-27 22:42:30,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209340915] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:30,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:30,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:42:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493288052] [2024-06-27 22:42:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:30,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:42:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:30,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:42:30,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:42:30,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 37 [2024-06-27 22:42:30,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 880 transitions, 20265 flow. Second operand has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:30,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:30,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 37 [2024-06-27 22:42:30,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:32,785 INFO L124 PetriNetUnfolderBase]: 3399/6068 cut-off events. [2024-06-27 22:42:32,785 INFO L125 PetriNetUnfolderBase]: For 404902/404905 co-relation queries the response was YES. [2024-06-27 22:42:32,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58637 conditions, 6068 events. 3399/6068 cut-off events. For 404902/404905 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 44546 event pairs, 979 based on Foata normal form. 3/5843 useless extension candidates. Maximal degree in co-relation 58347. Up to 5616 conditions per place. [2024-06-27 22:42:32,916 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 759 selfloop transitions, 137 changer transitions 0/904 dead transitions. [2024-06-27 22:42:32,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 640 places, 904 transitions, 22163 flow [2024-06-27 22:42:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:42:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:42:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-27 22:42:32,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42162162162162165 [2024-06-27 22:42:32,917 INFO L175 Difference]: Start difference. First operand has 631 places, 880 transitions, 20265 flow. Second operand 10 states and 156 transitions. [2024-06-27 22:42:32,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 640 places, 904 transitions, 22163 flow [2024-06-27 22:42:38,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 904 transitions, 21895 flow, removed 112 selfloop flow, removed 3 redundant places. [2024-06-27 22:42:38,323 INFO L231 Difference]: Finished difference. Result has 638 places, 880 transitions, 20276 flow [2024-06-27 22:42:38,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19997, PETRI_DIFFERENCE_MINUEND_PLACES=628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=20276, PETRI_PLACES=638, PETRI_TRANSITIONS=880} [2024-06-27 22:42:38,324 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 597 predicate places. [2024-06-27 22:42:38,324 INFO L495 AbstractCegarLoop]: Abstraction has has 638 places, 880 transitions, 20276 flow [2024-06-27 22:42:38,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:38,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:38,324 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-27 22:42:38,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable149 [2024-06-27 22:42:38,324 INFO L420 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:38,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:38,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1603049527, now seen corresponding path program 6 times [2024-06-27 22:42:38,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:38,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409104544] [2024-06-27 22:42:38,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:38,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:39,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:39,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409104544] [2024-06-27 22:42:39,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409104544] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:39,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:39,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:42:39,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372656713] [2024-06-27 22:42:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:39,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:42:39,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:39,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:42:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:42:40,093 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:42:40,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 880 transitions, 20276 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:40,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:40,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:42:40,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:42,343 INFO L124 PetriNetUnfolderBase]: 2835/5211 cut-off events. [2024-06-27 22:42:42,343 INFO L125 PetriNetUnfolderBase]: For 400593/400637 co-relation queries the response was YES. [2024-06-27 22:42:42,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51819 conditions, 5211 events. 2835/5211 cut-off events. For 400593/400637 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 39068 event pairs, 817 based on Foata normal form. 31/4958 useless extension candidates. Maximal degree in co-relation 51527. Up to 4644 conditions per place. [2024-06-27 22:42:42,460 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 787 selfloop transitions, 102 changer transitions 0/906 dead transitions. [2024-06-27 22:42:42,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 906 transitions, 22874 flow [2024-06-27 22:42:42,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:42:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:42:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-06-27 22:42:42,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226044226044226 [2024-06-27 22:42:42,465 INFO L175 Difference]: Start difference. First operand has 638 places, 880 transitions, 20276 flow. Second operand 11 states and 172 transitions. [2024-06-27 22:42:42,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 906 transitions, 22874 flow [2024-06-27 22:42:47,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 906 transitions, 22597 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 22:42:47,436 INFO L231 Difference]: Finished difference. Result has 642 places, 885 transitions, 20516 flow [2024-06-27 22:42:47,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=19999, PETRI_DIFFERENCE_MINUEND_PLACES=630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=880, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=780, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20516, PETRI_PLACES=642, PETRI_TRANSITIONS=885} [2024-06-27 22:42:47,437 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 601 predicate places. [2024-06-27 22:42:47,437 INFO L495 AbstractCegarLoop]: Abstraction has has 642 places, 885 transitions, 20516 flow [2024-06-27 22:42:47,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:47,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:47,437 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-27 22:42:47,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2024-06-27 22:42:47,437 INFO L420 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:47,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:47,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1918930785, now seen corresponding path program 1 times [2024-06-27 22:42:47,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:47,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76676489] [2024-06-27 22:42:47,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:47,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:49,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:49,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76676489] [2024-06-27 22:42:49,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76676489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:49,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:49,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:42:49,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120551562] [2024-06-27 22:42:49,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:49,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:42:49,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:49,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:42:49,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:42:49,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:42:49,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 885 transitions, 20516 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:49,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:49,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:42:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:51,815 INFO L124 PetriNetUnfolderBase]: 2858/5246 cut-off events. [2024-06-27 22:42:51,815 INFO L125 PetriNetUnfolderBase]: For 400109/400153 co-relation queries the response was YES. [2024-06-27 22:42:51,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52364 conditions, 5246 events. 2858/5246 cut-off events. For 400109/400153 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 39272 event pairs, 824 based on Foata normal form. 36/4979 useless extension candidates. Maximal degree in co-relation 52069. Up to 4810 conditions per place. [2024-06-27 22:42:51,931 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 765 selfloop transitions, 126 changer transitions 0/908 dead transitions. [2024-06-27 22:42:51,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 908 transitions, 22478 flow [2024-06-27 22:42:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 22:42:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 22:42:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 209 transitions. [2024-06-27 22:42:51,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37657657657657656 [2024-06-27 22:42:51,932 INFO L175 Difference]: Start difference. First operand has 642 places, 885 transitions, 20516 flow. Second operand 15 states and 209 transitions. [2024-06-27 22:42:51,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 908 transitions, 22478 flow [2024-06-27 22:42:57,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 908 transitions, 22263 flow, removed 40 selfloop flow, removed 7 redundant places. [2024-06-27 22:42:57,380 INFO L231 Difference]: Finished difference. Result has 650 places, 889 transitions, 20675 flow [2024-06-27 22:42:57,381 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=20301, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=885, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=759, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=20675, PETRI_PLACES=650, PETRI_TRANSITIONS=889} [2024-06-27 22:42:57,381 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 609 predicate places. [2024-06-27 22:42:57,381 INFO L495 AbstractCegarLoop]: Abstraction has has 650 places, 889 transitions, 20675 flow [2024-06-27 22:42:57,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:57,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:57,381 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-27 22:42:57,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151 [2024-06-27 22:42:57,381 INFO L420 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:42:57,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:57,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1918923097, now seen corresponding path program 7 times [2024-06-27 22:42:57,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:57,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116243920] [2024-06-27 22:42:57,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:57,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:58,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:42:58,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:58,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116243920] [2024-06-27 22:42:58,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116243920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:58,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:58,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:42:58,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108949800] [2024-06-27 22:42:58,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:58,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:42:58,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:58,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:42:58,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:42:59,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:42:59,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 889 transitions, 20675 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:59,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:59,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:42:59,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:01,469 INFO L124 PetriNetUnfolderBase]: 2851/5237 cut-off events. [2024-06-27 22:43:01,469 INFO L125 PetriNetUnfolderBase]: For 388226/388262 co-relation queries the response was YES. [2024-06-27 22:43:01,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52135 conditions, 5237 events. 2851/5237 cut-off events. For 388226/388262 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 39175 event pairs, 834 based on Foata normal form. 24/4966 useless extension candidates. Maximal degree in co-relation 51838. Up to 4797 conditions per place. [2024-06-27 22:43:01,594 INFO L140 encePairwiseOnDemand]: 24/37 looper letters, 785 selfloop transitions, 105 changer transitions 0/907 dead transitions. [2024-06-27 22:43:01,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 907 transitions, 22685 flow [2024-06-27 22:43:01,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:43:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:43:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 167 transitions. [2024-06-27 22:43:01,595 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103194103194103 [2024-06-27 22:43:01,595 INFO L175 Difference]: Start difference. First operand has 650 places, 889 transitions, 20675 flow. Second operand 11 states and 167 transitions. [2024-06-27 22:43:01,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 907 transitions, 22685 flow [2024-06-27 22:43:07,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 907 transitions, 22015 flow, removed 204 selfloop flow, removed 12 redundant places. [2024-06-27 22:43:07,299 INFO L231 Difference]: Finished difference. Result has 649 places, 890 transitions, 20298 flow [2024-06-27 22:43:07,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=20039, PETRI_DIFFERENCE_MINUEND_PLACES=638, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=889, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20298, PETRI_PLACES=649, PETRI_TRANSITIONS=890} [2024-06-27 22:43:07,300 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 608 predicate places. [2024-06-27 22:43:07,300 INFO L495 AbstractCegarLoop]: Abstraction has has 649 places, 890 transitions, 20298 flow [2024-06-27 22:43:07,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:07,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:07,300 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-27 22:43:07,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2024-06-27 22:43:07,300 INFO L420 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:07,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:07,301 INFO L85 PathProgramCache]: Analyzing trace with hash -684771857, now seen corresponding path program 2 times [2024-06-27 22:43:07,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:07,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607007298] [2024-06-27 22:43:07,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607007298] [2024-06-27 22:43:09,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607007298] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:09,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:09,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:43:09,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645220086] [2024-06-27 22:43:09,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:09,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:43:09,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:09,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:43:09,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:43:09,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:43:09,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 890 transitions, 20298 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:09,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:09,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:43:09,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:11,273 INFO L124 PetriNetUnfolderBase]: 2855/5238 cut-off events. [2024-06-27 22:43:11,273 INFO L125 PetriNetUnfolderBase]: For 377860/377895 co-relation queries the response was YES. [2024-06-27 22:43:11,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51822 conditions, 5238 events. 2855/5238 cut-off events. For 377860/377895 co-relation queries the response was YES. Maximal size of possible extension queue 510. Compared 39179 event pairs, 830 based on Foata normal form. 24/4955 useless extension candidates. Maximal degree in co-relation 51524. Up to 4515 conditions per place. [2024-06-27 22:43:11,381 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 645 selfloop transitions, 242 changer transitions 0/904 dead transitions. [2024-06-27 22:43:11,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 904 transitions, 22220 flow [2024-06-27 22:43:11,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:43:11,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:43:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 156 transitions. [2024-06-27 22:43:11,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42162162162162165 [2024-06-27 22:43:11,382 INFO L175 Difference]: Start difference. First operand has 649 places, 890 transitions, 20298 flow. Second operand 10 states and 156 transitions. [2024-06-27 22:43:11,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 904 transitions, 22220 flow [2024-06-27 22:43:16,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 904 transitions, 22013 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:43:16,485 INFO L231 Difference]: Finished difference. Result has 650 places, 892 transitions, 20692 flow [2024-06-27 22:43:16,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=20091, PETRI_DIFFERENCE_MINUEND_PLACES=640, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=890, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=240, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=20692, PETRI_PLACES=650, PETRI_TRANSITIONS=892} [2024-06-27 22:43:16,485 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 609 predicate places. [2024-06-27 22:43:16,485 INFO L495 AbstractCegarLoop]: Abstraction has has 650 places, 892 transitions, 20692 flow [2024-06-27 22:43:16,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:16,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:16,486 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-27 22:43:16,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153 [2024-06-27 22:43:16,486 INFO L420 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:16,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash -682146329, now seen corresponding path program 8 times [2024-06-27 22:43:16,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:16,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504861963] [2024-06-27 22:43:16,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:18,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:18,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504861963] [2024-06-27 22:43:18,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504861963] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:18,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:18,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:43:18,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158596169] [2024-06-27 22:43:18,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:18,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:43:18,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:18,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:43:18,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:43:18,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:43:18,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 892 transitions, 20692 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:18,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:18,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:43:18,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:20,364 INFO L124 PetriNetUnfolderBase]: 2872/5269 cut-off events. [2024-06-27 22:43:20,365 INFO L125 PetriNetUnfolderBase]: For 398337/398372 co-relation queries the response was YES. [2024-06-27 22:43:20,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52587 conditions, 5269 events. 2872/5269 cut-off events. For 398337/398372 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 39430 event pairs, 829 based on Foata normal form. 25/4985 useless extension candidates. Maximal degree in co-relation 52288. Up to 4575 conditions per place. [2024-06-27 22:43:20,483 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 693 selfloop transitions, 201 changer transitions 0/911 dead transitions. [2024-06-27 22:43:20,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 911 transitions, 22750 flow [2024-06-27 22:43:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:43:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:43:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2024-06-27 22:43:20,484 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4201474201474201 [2024-06-27 22:43:20,484 INFO L175 Difference]: Start difference. First operand has 650 places, 892 transitions, 20692 flow. Second operand 11 states and 171 transitions. [2024-06-27 22:43:20,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 911 transitions, 22750 flow [2024-06-27 22:43:25,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 911 transitions, 22211 flow, removed 38 selfloop flow, removed 8 redundant places. [2024-06-27 22:43:25,673 INFO L231 Difference]: Finished difference. Result has 653 places, 894 transitions, 20666 flow [2024-06-27 22:43:25,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=20153, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20666, PETRI_PLACES=653, PETRI_TRANSITIONS=894} [2024-06-27 22:43:25,673 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 612 predicate places. [2024-06-27 22:43:25,673 INFO L495 AbstractCegarLoop]: Abstraction has has 653 places, 894 transitions, 20666 flow [2024-06-27 22:43:25,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:25,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:25,673 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-27 22:43:25,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2024-06-27 22:43:25,674 INFO L420 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:25,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:25,674 INFO L85 PathProgramCache]: Analyzing trace with hash -685009255, now seen corresponding path program 9 times [2024-06-27 22:43:25,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:25,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034913102] [2024-06-27 22:43:25,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:25,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:27,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:27,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034913102] [2024-06-27 22:43:27,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034913102] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:27,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:27,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:43:27,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146786274] [2024-06-27 22:43:27,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:27,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:43:27,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:27,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:43:27,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:43:28,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:43:28,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 894 transitions, 20666 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:28,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:28,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:43:28,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:30,473 INFO L124 PetriNetUnfolderBase]: 2974/5466 cut-off events. [2024-06-27 22:43:30,473 INFO L125 PetriNetUnfolderBase]: For 515220/515258 co-relation queries the response was YES. [2024-06-27 22:43:30,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56215 conditions, 5466 events. 2974/5466 cut-off events. For 515220/515258 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 41227 event pairs, 873 based on Foata normal form. 25/5179 useless extension candidates. Maximal degree in co-relation 55915. Up to 4344 conditions per place. [2024-06-27 22:43:30,586 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 695 selfloop transitions, 215 changer transitions 0/927 dead transitions. [2024-06-27 22:43:30,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 927 transitions, 23496 flow [2024-06-27 22:43:30,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:43:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:43:30,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 185 transitions. [2024-06-27 22:43:30,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-27 22:43:30,588 INFO L175 Difference]: Start difference. First operand has 653 places, 894 transitions, 20666 flow. Second operand 11 states and 185 transitions. [2024-06-27 22:43:30,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 927 transitions, 23496 flow [2024-06-27 22:43:37,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 927 transitions, 23033 flow, removed 32 selfloop flow, removed 9 redundant places. [2024-06-27 22:43:37,162 INFO L231 Difference]: Finished difference. Result has 656 places, 900 transitions, 20990 flow [2024-06-27 22:43:37,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=20203, PETRI_DIFFERENCE_MINUEND_PLACES=644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=894, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=211, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20990, PETRI_PLACES=656, PETRI_TRANSITIONS=900} [2024-06-27 22:43:37,163 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 615 predicate places. [2024-06-27 22:43:37,163 INFO L495 AbstractCegarLoop]: Abstraction has has 656 places, 900 transitions, 20990 flow [2024-06-27 22:43:37,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:37,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:37,163 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-27 22:43:37,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable155 [2024-06-27 22:43:37,163 INFO L420 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:37,163 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:37,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1671395737, now seen corresponding path program 10 times [2024-06-27 22:43:37,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:37,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173263989] [2024-06-27 22:43:37,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:37,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:38,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:38,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:38,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173263989] [2024-06-27 22:43:38,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173263989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:38,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:38,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:43:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865912446] [2024-06-27 22:43:38,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:38,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:43:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:38,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:43:38,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:43:38,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:43:38,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 900 transitions, 20990 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:38,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:38,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:43:38,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:41,140 INFO L124 PetriNetUnfolderBase]: 2988/5491 cut-off events. [2024-06-27 22:43:41,140 INFO L125 PetriNetUnfolderBase]: For 519035/519073 co-relation queries the response was YES. [2024-06-27 22:43:41,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56784 conditions, 5491 events. 2988/5491 cut-off events. For 519035/519073 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 41422 event pairs, 895 based on Foata normal form. 15/5192 useless extension candidates. Maximal degree in co-relation 56483. Up to 4793 conditions per place. [2024-06-27 22:43:41,264 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 747 selfloop transitions, 154 changer transitions 0/918 dead transitions. [2024-06-27 22:43:41,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 918 transitions, 23060 flow [2024-06-27 22:43:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:43:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:43:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 173 transitions. [2024-06-27 22:43:41,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4250614250614251 [2024-06-27 22:43:41,265 INFO L175 Difference]: Start difference. First operand has 656 places, 900 transitions, 20990 flow. Second operand 11 states and 173 transitions. [2024-06-27 22:43:41,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 918 transitions, 23060 flow [2024-06-27 22:43:47,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 918 transitions, 22641 flow, removed 57 selfloop flow, removed 7 redundant places. [2024-06-27 22:43:47,972 INFO L231 Difference]: Finished difference. Result has 660 places, 902 transitions, 20998 flow [2024-06-27 22:43:47,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=20571, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=900, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=746, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=20998, PETRI_PLACES=660, PETRI_TRANSITIONS=902} [2024-06-27 22:43:47,973 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 619 predicate places. [2024-06-27 22:43:47,973 INFO L495 AbstractCegarLoop]: Abstraction has has 660 places, 902 transitions, 20998 flow [2024-06-27 22:43:47,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:47,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:43:47,974 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-27 22:43:47,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable156 [2024-06-27 22:43:47,974 INFO L420 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:43:47,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:43:47,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1671158587, now seen corresponding path program 11 times [2024-06-27 22:43:47,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:43:47,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305416668] [2024-06-27 22:43:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:43:47,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:43:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:43:50,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:43:50,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:43:50,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305416668] [2024-06-27 22:43:50,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305416668] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:43:50,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:43:50,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:43:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492685863] [2024-06-27 22:43:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:43:50,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:43:50,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:43:50,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:43:50,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:43:50,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:43:50,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 902 transitions, 20998 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:43:50,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:43:50,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:43:50,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:43:52,981 INFO L124 PetriNetUnfolderBase]: 3157/5816 cut-off events. [2024-06-27 22:43:52,981 INFO L125 PetriNetUnfolderBase]: For 647851/647895 co-relation queries the response was YES. [2024-06-27 22:43:53,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61881 conditions, 5816 events. 3157/5816 cut-off events. For 647851/647895 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 44375 event pairs, 945 based on Foata normal form. 15/5500 useless extension candidates. Maximal degree in co-relation 61577. Up to 4741 conditions per place. [2024-06-27 22:43:53,120 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 761 selfloop transitions, 162 changer transitions 0/940 dead transitions. [2024-06-27 22:43:53,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 940 transitions, 24052 flow [2024-06-27 22:43:53,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:43:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:43:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 186 transitions. [2024-06-27 22:43:53,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.457002457002457 [2024-06-27 22:43:53,121 INFO L175 Difference]: Start difference. First operand has 660 places, 902 transitions, 20998 flow. Second operand 11 states and 186 transitions. [2024-06-27 22:43:53,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 940 transitions, 24052 flow [2024-06-27 22:44:00,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 940 transitions, 23675 flow, removed 36 selfloop flow, removed 9 redundant places. [2024-06-27 22:44:00,212 INFO L231 Difference]: Finished difference. Result has 664 places, 913 transitions, 21514 flow [2024-06-27 22:44:00,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=20621, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=152, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=741, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=21514, PETRI_PLACES=664, PETRI_TRANSITIONS=913} [2024-06-27 22:44:00,212 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 623 predicate places. [2024-06-27 22:44:00,212 INFO L495 AbstractCegarLoop]: Abstraction has has 664 places, 913 transitions, 21514 flow [2024-06-27 22:44:00,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:00,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:00,212 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-27 22:44:00,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable157 [2024-06-27 22:44:00,213 INFO L420 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:00,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:00,213 INFO L85 PathProgramCache]: Analyzing trace with hash -674102759, now seen corresponding path program 12 times [2024-06-27 22:44:00,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:00,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963782024] [2024-06-27 22:44:00,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:00,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963782024] [2024-06-27 22:44:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963782024] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:44:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244661310] [2024-06-27 22:44:01,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:01,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:44:01,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:01,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:44:01,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:44:02,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:44:02,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 913 transitions, 21514 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:02,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:02,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:44:02,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:04,764 INFO L124 PetriNetUnfolderBase]: 3155/5812 cut-off events. [2024-06-27 22:44:04,764 INFO L125 PetriNetUnfolderBase]: For 635580/635624 co-relation queries the response was YES. [2024-06-27 22:44:04,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61784 conditions, 5812 events. 3155/5812 cut-off events. For 635580/635624 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 44328 event pairs, 969 based on Foata normal form. 25/5502 useless extension candidates. Maximal degree in co-relation 61478. Up to 5098 conditions per place. [2024-06-27 22:44:04,880 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 678 selfloop transitions, 235 changer transitions 0/930 dead transitions. [2024-06-27 22:44:04,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 673 places, 930 transitions, 23577 flow [2024-06-27 22:44:04,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:44:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:44:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 161 transitions. [2024-06-27 22:44:04,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43513513513513513 [2024-06-27 22:44:04,882 INFO L175 Difference]: Start difference. First operand has 664 places, 913 transitions, 21514 flow. Second operand 10 states and 161 transitions. [2024-06-27 22:44:04,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 673 places, 930 transitions, 23577 flow [2024-06-27 22:44:11,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 930 transitions, 23265 flow, removed 63 selfloop flow, removed 6 redundant places. [2024-06-27 22:44:11,996 INFO L231 Difference]: Finished difference. Result has 668 places, 914 transitions, 21758 flow [2024-06-27 22:44:11,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21202, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=913, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=234, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=21758, PETRI_PLACES=668, PETRI_TRANSITIONS=914} [2024-06-27 22:44:11,996 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 627 predicate places. [2024-06-27 22:44:11,996 INFO L495 AbstractCegarLoop]: Abstraction has has 668 places, 914 transitions, 21758 flow [2024-06-27 22:44:11,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:11,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:11,997 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-27 22:44:11,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2024-06-27 22:44:11,997 INFO L420 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:11,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash -673805531, now seen corresponding path program 1 times [2024-06-27 22:44:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:11,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196410534] [2024-06-27 22:44:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:11,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:13,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:13,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:13,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196410534] [2024-06-27 22:44:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196410534] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:13,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:13,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:44:13,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079047323] [2024-06-27 22:44:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:13,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:44:13,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:13,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:44:13,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:44:13,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:44:13,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 914 transitions, 21758 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:13,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:13,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:44:13,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:16,314 INFO L124 PetriNetUnfolderBase]: 3165/5830 cut-off events. [2024-06-27 22:44:16,314 INFO L125 PetriNetUnfolderBase]: For 635554/635598 co-relation queries the response was YES. [2024-06-27 22:44:16,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62337 conditions, 5830 events. 3165/5830 cut-off events. For 635554/635598 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 44526 event pairs, 953 based on Foata normal form. 29/5526 useless extension candidates. Maximal degree in co-relation 62029. Up to 5240 conditions per place. [2024-06-27 22:44:16,446 INFO L140 encePairwiseOnDemand]: 23/37 looper letters, 721 selfloop transitions, 196 changer transitions 0/934 dead transitions. [2024-06-27 22:44:16,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 934 transitions, 23846 flow [2024-06-27 22:44:16,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:44:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:44:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 182 transitions. [2024-06-27 22:44:16,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4099099099099099 [2024-06-27 22:44:16,448 INFO L175 Difference]: Start difference. First operand has 668 places, 914 transitions, 21758 flow. Second operand 12 states and 182 transitions. [2024-06-27 22:44:16,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 934 transitions, 23846 flow [2024-06-27 22:44:24,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 934 transitions, 23327 flow, removed 26 selfloop flow, removed 8 redundant places. [2024-06-27 22:44:24,263 INFO L231 Difference]: Finished difference. Result has 673 places, 918 transitions, 21829 flow [2024-06-27 22:44:24,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21239, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=914, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=192, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=21829, PETRI_PLACES=673, PETRI_TRANSITIONS=918} [2024-06-27 22:44:24,263 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 632 predicate places. [2024-06-27 22:44:24,263 INFO L495 AbstractCegarLoop]: Abstraction has has 673 places, 918 transitions, 21829 flow [2024-06-27 22:44:24,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:24,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:24,264 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-27 22:44:24,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159 [2024-06-27 22:44:24,264 INFO L420 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:24,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1664729497, now seen corresponding path program 13 times [2024-06-27 22:44:24,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:24,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907927105] [2024-06-27 22:44:24,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:24,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:25,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:25,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907927105] [2024-06-27 22:44:25,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907927105] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:25,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:25,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:44:25,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604058858] [2024-06-27 22:44:25,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:25,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:44:25,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:25,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:44:25,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:44:26,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:44:26,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 673 places, 918 transitions, 21829 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:26,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:26,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:44:26,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:28,594 INFO L124 PetriNetUnfolderBase]: 3205/5904 cut-off events. [2024-06-27 22:44:28,595 INFO L125 PetriNetUnfolderBase]: For 652115/652159 co-relation queries the response was YES. [2024-06-27 22:44:28,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63344 conditions, 5904 events. 3205/5904 cut-off events. For 652115/652159 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 45151 event pairs, 953 based on Foata normal form. 15/5589 useless extension candidates. Maximal degree in co-relation 63033. Up to 4879 conditions per place. [2024-06-27 22:44:28,735 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 770 selfloop transitions, 162 changer transitions 0/949 dead transitions. [2024-06-27 22:44:28,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 949 transitions, 24429 flow [2024-06-27 22:44:28,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:44:28,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:44:28,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-06-27 22:44:28,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44471744471744473 [2024-06-27 22:44:28,737 INFO L175 Difference]: Start difference. First operand has 673 places, 918 transitions, 21829 flow. Second operand 11 states and 181 transitions. [2024-06-27 22:44:28,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 949 transitions, 24429 flow [2024-06-27 22:44:36,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 949 transitions, 23888 flow, removed 85 selfloop flow, removed 8 redundant places. [2024-06-27 22:44:36,737 INFO L231 Difference]: Finished difference. Result has 678 places, 925 transitions, 22082 flow [2024-06-27 22:44:36,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21290, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=918, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=757, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=22082, PETRI_PLACES=678, PETRI_TRANSITIONS=925} [2024-06-27 22:44:36,738 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 637 predicate places. [2024-06-27 22:44:36,738 INFO L495 AbstractCegarLoop]: Abstraction has has 678 places, 925 transitions, 22082 flow [2024-06-27 22:44:36,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:36,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:36,738 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-27 22:44:36,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2024-06-27 22:44:36,738 INFO L420 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:36,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash -676421077, now seen corresponding path program 2 times [2024-06-27 22:44:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:36,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044302014] [2024-06-27 22:44:36,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:38,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:38,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:38,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044302014] [2024-06-27 22:44:38,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044302014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:38,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:38,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-06-27 22:44:38,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468332898] [2024-06-27 22:44:38,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:38,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 22:44:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 22:44:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-27 22:44:38,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:44:38,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 925 transitions, 22082 flow. Second operand has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:38,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:38,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:44:38,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:41,459 INFO L124 PetriNetUnfolderBase]: 3275/6042 cut-off events. [2024-06-27 22:44:41,460 INFO L125 PetriNetUnfolderBase]: For 763496/763540 co-relation queries the response was YES. [2024-06-27 22:44:41,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66459 conditions, 6042 events. 3275/6042 cut-off events. For 763496/763540 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 46427 event pairs, 993 based on Foata normal form. 29/5732 useless extension candidates. Maximal degree in co-relation 66145. Up to 5006 conditions per place. [2024-06-27 22:44:41,581 INFO L140 encePairwiseOnDemand]: 22/37 looper letters, 737 selfloop transitions, 199 changer transitions 0/953 dead transitions. [2024-06-27 22:44:41,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 953 transitions, 24878 flow [2024-06-27 22:44:41,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:44:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:44:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 191 transitions. [2024-06-27 22:44:41,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43018018018018017 [2024-06-27 22:44:41,582 INFO L175 Difference]: Start difference. First operand has 678 places, 925 transitions, 22082 flow. Second operand 12 states and 191 transitions. [2024-06-27 22:44:41,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 953 transitions, 24878 flow [2024-06-27 22:44:50,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 953 transitions, 24376 flow, removed 163 selfloop flow, removed 6 redundant places. [2024-06-27 22:44:50,546 INFO L231 Difference]: Finished difference. Result has 684 places, 929 transitions, 22332 flow [2024-06-27 22:44:50,546 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21580, PETRI_DIFFERENCE_MINUEND_PLACES=672, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=22332, PETRI_PLACES=684, PETRI_TRANSITIONS=929} [2024-06-27 22:44:50,546 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 643 predicate places. [2024-06-27 22:44:50,546 INFO L495 AbstractCegarLoop]: Abstraction has has 684 places, 929 transitions, 22332 flow [2024-06-27 22:44:50,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.23076923076923) internal successors, (133), 13 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:50,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:44:50,547 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-27 22:44:50,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161 [2024-06-27 22:44:50,547 INFO L420 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:44:50,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:44:50,547 INFO L85 PathProgramCache]: Analyzing trace with hash -912910405, now seen corresponding path program 14 times [2024-06-27 22:44:50,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:44:50,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577413405] [2024-06-27 22:44:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:44:50,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:44:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:44:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:44:52,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:44:52,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577413405] [2024-06-27 22:44:52,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577413405] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:44:52,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:44:52,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:44:52,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198421155] [2024-06-27 22:44:52,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:44:52,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:44:52,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:44:52,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:44:52,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:44:52,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:44:52,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 929 transitions, 22332 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:44:52,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:44:52,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:44:52,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:44:54,929 INFO L124 PetriNetUnfolderBase]: 3312/6107 cut-off events. [2024-06-27 22:44:54,929 INFO L125 PetriNetUnfolderBase]: For 803436/803480 co-relation queries the response was YES. [2024-06-27 22:44:55,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68021 conditions, 6107 events. 3312/6107 cut-off events. For 803436/803480 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 47043 event pairs, 1029 based on Foata normal form. 25/5794 useless extension candidates. Maximal degree in co-relation 67705. Up to 5310 conditions per place. [2024-06-27 22:44:55,078 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 765 selfloop transitions, 175 changer transitions 0/957 dead transitions. [2024-06-27 22:44:55,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 957 transitions, 25168 flow [2024-06-27 22:44:55,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:44:55,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:44:55,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-06-27 22:44:55,079 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4348894348894349 [2024-06-27 22:44:55,079 INFO L175 Difference]: Start difference. First operand has 684 places, 929 transitions, 22332 flow. Second operand 11 states and 177 transitions. [2024-06-27 22:44:55,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 957 transitions, 25168 flow [2024-06-27 22:45:04,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 957 transitions, 24614 flow, removed 129 selfloop flow, removed 8 redundant places. [2024-06-27 22:45:04,165 INFO L231 Difference]: Finished difference. Result has 688 places, 934 transitions, 22497 flow [2024-06-27 22:45:04,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=21780, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=929, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=756, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=22497, PETRI_PLACES=688, PETRI_TRANSITIONS=934} [2024-06-27 22:45:04,165 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 647 predicate places. [2024-06-27 22:45:04,165 INFO L495 AbstractCegarLoop]: Abstraction has has 688 places, 934 transitions, 22497 flow [2024-06-27 22:45:04,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:04,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:04,166 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-27 22:45:04,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162 [2024-06-27 22:45:04,166 INFO L420 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:04,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:04,166 INFO L85 PathProgramCache]: Analyzing trace with hash -906417145, now seen corresponding path program 15 times [2024-06-27 22:45:04,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:04,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434875831] [2024-06-27 22:45:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:04,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:06,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:06,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:06,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434875831] [2024-06-27 22:45:06,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434875831] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:06,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:06,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:45:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318177938] [2024-06-27 22:45:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:06,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:45:06,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:06,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:45:06,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:45:06,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:45:06,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 934 transitions, 22497 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:06,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:06,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:45:06,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:08,744 INFO L124 PetriNetUnfolderBase]: 3309/6102 cut-off events. [2024-06-27 22:45:08,744 INFO L125 PetriNetUnfolderBase]: For 789956/790000 co-relation queries the response was YES. [2024-06-27 22:45:08,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67618 conditions, 6102 events. 3309/6102 cut-off events. For 789956/790000 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 47059 event pairs, 1036 based on Foata normal form. 25/5787 useless extension candidates. Maximal degree in co-relation 67299. Up to 5385 conditions per place. [2024-06-27 22:45:08,891 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 762 selfloop transitions, 173 changer transitions 0/952 dead transitions. [2024-06-27 22:45:08,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 952 transitions, 24642 flow [2024-06-27 22:45:08,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:45:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:45:08,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-06-27 22:45:08,893 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4226044226044226 [2024-06-27 22:45:08,893 INFO L175 Difference]: Start difference. First operand has 688 places, 934 transitions, 22497 flow. Second operand 11 states and 172 transitions. [2024-06-27 22:45:08,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 952 transitions, 24642 flow [2024-06-27 22:45:18,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 952 transitions, 24144 flow, removed 134 selfloop flow, removed 7 redundant places. [2024-06-27 22:45:18,396 INFO L231 Difference]: Finished difference. Result has 692 places, 935 transitions, 22453 flow [2024-06-27 22:45:18,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=22059, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=761, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=22453, PETRI_PLACES=692, PETRI_TRANSITIONS=935} [2024-06-27 22:45:18,397 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 651 predicate places. [2024-06-27 22:45:18,397 INFO L495 AbstractCegarLoop]: Abstraction has has 692 places, 935 transitions, 22453 flow [2024-06-27 22:45:18,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:18,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:18,397 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-27 22:45:18,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163 [2024-06-27 22:45:18,397 INFO L420 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:18,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1313715251, now seen corresponding path program 16 times [2024-06-27 22:45:18,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:18,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947936637] [2024-06-27 22:45:18,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:20,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:20,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947936637] [2024-06-27 22:45:20,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947936637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:20,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:20,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-06-27 22:45:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614243857] [2024-06-27 22:45:20,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:20,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 22:45:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:20,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 22:45:20,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-06-27 22:45:20,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:45:20,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 935 transitions, 22453 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:20,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:20,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:45:20,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:45:23,214 INFO L124 PetriNetUnfolderBase]: 3329/6138 cut-off events. [2024-06-27 22:45:23,214 INFO L125 PetriNetUnfolderBase]: For 799411/799455 co-relation queries the response was YES. [2024-06-27 22:45:23,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68183 conditions, 6138 events. 3329/6138 cut-off events. For 799411/799455 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 47359 event pairs, 1019 based on Foata normal form. 25/5828 useless extension candidates. Maximal degree in co-relation 67862. Up to 5101 conditions per place. [2024-06-27 22:45:23,343 INFO L140 encePairwiseOnDemand]: 25/37 looper letters, 763 selfloop transitions, 187 changer transitions 0/967 dead transitions. [2024-06-27 22:45:23,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 967 transitions, 25187 flow [2024-06-27 22:45:23,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:45:23,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:45:23,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 178 transitions. [2024-06-27 22:45:23,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43734643734643736 [2024-06-27 22:45:23,344 INFO L175 Difference]: Start difference. First operand has 692 places, 935 transitions, 22453 flow. Second operand 11 states and 178 transitions. [2024-06-27 22:45:23,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 967 transitions, 25187 flow [2024-06-27 22:45:32,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 967 transitions, 24836 flow, removed 4 selfloop flow, removed 9 redundant places. [2024-06-27 22:45:32,790 INFO L231 Difference]: Finished difference. Result has 696 places, 941 transitions, 23012 flow [2024-06-27 22:45:32,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=22104, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=749, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=23012, PETRI_PLACES=696, PETRI_TRANSITIONS=941} [2024-06-27 22:45:32,791 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 655 predicate places. [2024-06-27 22:45:32,791 INFO L495 AbstractCegarLoop]: Abstraction has has 696 places, 941 transitions, 23012 flow [2024-06-27 22:45:32,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:32,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:45:32,791 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-27 22:45:32,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2024-06-27 22:45:32,791 INFO L420 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-06-27 22:45:32,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:45:32,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1494027067, now seen corresponding path program 17 times [2024-06-27 22:45:32,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:45:32,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468064251] [2024-06-27 22:45:32,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:45:32,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:45:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:45:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:45:34,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:45:34,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468064251] [2024-06-27 22:45:34,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468064251] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:45:34,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:45:34,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-06-27 22:45:34,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044313132] [2024-06-27 22:45:34,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:45:34,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 22:45:34,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:45:34,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 22:45:34,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-06-27 22:45:34,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 37 [2024-06-27 22:45:34,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 941 transitions, 23012 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:45:34,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:45:34,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 37 [2024-06-27 22:45:34,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15