./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 12:19:44,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:19:44,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:19:44,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:19:44,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:19:44,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:19:44,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:19:44,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:19:44,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:19:44,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:19:44,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:19:44,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:19:44,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:19:44,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:19:44,662 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:19:44,662 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:19:44,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:19:44,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:19:44,663 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:19:44,663 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:19:44,663 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:19:44,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:19:44,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:19:44,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:19:44,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:19:44,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:19:44,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:19:44,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:19:44,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:19:44,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:19:44,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:19:44,667 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:19:44,667 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:19:44,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:19:44,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:19:44,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:19:44,668 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:19:44,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:19:44,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:19:44,668 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:19:44,668 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:19:44,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:19:44,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:19:44,669 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-05-12 12:19:44,873 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:19:44,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:19:44,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:19:44,895 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:19:44,896 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:19:44,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-05-12 12:19:45,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:19:45,114 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:19:45,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 12:19:46,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:19:46,405 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:19:46,410 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 12:19:46,423 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b04fee8a/f7a550697e0c471e9628c981ca9f96e2/FLAGd7f52d28f [2024-05-12 12:19:46,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b04fee8a/f7a550697e0c471e9628c981ca9f96e2 [2024-05-12 12:19:46,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:19:46,440 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:19:46,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:19:46,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:19:46,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:19:46,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:19:45" (1/2) ... [2024-05-12 12:19:46,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d9cb59 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:19:46, skipping insertion in model container [2024-05-12 12:19:46,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:19:45" (1/2) ... [2024-05-12 12:19:46,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f09ec60 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:19:46, skipping insertion in model container [2024-05-12 12:19:46,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:19:46" (2/2) ... [2024-05-12 12:19:46,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46d9cb59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:46, skipping insertion in model container [2024-05-12 12:19:46,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:19:46" (2/2) ... [2024-05-12 12:19:46,450 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:19:46,542 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:19:46,543 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 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) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-05-12 12:19:46,544 INFO L97 edCorrectnessWitness]: Location invariant before [L818-L818] ((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 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) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-05-12 12:19:46,544 INFO L97 edCorrectnessWitness]: Location invariant before [L819-L819] ((((((((((((((((! multithreaded || y$r_buff1_thd3 == (_Bool)0) && (! multithreaded || (0 <= __unbuffered_p2_EAX && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)))) && (! multithreaded || (((0 <= x && x <= 2) && x <= 127) && ((x == 0 || x == 1) || x == 2)))) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd2 >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) + (long long )y$read_delayed >= 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) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd3) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p2_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd2 >= 0LL) && (long long )x + (long long )y$r_buff0_thd3 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 0LL) && (long long )x + (long long )y$r_buff1_thd3 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd2 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd3 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )__unbuffered_p2_EAX) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (2LL + (long long )weak$$choice2) - (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff0_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff0_thd3) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd2 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$r_buff1_thd3 >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd3) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd3) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (4LL - (long long )y$w_buff0) - (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff0_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$r_buff1_thd3 >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd2 >= 0LL) && (long long )x - (long long )y$r_buff0_thd3 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 0LL) && (long long )x - (long long )y$r_buff1_thd3 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff0_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )y$r_buff1_thd2 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd3 - (long long )y$read_delayed >= 0LL) && (long long )y$w_buff0 - (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd3 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p2_EAX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && y <= 127) && y$mem_tmp <= 127) && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff0_thd3 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$r_buff1_thd3 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && y$w_buff0 % 2 == 0) && y$w_buff1 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1) || __unbuffered_p2_EAX == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 127) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((0 <= y$w_buff0 && y$w_buff0 <= 2) && y$w_buff0 <= 127) && y$w_buff0 % 2 == 0) && (y$w_buff0 == 0 || y$w_buff0 == 2)))) && (! multithreaded || ((0 <= y && y <= 127) && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((0 <= y$w_buff1 && y$w_buff1 <= 2) && y$w_buff1 <= 127) && y$w_buff1 % 2 == 0) && (y$w_buff1 == 0 || y$w_buff1 == 2))) [2024-05-12 12:19:46,545 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:19:46,545 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-05-12 12:19:46,582 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:19:46,727 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-05-12 12:19:46,907 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:19:46,921 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:19:46,953 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:19:47,198 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:19:47,234 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:19:47,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47 WrapperNode [2024-05-12 12:19:47,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:19:47,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:19:47,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:19:47,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:19:47,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,272 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,410 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2024-05-12 12:19:47,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:19:47,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:19:47,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:19:47,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:19:47,421 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,526 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2024-05-12 12:19:47,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:19:47,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:19:47,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:19:47,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:19:47,588 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (1/1) ... [2024-05-12 12:19:47,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:19:47,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:19:47,612 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-05-12 12:19:47,660 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-05-12 12:19:47,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:19:47,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:19:47,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:19:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-05-12 12:19:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:19:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:19:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:19:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:19:47,723 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 12:19:47,723 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 12:19:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 12:19:47,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 12:19:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-05-12 12:19:47,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-05-12 12:19:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:19:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:19:47,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:19:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-05-12 12:19:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:19:47,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:19:47,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:19:47,726 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 12:19:47,828 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:19:47,829 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:19:48,717 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:19:48,717 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:19:48,964 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:19:48,964 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:19:48,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:19:48 BoogieIcfgContainer [2024-05-12 12:19:48,965 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:19:48,967 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:19:48,967 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:19:48,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:19:48,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:19:45" (1/4) ... [2024-05-12 12:19:48,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294d933d and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:19:48, skipping insertion in model container [2024-05-12 12:19:48,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:19:46" (2/4) ... [2024-05-12 12:19:48,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294d933d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:19:48, skipping insertion in model container [2024-05-12 12:19:48,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:19:47" (3/4) ... [2024-05-12 12:19:48,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@294d933d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:19:48, skipping insertion in model container [2024-05-12 12:19:48,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:19:48" (4/4) ... [2024-05-12 12:19:48,973 INFO L112 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 12:19:48,985 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:19:48,985 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-05-12 12:19:48,985 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:19:49,060 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 12:19:49,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 46 transitions, 104 flow [2024-05-12 12:19:49,128 INFO L124 PetriNetUnfolderBase]: 1/43 cut-off events. [2024-05-12 12:19:49,128 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:19:49,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 43 events. 1/43 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2024-05-12 12:19:49,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 46 transitions, 104 flow [2024-05-12 12:19:49,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 43 transitions, 95 flow [2024-05-12 12:19:49,146 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:19:49,154 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;@f92b2ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:19:49,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-05-12 12:19:49,161 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:19:49,161 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:19:49,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:19:49,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:19:49,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:19:49,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:19:49,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:19:49,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1800140498, now seen corresponding path program 1 times [2024-05-12 12:19:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:19:49,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039808432] [2024-05-12 12:19:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:19:49,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:19:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:19:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:19:53,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:19:53,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039808432] [2024-05-12 12:19:53,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039808432] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:19:53,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:19:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:19:53,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515610106] [2024-05-12 12:19:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:19:53,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:19:53,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:19:53,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:19:53,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:19:53,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-05-12 12:19:53,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:53,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:19:53,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-05-12 12:19:53,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:19:54,170 INFO L124 PetriNetUnfolderBase]: 3513/5090 cut-off events. [2024-05-12 12:19:54,171 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-05-12 12:19:54,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10262 conditions, 5090 events. 3513/5090 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 27184 event pairs, 1901 based on Foata normal form. 176/4997 useless extension candidates. Maximal degree in co-relation 10247. Up to 5066 conditions per place. [2024-05-12 12:19:54,199 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 44 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2024-05-12 12:19:54,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 229 flow [2024-05-12 12:19:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:19:54,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:19:54,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-05-12 12:19:54,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-05-12 12:19:54,209 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 90 transitions. [2024-05-12 12:19:54,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 229 flow [2024-05-12 12:19:54,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-05-12 12:19:54,213 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 127 flow [2024-05-12 12:19:54,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2024-05-12 12:19:54,217 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-05-12 12:19:54,217 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 127 flow [2024-05-12 12:19:54,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:54,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:19:54,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:19:54,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:19:54,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:19:54,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:19:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1800139254, now seen corresponding path program 1 times [2024-05-12 12:19:54,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:19:54,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664470528] [2024-05-12 12:19:54,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:19:54,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:19:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:19:54,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:19:54,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:19:54,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664470528] [2024-05-12 12:19:54,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664470528] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:19:54,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:19:54,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:19:54,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826323116] [2024-05-12 12:19:54,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:19:54,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:19:54,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:19:54,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:19:54,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:19:54,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-05-12 12:19:54,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:54,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:19:54,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-05-12 12:19:54,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:19:54,651 INFO L124 PetriNetUnfolderBase]: 891/1707 cut-off events. [2024-05-12 12:19:54,652 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2024-05-12 12:19:54,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3314 conditions, 1707 events. 891/1707 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11373 event pairs, 577 based on Foata normal form. 0/1567 useless extension candidates. Maximal degree in co-relation 3299. Up to 1152 conditions per place. [2024-05-12 12:19:54,663 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 37 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2024-05-12 12:19:54,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 60 transitions, 234 flow [2024-05-12 12:19:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:19:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:19:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-05-12 12:19:54,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7463768115942029 [2024-05-12 12:19:54,668 INFO L175 Difference]: Start difference. First operand has 52 places, 46 transitions, 127 flow. Second operand 3 states and 103 transitions. [2024-05-12 12:19:54,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 60 transitions, 234 flow [2024-05-12 12:19:54,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 60 transitions, 230 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:19:54,671 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 120 flow [2024-05-12 12:19:54,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2024-05-12 12:19:54,676 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2024-05-12 12:19:54,676 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 120 flow [2024-05-12 12:19:54,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:54,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:19:54,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:19:54,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:19:54,677 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:19:54,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:19:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 936815724, now seen corresponding path program 1 times [2024-05-12 12:19:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:19:54,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824373795] [2024-05-12 12:19:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:19:54,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:19:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:19:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:19:57,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:19:57,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824373795] [2024-05-12 12:19:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824373795] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:19:57,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:19:57,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:19:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321363556] [2024-05-12 12:19:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:19:57,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:19:57,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:19:57,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:19:57,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:19:57,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 46 [2024-05-12 12:19:57,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:57,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:19:57,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 46 [2024-05-12 12:19:57,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:19:58,698 INFO L124 PetriNetUnfolderBase]: 2986/4790 cut-off events. [2024-05-12 12:19:58,699 INFO L125 PetriNetUnfolderBase]: For 1176/1184 co-relation queries the response was YES. [2024-05-12 12:19:58,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10329 conditions, 4790 events. 2986/4790 cut-off events. For 1176/1184 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 28014 event pairs, 2217 based on Foata normal form. 6/4642 useless extension candidates. Maximal degree in co-relation 10313. Up to 4299 conditions per place. [2024-05-12 12:19:58,722 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 52 selfloop transitions, 8 changer transitions 2/71 dead transitions. [2024-05-12 12:19:58,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 318 flow [2024-05-12 12:19:58,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:19:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:19:58,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 110 transitions. [2024-05-12 12:19:58,727 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5978260869565217 [2024-05-12 12:19:58,727 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 120 flow. Second operand 4 states and 110 transitions. [2024-05-12 12:19:58,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 318 flow [2024-05-12 12:19:58,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:19:58,730 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 181 flow [2024-05-12 12:19:58,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-05-12 12:19:58,732 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2024-05-12 12:19:58,732 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 181 flow [2024-05-12 12:19:58,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:19:58,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:19:58,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:19:58,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:19:58,733 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:19:58,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:19:58,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1023483099, now seen corresponding path program 1 times [2024-05-12 12:19:58,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:19:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618801898] [2024-05-12 12:19:58,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:19:58,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:19:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:01,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618801898] [2024-05-12 12:20:01,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618801898] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:01,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:01,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:20:01,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669206913] [2024-05-12 12:20:01,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:01,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:20:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:01,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:20:01,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:20:01,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-05-12 12:20:01,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:01,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:01,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-05-12 12:20:01,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:02,453 INFO L124 PetriNetUnfolderBase]: 3269/5290 cut-off events. [2024-05-12 12:20:02,453 INFO L125 PetriNetUnfolderBase]: For 2154/2154 co-relation queries the response was YES. [2024-05-12 12:20:02,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12245 conditions, 5290 events. 3269/5290 cut-off events. For 2154/2154 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 31868 event pairs, 1578 based on Foata normal form. 7/5107 useless extension candidates. Maximal degree in co-relation 12227. Up to 4520 conditions per place. [2024-05-12 12:20:02,483 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 79 selfloop transitions, 16 changer transitions 0/103 dead transitions. [2024-05-12 12:20:02,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 103 transitions, 541 flow [2024-05-12 12:20:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:20:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:20:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-05-12 12:20:02,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2024-05-12 12:20:02,485 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 181 flow. Second operand 5 states and 140 transitions. [2024-05-12 12:20:02,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 103 transitions, 541 flow [2024-05-12 12:20:02,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 103 transitions, 524 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-05-12 12:20:02,491 INFO L231 Difference]: Finished difference. Result has 60 places, 65 transitions, 301 flow [2024-05-12 12:20:02,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=60, PETRI_TRANSITIONS=65} [2024-05-12 12:20:02,493 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 8 predicate places. [2024-05-12 12:20:02,493 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 65 transitions, 301 flow [2024-05-12 12:20:02,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:02,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:02,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:02,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:20:02,494 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:20:02,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1663204437, now seen corresponding path program 1 times [2024-05-12 12:20:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:02,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094113895] [2024-05-12 12:20:02,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:02,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:05,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094113895] [2024-05-12 12:20:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094113895] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:05,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:20:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270007751] [2024-05-12 12:20:05,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:05,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:20:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:05,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:20:05,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:20:05,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-05-12 12:20:05,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 65 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-05-12 12:20:05,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:05,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-05-12 12:20:05,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:06,629 INFO L124 PetriNetUnfolderBase]: 3323/5366 cut-off events. [2024-05-12 12:20:06,632 INFO L125 PetriNetUnfolderBase]: For 5433/5435 co-relation queries the response was YES. [2024-05-12 12:20:06,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14820 conditions, 5366 events. 3323/5366 cut-off events. For 5433/5435 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 31963 event pairs, 1600 based on Foata normal form. 9/5185 useless extension candidates. Maximal degree in co-relation 14798. Up to 4527 conditions per place. [2024-05-12 12:20:06,674 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 90 selfloop transitions, 21 changer transitions 0/119 dead transitions. [2024-05-12 12:20:06,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 119 transitions, 705 flow [2024-05-12 12:20:06,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:20:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:20:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 167 transitions. [2024-05-12 12:20:06,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.605072463768116 [2024-05-12 12:20:06,694 INFO L175 Difference]: Start difference. First operand has 60 places, 65 transitions, 301 flow. Second operand 6 states and 167 transitions. [2024-05-12 12:20:06,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 119 transitions, 705 flow [2024-05-12 12:20:06,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 701 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-05-12 12:20:06,703 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 381 flow [2024-05-12 12:20:06,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=381, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2024-05-12 12:20:06,705 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2024-05-12 12:20:06,705 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 381 flow [2024-05-12 12:20:06,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 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-05-12 12:20:06,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:06,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:06,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:20:06,706 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:20:06,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash -19729404, now seen corresponding path program 1 times [2024-05-12 12:20:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:06,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402798124] [2024-05-12 12:20:06,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:06,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402798124] [2024-05-12 12:20:09,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402798124] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:09,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:09,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:20:09,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175572105] [2024-05-12 12:20:09,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:09,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:20:09,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:09,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:20:09,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:20:10,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 46 [2024-05-12 12:20:10,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 381 flow. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:10,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:10,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 46 [2024-05-12 12:20:10,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:11,246 INFO L124 PetriNetUnfolderBase]: 3491/5638 cut-off events. [2024-05-12 12:20:11,247 INFO L125 PetriNetUnfolderBase]: For 8133/8135 co-relation queries the response was YES. [2024-05-12 12:20:11,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17256 conditions, 5638 events. 3491/5638 cut-off events. For 8133/8135 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 34051 event pairs, 943 based on Foata normal form. 28/5474 useless extension candidates. Maximal degree in co-relation 17231. Up to 4491 conditions per place. [2024-05-12 12:20:11,280 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 117 selfloop transitions, 41 changer transitions 0/166 dead transitions. [2024-05-12 12:20:11,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 166 transitions, 1164 flow [2024-05-12 12:20:11,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:20:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:20:11,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 194 transitions. [2024-05-12 12:20:11,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6024844720496895 [2024-05-12 12:20:11,282 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 381 flow. Second operand 7 states and 194 transitions. [2024-05-12 12:20:11,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 166 transitions, 1164 flow [2024-05-12 12:20:11,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 166 transitions, 1087 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-05-12 12:20:11,291 INFO L231 Difference]: Finished difference. Result has 72 places, 107 transitions, 739 flow [2024-05-12 12:20:11,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=739, PETRI_PLACES=72, PETRI_TRANSITIONS=107} [2024-05-12 12:20:11,294 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2024-05-12 12:20:11,294 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 107 transitions, 739 flow [2024-05-12 12:20:11,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:11,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:11,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:11,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:20:11,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:20:11,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:11,295 INFO L85 PathProgramCache]: Analyzing trace with hash -59319322, now seen corresponding path program 1 times [2024-05-12 12:20:11,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:11,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779096885] [2024-05-12 12:20:11,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779096885] [2024-05-12 12:20:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779096885] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:17,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:17,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:20:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774529846] [2024-05-12 12:20:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:17,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:20:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:20:17,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:20:17,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:20:17,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 107 transitions, 739 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:17,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:17,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:20:17,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:19,295 INFO L124 PetriNetUnfolderBase]: 4009/6364 cut-off events. [2024-05-12 12:20:19,295 INFO L125 PetriNetUnfolderBase]: For 15306/15306 co-relation queries the response was YES. [2024-05-12 12:20:19,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22350 conditions, 6364 events. 4009/6364 cut-off events. For 15306/15306 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 37505 event pairs, 1593 based on Foata normal form. 6/6178 useless extension candidates. Maximal degree in co-relation 22320. Up to 5697 conditions per place. [2024-05-12 12:20:19,339 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 110 selfloop transitions, 19 changer transitions 0/136 dead transitions. [2024-05-12 12:20:19,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 136 transitions, 1121 flow [2024-05-12 12:20:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:20:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:20:19,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2024-05-12 12:20:19,340 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2024-05-12 12:20:19,341 INFO L175 Difference]: Start difference. First operand has 72 places, 107 transitions, 739 flow. Second operand 5 states and 114 transitions. [2024-05-12 12:20:19,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 136 transitions, 1121 flow [2024-05-12 12:20:19,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 136 transitions, 1091 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-05-12 12:20:19,356 INFO L231 Difference]: Finished difference. Result has 77 places, 113 transitions, 823 flow [2024-05-12 12:20:19,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=823, PETRI_PLACES=77, PETRI_TRANSITIONS=113} [2024-05-12 12:20:19,357 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 25 predicate places. [2024-05-12 12:20:19,358 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 113 transitions, 823 flow [2024-05-12 12:20:19,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:19,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:19,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:19,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:20:19,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:20:19,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:19,359 INFO L85 PathProgramCache]: Analyzing trace with hash -839955890, now seen corresponding path program 1 times [2024-05-12 12:20:19,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:19,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293920022] [2024-05-12 12:20:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:19,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:24,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:24,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293920022] [2024-05-12 12:20:24,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293920022] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:24,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:24,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:20:24,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082275179] [2024-05-12 12:20:24,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:24,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:20:24,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:24,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:20:24,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:20:24,882 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:20:24,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 113 transitions, 823 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-05-12 12:20:24,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:24,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:20:24,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:26,454 INFO L124 PetriNetUnfolderBase]: 4270/6748 cut-off events. [2024-05-12 12:20:26,454 INFO L125 PetriNetUnfolderBase]: For 19292/19292 co-relation queries the response was YES. [2024-05-12 12:20:26,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25031 conditions, 6748 events. 4270/6748 cut-off events. For 19292/19292 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 40080 event pairs, 1269 based on Foata normal form. 12/6558 useless extension candidates. Maximal degree in co-relation 24997. Up to 5710 conditions per place. [2024-05-12 12:20:26,507 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 125 selfloop transitions, 46 changer transitions 0/178 dead transitions. [2024-05-12 12:20:26,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 178 transitions, 1498 flow [2024-05-12 12:20:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:20:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:20:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-05-12 12:20:26,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5124223602484472 [2024-05-12 12:20:26,509 INFO L175 Difference]: Start difference. First operand has 77 places, 113 transitions, 823 flow. Second operand 7 states and 165 transitions. [2024-05-12 12:20:26,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 178 transitions, 1498 flow [2024-05-12 12:20:26,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 178 transitions, 1453 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-05-12 12:20:26,528 INFO L231 Difference]: Finished difference. Result has 83 places, 133 transitions, 1108 flow [2024-05-12 12:20:26,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1108, PETRI_PLACES=83, PETRI_TRANSITIONS=133} [2024-05-12 12:20:26,530 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2024-05-12 12:20:26,531 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 133 transitions, 1108 flow [2024-05-12 12:20:26,531 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-05-12 12:20:26,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:26,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:26,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:20:26,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:20:26,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:26,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1216826210, now seen corresponding path program 2 times [2024-05-12 12:20:26,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:26,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137556460] [2024-05-12 12:20:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:26,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:32,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-05-12 12:20:32,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:32,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137556460] [2024-05-12 12:20:32,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137556460] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:32,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:32,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:20:32,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632438689] [2024-05-12 12:20:32,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:32,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:20:32,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:32,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:20:32,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:20:32,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:20:32,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 133 transitions, 1108 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-05-12 12:20:32,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:32,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:20:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:33,635 INFO L124 PetriNetUnfolderBase]: 4244/6714 cut-off events. [2024-05-12 12:20:33,636 INFO L125 PetriNetUnfolderBase]: For 27044/27044 co-relation queries the response was YES. [2024-05-12 12:20:33,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27565 conditions, 6714 events. 4244/6714 cut-off events. For 27044/27044 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 39664 event pairs, 1559 based on Foata normal form. 4/6513 useless extension candidates. Maximal degree in co-relation 27528. Up to 6041 conditions per place. [2024-05-12 12:20:33,673 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 138 selfloop transitions, 16 changer transitions 0/161 dead transitions. [2024-05-12 12:20:33,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 161 transitions, 1521 flow [2024-05-12 12:20:33,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:20:33,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:20:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2024-05-12 12:20:33,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47101449275362317 [2024-05-12 12:20:33,675 INFO L175 Difference]: Start difference. First operand has 83 places, 133 transitions, 1108 flow. Second operand 6 states and 130 transitions. [2024-05-12 12:20:33,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 161 transitions, 1521 flow [2024-05-12 12:20:33,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 161 transitions, 1493 flow, removed 9 selfloop flow, removed 2 redundant places. [2024-05-12 12:20:33,693 INFO L231 Difference]: Finished difference. Result has 88 places, 136 transitions, 1166 flow [2024-05-12 12:20:33,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1166, PETRI_PLACES=88, PETRI_TRANSITIONS=136} [2024-05-12 12:20:33,694 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2024-05-12 12:20:33,694 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 136 transitions, 1166 flow [2024-05-12 12:20:33,694 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-05-12 12:20:33,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:33,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:33,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:20:33,695 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:20:33,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:33,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1692868483, now seen corresponding path program 1 times [2024-05-12 12:20:33,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:33,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112351355] [2024-05-12 12:20:33,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:33,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:39,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:39,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:39,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112351355] [2024-05-12 12:20:39,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112351355] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:39,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:39,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:20:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526650556] [2024-05-12 12:20:39,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:39,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:20:39,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:20:39,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:20:39,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:20:39,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 136 transitions, 1166 flow. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:39,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:39,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:20:39,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:41,504 INFO L124 PetriNetUnfolderBase]: 4269/6747 cut-off events. [2024-05-12 12:20:41,504 INFO L125 PetriNetUnfolderBase]: For 28672/28672 co-relation queries the response was YES. [2024-05-12 12:20:41,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27912 conditions, 6747 events. 4269/6747 cut-off events. For 28672/28672 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 39908 event pairs, 1511 based on Foata normal form. 6/6549 useless extension candidates. Maximal degree in co-relation 27872. Up to 5980 conditions per place. [2024-05-12 12:20:41,563 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 140 selfloop transitions, 25 changer transitions 0/172 dead transitions. [2024-05-12 12:20:41,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 172 transitions, 1639 flow [2024-05-12 12:20:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:20:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:20:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-05-12 12:20:41,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2024-05-12 12:20:41,565 INFO L175 Difference]: Start difference. First operand has 88 places, 136 transitions, 1166 flow. Second operand 6 states and 137 transitions. [2024-05-12 12:20:41,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 172 transitions, 1639 flow [2024-05-12 12:20:41,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 172 transitions, 1606 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 12:20:41,594 INFO L231 Difference]: Finished difference. Result has 91 places, 139 transitions, 1228 flow [2024-05-12 12:20:41,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1228, PETRI_PLACES=91, PETRI_TRANSITIONS=139} [2024-05-12 12:20:41,594 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 39 predicate places. [2024-05-12 12:20:41,594 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 139 transitions, 1228 flow [2024-05-12 12:20:41,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:41,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:41,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:41,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:20:41,595 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:20:41,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:41,595 INFO L85 PathProgramCache]: Analyzing trace with hash 939307359, now seen corresponding path program 1 times [2024-05-12 12:20:41,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:41,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4506526] [2024-05-12 12:20:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:41,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:46,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:46,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:46,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4506526] [2024-05-12 12:20:46,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4506526] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:46,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:46,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:20:46,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684492723] [2024-05-12 12:20:46,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:46,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:20:46,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:46,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:20:46,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:20:47,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:20:47,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 139 transitions, 1228 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-05-12 12:20:47,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:47,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:20:47,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:48,572 INFO L124 PetriNetUnfolderBase]: 4272/6762 cut-off events. [2024-05-12 12:20:48,572 INFO L125 PetriNetUnfolderBase]: For 32043/32043 co-relation queries the response was YES. [2024-05-12 12:20:48,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28823 conditions, 6762 events. 4272/6762 cut-off events. For 32043/32043 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 39995 event pairs, 1563 based on Foata normal form. 2/6556 useless extension candidates. Maximal degree in co-relation 28782. Up to 6051 conditions per place. [2024-05-12 12:20:48,612 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 142 selfloop transitions, 25 changer transitions 0/174 dead transitions. [2024-05-12 12:20:48,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 174 transitions, 1740 flow [2024-05-12 12:20:48,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:20:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:20:48,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-05-12 12:20:48,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746376811594203 [2024-05-12 12:20:48,615 INFO L175 Difference]: Start difference. First operand has 91 places, 139 transitions, 1228 flow. Second operand 6 states and 131 transitions. [2024-05-12 12:20:48,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 174 transitions, 1740 flow [2024-05-12 12:20:48,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 174 transitions, 1654 flow, removed 18 selfloop flow, removed 4 redundant places. [2024-05-12 12:20:48,641 INFO L231 Difference]: Finished difference. Result has 94 places, 149 transitions, 1345 flow [2024-05-12 12:20:48,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1153, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1345, PETRI_PLACES=94, PETRI_TRANSITIONS=149} [2024-05-12 12:20:48,642 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 42 predicate places. [2024-05-12 12:20:48,642 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 149 transitions, 1345 flow [2024-05-12 12:20:48,643 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-05-12 12:20:48,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:48,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:48,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:20:48,643 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:20:48,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:48,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1253975553, now seen corresponding path program 1 times [2024-05-12 12:20:48,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:48,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287895542] [2024-05-12 12:20:48,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:48,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:54,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:54,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287895542] [2024-05-12 12:20:54,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287895542] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:54,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:54,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:20:54,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12049607] [2024-05-12 12:20:54,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:54,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:20:54,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:54,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:20:54,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:20:54,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:20:54,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 149 transitions, 1345 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:54,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:54,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:20:54,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:56,682 INFO L124 PetriNetUnfolderBase]: 4453/7010 cut-off events. [2024-05-12 12:20:56,682 INFO L125 PetriNetUnfolderBase]: For 38176/38176 co-relation queries the response was YES. [2024-05-12 12:20:56,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31050 conditions, 7010 events. 4453/7010 cut-off events. For 38176/38176 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 41676 event pairs, 1208 based on Foata normal form. 6/6808 useless extension candidates. Maximal degree in co-relation 31007. Up to 5716 conditions per place. [2024-05-12 12:20:56,722 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 147 selfloop transitions, 62 changer transitions 0/216 dead transitions. [2024-05-12 12:20:56,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 216 transitions, 2137 flow [2024-05-12 12:20:56,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:20:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:20:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 193 transitions. [2024-05-12 12:20:56,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5244565217391305 [2024-05-12 12:20:56,724 INFO L175 Difference]: Start difference. First operand has 94 places, 149 transitions, 1345 flow. Second operand 8 states and 193 transitions. [2024-05-12 12:20:56,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 216 transitions, 2137 flow [2024-05-12 12:20:56,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 216 transitions, 2091 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 12:20:56,754 INFO L231 Difference]: Finished difference. Result has 100 places, 160 transitions, 1588 flow [2024-05-12 12:20:56,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1588, PETRI_PLACES=100, PETRI_TRANSITIONS=160} [2024-05-12 12:20:56,755 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 48 predicate places. [2024-05-12 12:20:56,755 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 160 transitions, 1588 flow [2024-05-12 12:20:56,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:56,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:56,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:56,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:20:56,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:20:56,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:56,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1254065763, now seen corresponding path program 2 times [2024-05-12 12:20:56,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:56,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495063547] [2024-05-12 12:20:56,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:56,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:02,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-05-12 12:21:02,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:02,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495063547] [2024-05-12 12:21:02,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495063547] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:02,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:02,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:02,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17457018] [2024-05-12 12:21:02,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:02,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:02,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:02,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:02,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:02,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:21:02,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 160 transitions, 1588 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:02,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:02,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:21:02,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:04,350 INFO L124 PetriNetUnfolderBase]: 5055/7805 cut-off events. [2024-05-12 12:21:04,351 INFO L125 PetriNetUnfolderBase]: For 53572/53572 co-relation queries the response was YES. [2024-05-12 12:21:04,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37752 conditions, 7805 events. 5055/7805 cut-off events. For 53572/53572 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 45811 event pairs, 1244 based on Foata normal form. 10/7609 useless extension candidates. Maximal degree in co-relation 37707. Up to 6119 conditions per place. [2024-05-12 12:21:04,411 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 177 selfloop transitions, 85 changer transitions 0/269 dead transitions. [2024-05-12 12:21:04,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 269 transitions, 2976 flow [2024-05-12 12:21:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:21:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:21:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 202 transitions. [2024-05-12 12:21:04,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5489130434782609 [2024-05-12 12:21:04,413 INFO L175 Difference]: Start difference. First operand has 100 places, 160 transitions, 1588 flow. Second operand 8 states and 202 transitions. [2024-05-12 12:21:04,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 269 transitions, 2976 flow [2024-05-12 12:21:04,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 269 transitions, 2860 flow, removed 30 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:04,493 INFO L231 Difference]: Finished difference. Result has 108 places, 205 transitions, 2293 flow [2024-05-12 12:21:04,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2293, PETRI_PLACES=108, PETRI_TRANSITIONS=205} [2024-05-12 12:21:04,494 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 56 predicate places. [2024-05-12 12:21:04,494 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 205 transitions, 2293 flow [2024-05-12 12:21:04,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:04,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:04,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:04,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:21:04,495 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:04,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1257790785, now seen corresponding path program 1 times [2024-05-12 12:21:04,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:04,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646176973] [2024-05-12 12:21:04,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:04,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646176973] [2024-05-12 12:21:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646176973] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:10,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:10,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730950275] [2024-05-12 12:21:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:10,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:11,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:21:11,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 205 transitions, 2293 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:11,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:11,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:21:11,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:12,905 INFO L124 PetriNetUnfolderBase]: 5208/8091 cut-off events. [2024-05-12 12:21:12,905 INFO L125 PetriNetUnfolderBase]: For 69652/69652 co-relation queries the response was YES. [2024-05-12 12:21:12,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42991 conditions, 8091 events. 5208/8091 cut-off events. For 69652/69652 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 48382 event pairs, 1265 based on Foata normal form. 12/7877 useless extension candidates. Maximal degree in co-relation 42940. Up to 6863 conditions per place. [2024-05-12 12:21:12,955 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 196 selfloop transitions, 60 changer transitions 0/263 dead transitions. [2024-05-12 12:21:12,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 263 transitions, 3111 flow [2024-05-12 12:21:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:21:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:21:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-05-12 12:21:12,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-05-12 12:21:12,957 INFO L175 Difference]: Start difference. First operand has 108 places, 205 transitions, 2293 flow. Second operand 8 states and 188 transitions. [2024-05-12 12:21:12,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 263 transitions, 3111 flow [2024-05-12 12:21:13,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 263 transitions, 3013 flow, removed 48 selfloop flow, removed 1 redundant places. [2024-05-12 12:21:13,042 INFO L231 Difference]: Finished difference. Result has 115 places, 209 transitions, 2397 flow [2024-05-12 12:21:13,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2397, PETRI_PLACES=115, PETRI_TRANSITIONS=209} [2024-05-12 12:21:13,042 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 63 predicate places. [2024-05-12 12:21:13,042 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 209 transitions, 2397 flow [2024-05-12 12:21:13,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:13,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:13,043 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:13,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:21:13,043 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:13,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:13,043 INFO L85 PathProgramCache]: Analyzing trace with hash 400397649, now seen corresponding path program 2 times [2024-05-12 12:21:13,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:13,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827965973] [2024-05-12 12:21:13,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:13,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:18,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:18,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:18,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827965973] [2024-05-12 12:21:18,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827965973] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:18,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:18,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:21:18,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040359012] [2024-05-12 12:21:18,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:18,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:21:18,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:18,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:21:18,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:21:18,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:21:18,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 209 transitions, 2397 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-05-12 12:21:18,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:18,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:21:18,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:20,442 INFO L124 PetriNetUnfolderBase]: 5283/8182 cut-off events. [2024-05-12 12:21:20,442 INFO L125 PetriNetUnfolderBase]: For 79098/79098 co-relation queries the response was YES. [2024-05-12 12:21:20,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45018 conditions, 8182 events. 5283/8182 cut-off events. For 79098/79098 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 48472 event pairs, 1670 based on Foata normal form. 6/7968 useless extension candidates. Maximal degree in co-relation 44964. Up to 7355 conditions per place. [2024-05-12 12:21:20,512 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 215 selfloop transitions, 30 changer transitions 0/252 dead transitions. [2024-05-12 12:21:20,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 252 transitions, 3106 flow [2024-05-12 12:21:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 154 transitions. [2024-05-12 12:21:20,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782608695652174 [2024-05-12 12:21:20,516 INFO L175 Difference]: Start difference. First operand has 115 places, 209 transitions, 2397 flow. Second operand 7 states and 154 transitions. [2024-05-12 12:21:20,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 252 transitions, 3106 flow [2024-05-12 12:21:20,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 252 transitions, 2952 flow, removed 21 selfloop flow, removed 6 redundant places. [2024-05-12 12:21:20,717 INFO L231 Difference]: Finished difference. Result has 118 places, 220 transitions, 2482 flow [2024-05-12 12:21:20,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2243, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2482, PETRI_PLACES=118, PETRI_TRANSITIONS=220} [2024-05-12 12:21:20,718 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 66 predicate places. [2024-05-12 12:21:20,719 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 220 transitions, 2482 flow [2024-05-12 12:21:20,719 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-05-12 12:21:20,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:20,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:20,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:21:20,719 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:20,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:20,720 INFO L85 PathProgramCache]: Analyzing trace with hash -954486527, now seen corresponding path program 3 times [2024-05-12 12:21:20,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896305910] [2024-05-12 12:21:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:20,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:27,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:27,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896305910] [2024-05-12 12:21:27,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896305910] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:27,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:27,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:21:27,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434455583] [2024-05-12 12:21:27,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:27,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:21:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:27,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:21:27,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:21:27,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:21:27,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 220 transitions, 2482 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-05-12 12:21:27,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:27,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:21:27,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:29,226 INFO L124 PetriNetUnfolderBase]: 5352/8295 cut-off events. [2024-05-12 12:21:29,226 INFO L125 PetriNetUnfolderBase]: For 88594/88594 co-relation queries the response was YES. [2024-05-12 12:21:29,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46330 conditions, 8295 events. 5352/8295 cut-off events. For 88594/88594 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 49403 event pairs, 1733 based on Foata normal form. 8/8079 useless extension candidates. Maximal degree in co-relation 46273. Up to 7463 conditions per place. [2024-05-12 12:21:29,291 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 226 selfloop transitions, 30 changer transitions 0/263 dead transitions. [2024-05-12 12:21:29,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 263 transitions, 3252 flow [2024-05-12 12:21:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:29,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-05-12 12:21:29,293 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48757763975155277 [2024-05-12 12:21:29,293 INFO L175 Difference]: Start difference. First operand has 118 places, 220 transitions, 2482 flow. Second operand 7 states and 157 transitions. [2024-05-12 12:21:29,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 263 transitions, 3252 flow [2024-05-12 12:21:29,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 263 transitions, 3156 flow, removed 31 selfloop flow, removed 3 redundant places. [2024-05-12 12:21:29,394 INFO L231 Difference]: Finished difference. Result has 123 places, 227 transitions, 2606 flow [2024-05-12 12:21:29,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2386, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2606, PETRI_PLACES=123, PETRI_TRANSITIONS=227} [2024-05-12 12:21:29,395 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 71 predicate places. [2024-05-12 12:21:29,395 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 227 transitions, 2606 flow [2024-05-12 12:21:29,395 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-05-12 12:21:29,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:29,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:29,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:21:29,396 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:29,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:29,396 INFO L85 PathProgramCache]: Analyzing trace with hash -946241147, now seen corresponding path program 4 times [2024-05-12 12:21:29,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:29,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165928542] [2024-05-12 12:21:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:29,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:29,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:35,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:35,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:35,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165928542] [2024-05-12 12:21:35,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165928542] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:35,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:35,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:21:35,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328661459] [2024-05-12 12:21:35,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:35,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:21:35,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:21:35,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:21:35,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:21:35,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 227 transitions, 2606 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-05-12 12:21:35,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:35,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:21:35,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:37,343 INFO L124 PetriNetUnfolderBase]: 5395/8365 cut-off events. [2024-05-12 12:21:37,343 INFO L125 PetriNetUnfolderBase]: For 99381/99381 co-relation queries the response was YES. [2024-05-12 12:21:37,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47584 conditions, 8365 events. 5395/8365 cut-off events. For 99381/99381 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 49948 event pairs, 1706 based on Foata normal form. 7/8145 useless extension candidates. Maximal degree in co-relation 47525. Up to 7414 conditions per place. [2024-05-12 12:21:37,432 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 214 selfloop transitions, 49 changer transitions 0/270 dead transitions. [2024-05-12 12:21:37,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 270 transitions, 3412 flow [2024-05-12 12:21:37,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2024-05-12 12:21:37,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4906832298136646 [2024-05-12 12:21:37,434 INFO L175 Difference]: Start difference. First operand has 123 places, 227 transitions, 2606 flow. Second operand 7 states and 158 transitions. [2024-05-12 12:21:37,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 270 transitions, 3412 flow [2024-05-12 12:21:37,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 270 transitions, 3320 flow, removed 36 selfloop flow, removed 3 redundant places. [2024-05-12 12:21:37,565 INFO L231 Difference]: Finished difference. Result has 128 places, 234 transitions, 2811 flow [2024-05-12 12:21:37,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2514, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2811, PETRI_PLACES=128, PETRI_TRANSITIONS=234} [2024-05-12 12:21:37,566 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 76 predicate places. [2024-05-12 12:21:37,566 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 234 transitions, 2811 flow [2024-05-12 12:21:37,566 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-05-12 12:21:37,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:37,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:37,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:21:37,567 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:37,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:37,568 INFO L85 PathProgramCache]: Analyzing trace with hash -954284934, now seen corresponding path program 1 times [2024-05-12 12:21:37,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:37,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114939946] [2024-05-12 12:21:37,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:37,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:43,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:43,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114939946] [2024-05-12 12:21:43,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114939946] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:43,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:43,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:43,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072692461] [2024-05-12 12:21:43,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:43,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:43,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:43,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:43,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:43,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:21:43,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 234 transitions, 2811 flow. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:43,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:43,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:21:43,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:45,290 INFO L124 PetriNetUnfolderBase]: 5368/8344 cut-off events. [2024-05-12 12:21:45,291 INFO L125 PetriNetUnfolderBase]: For 109471/109471 co-relation queries the response was YES. [2024-05-12 12:21:45,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48566 conditions, 8344 events. 5368/8344 cut-off events. For 109471/109471 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 50183 event pairs, 1287 based on Foata normal form. 6/8113 useless extension candidates. Maximal degree in co-relation 48504. Up to 7146 conditions per place. [2024-05-12 12:21:45,357 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 194 selfloop transitions, 88 changer transitions 0/289 dead transitions. [2024-05-12 12:21:45,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 289 transitions, 3713 flow [2024-05-12 12:21:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:45,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-05-12 12:21:45,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186335403726708 [2024-05-12 12:21:45,359 INFO L175 Difference]: Start difference. First operand has 128 places, 234 transitions, 2811 flow. Second operand 7 states and 167 transitions. [2024-05-12 12:21:45,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 289 transitions, 3713 flow [2024-05-12 12:21:45,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 289 transitions, 3575 flow, removed 56 selfloop flow, removed 3 redundant places. [2024-05-12 12:21:45,541 INFO L231 Difference]: Finished difference. Result has 133 places, 244 transitions, 3118 flow [2024-05-12 12:21:45,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2679, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3118, PETRI_PLACES=133, PETRI_TRANSITIONS=244} [2024-05-12 12:21:45,541 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 81 predicate places. [2024-05-12 12:21:45,542 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 244 transitions, 3118 flow [2024-05-12 12:21:45,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:45,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:45,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:45,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:21:45,542 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:45,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1023654358, now seen corresponding path program 1 times [2024-05-12 12:21:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392911991] [2024-05-12 12:21:45,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:45,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:53,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-05-12 12:21:53,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:53,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392911991] [2024-05-12 12:21:53,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392911991] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:53,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:53,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:21:53,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649448589] [2024-05-12 12:21:53,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:53,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:21:53,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:53,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:21:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:21:53,481 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:21:53,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 244 transitions, 3118 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-05-12 12:21:53,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:53,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:21:53,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:55,341 INFO L124 PetriNetUnfolderBase]: 5362/8312 cut-off events. [2024-05-12 12:21:55,341 INFO L125 PetriNetUnfolderBase]: For 115670/115670 co-relation queries the response was YES. [2024-05-12 12:21:55,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49733 conditions, 8312 events. 5362/8312 cut-off events. For 115670/115670 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 49520 event pairs, 1695 based on Foata normal form. 2/8085 useless extension candidates. Maximal degree in co-relation 49668. Up to 7586 conditions per place. [2024-05-12 12:21:55,413 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 236 selfloop transitions, 17 changer transitions 0/260 dead transitions. [2024-05-12 12:21:55,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 260 transitions, 3685 flow [2024-05-12 12:21:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:21:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:21:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2024-05-12 12:21:55,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652173913043478 [2024-05-12 12:21:55,415 INFO L175 Difference]: Start difference. First operand has 133 places, 244 transitions, 3118 flow. Second operand 5 states and 107 transitions. [2024-05-12 12:21:55,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 260 transitions, 3685 flow [2024-05-12 12:21:55,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 260 transitions, 3521 flow, removed 38 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:55,616 INFO L231 Difference]: Finished difference. Result has 135 places, 246 transitions, 3027 flow [2024-05-12 12:21:55,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2958, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3027, PETRI_PLACES=135, PETRI_TRANSITIONS=246} [2024-05-12 12:21:55,617 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 83 predicate places. [2024-05-12 12:21:55,617 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 246 transitions, 3027 flow [2024-05-12 12:21:55,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-05-12 12:21:55,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:55,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:21:55,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 12:21:55,618 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:21:55,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2023623676, now seen corresponding path program 1 times [2024-05-12 12:21:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:55,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792049362] [2024-05-12 12:21:55,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:55,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:01,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:01,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792049362] [2024-05-12 12:22:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792049362] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:01,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:01,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:01,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944730159] [2024-05-12 12:22:01,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:01,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:01,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:01,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:01,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:01,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:22:01,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 246 transitions, 3027 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:01,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:01,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:22:01,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:04,527 INFO L124 PetriNetUnfolderBase]: 7130/10776 cut-off events. [2024-05-12 12:22:04,527 INFO L125 PetriNetUnfolderBase]: For 174072/174072 co-relation queries the response was YES. [2024-05-12 12:22:04,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64087 conditions, 10776 events. 7130/10776 cut-off events. For 174072/174072 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 65870 event pairs, 995 based on Foata normal form. 64/10662 useless extension candidates. Maximal degree in co-relation 64020. Up to 6185 conditions per place. [2024-05-12 12:22:04,620 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 234 selfloop transitions, 118 changer transitions 0/359 dead transitions. [2024-05-12 12:22:04,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 359 transitions, 4768 flow [2024-05-12 12:22:04,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:04,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2024-05-12 12:22:04,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.572463768115942 [2024-05-12 12:22:04,624 INFO L175 Difference]: Start difference. First operand has 135 places, 246 transitions, 3027 flow. Second operand 9 states and 237 transitions. [2024-05-12 12:22:04,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 359 transitions, 4768 flow [2024-05-12 12:22:04,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 359 transitions, 4702 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-05-12 12:22:04,814 INFO L231 Difference]: Finished difference. Result has 142 places, 267 transitions, 3652 flow [2024-05-12 12:22:04,814 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=2971, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3652, PETRI_PLACES=142, PETRI_TRANSITIONS=267} [2024-05-12 12:22:04,815 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 90 predicate places. [2024-05-12 12:22:04,815 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 267 transitions, 3652 flow [2024-05-12 12:22:04,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:04,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:04,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:04,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:22:04,815 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:04,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:04,816 INFO L85 PathProgramCache]: Analyzing trace with hash -762971204, now seen corresponding path program 2 times [2024-05-12 12:22:04,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:04,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365770774] [2024-05-12 12:22:04,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:04,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365770774] [2024-05-12 12:22:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365770774] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:11,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:11,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:11,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323962574] [2024-05-12 12:22:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:11,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:11,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:11,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:11,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:11,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:22:11,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 267 transitions, 3652 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:11,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:11,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:22:11,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:14,065 INFO L124 PetriNetUnfolderBase]: 7284/11168 cut-off events. [2024-05-12 12:22:14,065 INFO L125 PetriNetUnfolderBase]: For 189804/189806 co-relation queries the response was YES. [2024-05-12 12:22:14,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70245 conditions, 11168 events. 7284/11168 cut-off events. For 189804/189806 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 69507 event pairs, 2235 based on Foata normal form. 20/10959 useless extension candidates. Maximal degree in co-relation 70176. Up to 9858 conditions per place. [2024-05-12 12:22:14,170 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 259 selfloop transitions, 69 changer transitions 0/335 dead transitions. [2024-05-12 12:22:14,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 335 transitions, 4749 flow [2024-05-12 12:22:14,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:14,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:14,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-05-12 12:22:14,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135869565217391 [2024-05-12 12:22:14,173 INFO L175 Difference]: Start difference. First operand has 142 places, 267 transitions, 3652 flow. Second operand 8 states and 189 transitions. [2024-05-12 12:22:14,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 335 transitions, 4749 flow [2024-05-12 12:22:14,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 335 transitions, 4657 flow, removed 26 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:14,509 INFO L231 Difference]: Finished difference. Result has 149 places, 281 transitions, 3965 flow [2024-05-12 12:22:14,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3568, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3965, PETRI_PLACES=149, PETRI_TRANSITIONS=281} [2024-05-12 12:22:14,509 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 97 predicate places. [2024-05-12 12:22:14,510 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 281 transitions, 3965 flow [2024-05-12 12:22:14,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:14,510 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:14,510 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:14,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 12:22:14,510 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:14,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash -760174694, now seen corresponding path program 3 times [2024-05-12 12:22:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:14,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849447934] [2024-05-12 12:22:14,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:14,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:20,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-05-12 12:22:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849447934] [2024-05-12 12:22:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849447934] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:20,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:20,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959876186] [2024-05-12 12:22:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:20,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:20,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:20,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:21,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:22:21,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 281 transitions, 3965 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:21,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:21,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:22:21,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:24,312 INFO L124 PetriNetUnfolderBase]: 7871/12041 cut-off events. [2024-05-12 12:22:24,313 INFO L125 PetriNetUnfolderBase]: For 209280/209280 co-relation queries the response was YES. [2024-05-12 12:22:24,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74410 conditions, 12041 events. 7871/12041 cut-off events. For 209280/209280 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 75811 event pairs, 1928 based on Foata normal form. 74/11887 useless extension candidates. Maximal degree in co-relation 74337. Up to 9221 conditions per place. [2024-05-12 12:22:24,413 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 252 selfloop transitions, 104 changer transitions 0/363 dead transitions. [2024-05-12 12:22:24,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 363 transitions, 5289 flow [2024-05-12 12:22:24,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 228 transitions. [2024-05-12 12:22:24,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5507246376811594 [2024-05-12 12:22:24,416 INFO L175 Difference]: Start difference. First operand has 149 places, 281 transitions, 3965 flow. Second operand 9 states and 228 transitions. [2024-05-12 12:22:24,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 363 transitions, 5289 flow [2024-05-12 12:22:24,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 363 transitions, 5128 flow, removed 31 selfloop flow, removed 4 redundant places. [2024-05-12 12:22:24,730 INFO L231 Difference]: Finished difference. Result has 154 places, 283 transitions, 4074 flow [2024-05-12 12:22:24,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3804, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4074, PETRI_PLACES=154, PETRI_TRANSITIONS=283} [2024-05-12 12:22:24,731 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 102 predicate places. [2024-05-12 12:22:24,731 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 283 transitions, 4074 flow [2024-05-12 12:22:24,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:24,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:24,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:24,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 12:22:24,732 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:24,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:24,732 INFO L85 PathProgramCache]: Analyzing trace with hash 336803740, now seen corresponding path program 1 times [2024-05-12 12:22:24,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:24,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023433772] [2024-05-12 12:22:24,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:24,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:31,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:31,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:31,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023433772] [2024-05-12 12:22:31,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023433772] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:31,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:31,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:31,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653672609] [2024-05-12 12:22:31,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:31,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:31,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:31,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:31,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:31,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:22:31,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 283 transitions, 4074 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-05-12 12:22:31,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:31,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:22:31,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:34,524 INFO L124 PetriNetUnfolderBase]: 7946/12195 cut-off events. [2024-05-12 12:22:34,524 INFO L125 PetriNetUnfolderBase]: For 204481/204481 co-relation queries the response was YES. [2024-05-12 12:22:34,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76215 conditions, 12195 events. 7946/12195 cut-off events. For 204481/204481 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 77583 event pairs, 2210 based on Foata normal form. 6/11959 useless extension candidates. Maximal degree in co-relation 76141. Up to 10996 conditions per place. [2024-05-12 12:22:34,657 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 268 selfloop transitions, 66 changer transitions 0/341 dead transitions. [2024-05-12 12:22:34,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 341 transitions, 5065 flow [2024-05-12 12:22:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:34,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 189 transitions. [2024-05-12 12:22:34,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5135869565217391 [2024-05-12 12:22:34,659 INFO L175 Difference]: Start difference. First operand has 154 places, 283 transitions, 4074 flow. Second operand 8 states and 189 transitions. [2024-05-12 12:22:34,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 341 transitions, 5065 flow [2024-05-12 12:22:35,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 341 transitions, 4829 flow, removed 14 selfloop flow, removed 7 redundant places. [2024-05-12 12:22:35,079 INFO L231 Difference]: Finished difference. Result has 155 places, 286 transitions, 4071 flow [2024-05-12 12:22:35,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3850, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4071, PETRI_PLACES=155, PETRI_TRANSITIONS=286} [2024-05-12 12:22:35,080 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 103 predicate places. [2024-05-12 12:22:35,080 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 286 transitions, 4071 flow [2024-05-12 12:22:35,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-05-12 12:22:35,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:35,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:35,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 12:22:35,081 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:35,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:35,081 INFO L85 PathProgramCache]: Analyzing trace with hash 336810250, now seen corresponding path program 2 times [2024-05-12 12:22:35,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:35,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175848236] [2024-05-12 12:22:35,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:35,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:41,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:41,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175848236] [2024-05-12 12:22:41,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175848236] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:41,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213442260] [2024-05-12 12:22:41,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:41,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:41,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:41,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:41,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:22:41,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 286 transitions, 4071 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:41,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:41,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:22:41,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:44,482 INFO L124 PetriNetUnfolderBase]: 8021/12301 cut-off events. [2024-05-12 12:22:44,482 INFO L125 PetriNetUnfolderBase]: For 211354/211354 co-relation queries the response was YES. [2024-05-12 12:22:44,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76858 conditions, 12301 events. 8021/12301 cut-off events. For 211354/211354 co-relation queries the response was YES. Maximal size of possible extension queue 517. Compared 78201 event pairs, 2204 based on Foata normal form. 6/12066 useless extension candidates. Maximal degree in co-relation 76783. Up to 10798 conditions per place. [2024-05-12 12:22:44,608 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 272 selfloop transitions, 62 changer transitions 0/341 dead transitions. [2024-05-12 12:22:44,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 341 transitions, 5045 flow [2024-05-12 12:22:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 185 transitions. [2024-05-12 12:22:44,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027173913043478 [2024-05-12 12:22:44,610 INFO L175 Difference]: Start difference. First operand has 155 places, 286 transitions, 4071 flow. Second operand 8 states and 185 transitions. [2024-05-12 12:22:44,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 341 transitions, 5045 flow [2024-05-12 12:22:44,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 341 transitions, 4879 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-05-12 12:22:44,992 INFO L231 Difference]: Finished difference. Result has 158 places, 289 transitions, 4122 flow [2024-05-12 12:22:44,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3905, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4122, PETRI_PLACES=158, PETRI_TRANSITIONS=289} [2024-05-12 12:22:44,993 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 106 predicate places. [2024-05-12 12:22:44,993 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 289 transitions, 4122 flow [2024-05-12 12:22:44,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:44,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:44,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:44,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 12:22:44,994 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:44,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 740465034, now seen corresponding path program 3 times [2024-05-12 12:22:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:44,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069438222] [2024-05-12 12:22:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:45,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:51,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069438222] [2024-05-12 12:22:51,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069438222] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:51,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:51,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:51,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863718614] [2024-05-12 12:22:51,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:51,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:51,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:51,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:51,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:51,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:22:51,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 289 transitions, 4122 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:51,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:51,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:22:51,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:54,529 INFO L124 PetriNetUnfolderBase]: 8096/12242 cut-off events. [2024-05-12 12:22:54,530 INFO L125 PetriNetUnfolderBase]: For 225334/225334 co-relation queries the response was YES. [2024-05-12 12:22:54,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78329 conditions, 12242 events. 8096/12242 cut-off events. For 225334/225334 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 76479 event pairs, 2867 based on Foata normal form. 6/12063 useless extension candidates. Maximal degree in co-relation 78253. Up to 11439 conditions per place. [2024-05-12 12:22:54,654 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 294 selfloop transitions, 33 changer transitions 0/334 dead transitions. [2024-05-12 12:22:54,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 334 transitions, 5004 flow [2024-05-12 12:22:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 177 transitions. [2024-05-12 12:22:54,655 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48097826086956524 [2024-05-12 12:22:54,655 INFO L175 Difference]: Start difference. First operand has 158 places, 289 transitions, 4122 flow. Second operand 8 states and 177 transitions. [2024-05-12 12:22:54,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 334 transitions, 5004 flow [2024-05-12 12:22:55,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 334 transitions, 4825 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:55,062 INFO L231 Difference]: Finished difference. Result has 160 places, 292 transitions, 4107 flow [2024-05-12 12:22:55,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3943, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4107, PETRI_PLACES=160, PETRI_TRANSITIONS=292} [2024-05-12 12:22:55,062 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 108 predicate places. [2024-05-12 12:22:55,063 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 292 transitions, 4107 flow [2024-05-12 12:22:55,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:22:55,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:55,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:22:55,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 12:22:55,063 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:22:55,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:55,064 INFO L85 PathProgramCache]: Analyzing trace with hash 481939914, now seen corresponding path program 4 times [2024-05-12 12:22:55,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:55,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119506761] [2024-05-12 12:22:55,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:55,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:01,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:01,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119506761] [2024-05-12 12:23:01,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119506761] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:01,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:01,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:01,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30190178] [2024-05-12 12:23:01,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:01,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:01,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:01,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:01,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:01,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:23:01,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 292 transitions, 4107 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:23:01,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:01,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:23:01,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:04,871 INFO L124 PetriNetUnfolderBase]: 8171/12399 cut-off events. [2024-05-12 12:23:04,871 INFO L125 PetriNetUnfolderBase]: For 232624/232624 co-relation queries the response was YES. [2024-05-12 12:23:04,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79428 conditions, 12399 events. 8171/12399 cut-off events. For 232624/232624 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 78137 event pairs, 2252 based on Foata normal form. 6/12204 useless extension candidates. Maximal degree in co-relation 79351. Up to 11181 conditions per place. [2024-05-12 12:23:04,995 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 249 selfloop transitions, 94 changer transitions 0/350 dead transitions. [2024-05-12 12:23:04,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 350 transitions, 5122 flow [2024-05-12 12:23:04,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 190 transitions. [2024-05-12 12:23:04,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163043478260869 [2024-05-12 12:23:04,996 INFO L175 Difference]: Start difference. First operand has 160 places, 292 transitions, 4107 flow. Second operand 8 states and 190 transitions. [2024-05-12 12:23:04,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 350 transitions, 5122 flow [2024-05-12 12:23:05,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 350 transitions, 4994 flow, removed 33 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:05,412 INFO L231 Difference]: Finished difference. Result has 162 places, 295 transitions, 4280 flow [2024-05-12 12:23:05,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=3979, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4280, PETRI_PLACES=162, PETRI_TRANSITIONS=295} [2024-05-12 12:23:05,414 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 110 predicate places. [2024-05-12 12:23:05,414 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 295 transitions, 4280 flow [2024-05-12 12:23:05,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:23:05,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:05,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:05,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:23:05,415 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:05,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:05,415 INFO L85 PathProgramCache]: Analyzing trace with hash 731297094, now seen corresponding path program 5 times [2024-05-12 12:23:05,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:05,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400782776] [2024-05-12 12:23:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:11,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:11,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400782776] [2024-05-12 12:23:11,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400782776] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:11,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:11,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:11,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976818612] [2024-05-12 12:23:11,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:11,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:11,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:11,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:11,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:23:11,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 295 transitions, 4280 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:23:11,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:11,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:23:11,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:15,091 INFO L124 PetriNetUnfolderBase]: 8209/12585 cut-off events. [2024-05-12 12:23:15,091 INFO L125 PetriNetUnfolderBase]: For 248497/248497 co-relation queries the response was YES. [2024-05-12 12:23:15,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80923 conditions, 12585 events. 8209/12585 cut-off events. For 248497/248497 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 80301 event pairs, 2129 based on Foata normal form. 6/12346 useless extension candidates. Maximal degree in co-relation 80845. Up to 10783 conditions per place. [2024-05-12 12:23:15,213 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 250 selfloop transitions, 93 changer transitions 0/350 dead transitions. [2024-05-12 12:23:15,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 350 transitions, 5290 flow [2024-05-12 12:23:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 186 transitions. [2024-05-12 12:23:15,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054347826086957 [2024-05-12 12:23:15,215 INFO L175 Difference]: Start difference. First operand has 162 places, 295 transitions, 4280 flow. Second operand 8 states and 186 transitions. [2024-05-12 12:23:15,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 350 transitions, 5290 flow [2024-05-12 12:23:15,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 350 transitions, 5033 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:15,647 INFO L231 Difference]: Finished difference. Result has 164 places, 298 transitions, 4324 flow [2024-05-12 12:23:15,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4029, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4324, PETRI_PLACES=164, PETRI_TRANSITIONS=298} [2024-05-12 12:23:15,647 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 112 predicate places. [2024-05-12 12:23:15,647 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 298 transitions, 4324 flow [2024-05-12 12:23:15,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 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-05-12 12:23:15,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:15,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:15,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:23:15,648 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:15,648 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:15,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1276622577, now seen corresponding path program 1 times [2024-05-12 12:23:15,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921256523] [2024-05-12 12:23:15,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:15,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:24,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921256523] [2024-05-12 12:23:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921256523] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:24,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:24,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:23:24,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111087152] [2024-05-12 12:23:24,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:24,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:23:24,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:24,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:23:24,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:23:24,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:23:24,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 298 transitions, 4324 flow. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-05-12 12:23:24,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:24,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:23:24,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:27,429 INFO L124 PetriNetUnfolderBase]: 8203/12574 cut-off events. [2024-05-12 12:23:27,429 INFO L125 PetriNetUnfolderBase]: For 245448/245448 co-relation queries the response was YES. [2024-05-12 12:23:27,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80556 conditions, 12574 events. 8203/12574 cut-off events. For 245448/245448 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 79934 event pairs, 3034 based on Foata normal form. 2/12332 useless extension candidates. Maximal degree in co-relation 80477. Up to 11718 conditions per place. [2024-05-12 12:23:27,554 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 285 selfloop transitions, 36 changer transitions 0/328 dead transitions. [2024-05-12 12:23:27,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 328 transitions, 5178 flow [2024-05-12 12:23:27,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:23:27,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:23:27,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2024-05-12 12:23:27,555 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48188405797101447 [2024-05-12 12:23:27,555 INFO L175 Difference]: Start difference. First operand has 164 places, 298 transitions, 4324 flow. Second operand 6 states and 133 transitions. [2024-05-12 12:23:27,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 328 transitions, 5178 flow [2024-05-12 12:23:28,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 328 transitions, 4921 flow, removed 40 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:28,035 INFO L231 Difference]: Finished difference. Result has 164 places, 301 transitions, 4230 flow [2024-05-12 12:23:28,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4071, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4230, PETRI_PLACES=164, PETRI_TRANSITIONS=301} [2024-05-12 12:23:28,040 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 112 predicate places. [2024-05-12 12:23:28,040 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 301 transitions, 4230 flow [2024-05-12 12:23:28,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 8 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-05-12 12:23:28,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:28,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:28,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:23:28,041 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:28,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1728405692, now seen corresponding path program 1 times [2024-05-12 12:23:28,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:28,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712614221] [2024-05-12 12:23:28,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:28,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:34,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:34,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:34,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712614221] [2024-05-12 12:23:34,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712614221] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:34,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:34,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:34,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893576743] [2024-05-12 12:23:34,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:34,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:34,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:35,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:23:35,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 301 transitions, 4230 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-05-12 12:23:35,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:35,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:23:35,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:38,842 INFO L124 PetriNetUnfolderBase]: 9106/13776 cut-off events. [2024-05-12 12:23:38,842 INFO L125 PetriNetUnfolderBase]: For 284034/284034 co-relation queries the response was YES. [2024-05-12 12:23:38,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87756 conditions, 13776 events. 9106/13776 cut-off events. For 284034/284034 co-relation queries the response was YES. Maximal size of possible extension queue 600. Compared 88213 event pairs, 2137 based on Foata normal form. 54/13634 useless extension candidates. Maximal degree in co-relation 87676. Up to 10960 conditions per place. [2024-05-12 12:23:38,983 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 297 selfloop transitions, 94 changer transitions 0/398 dead transitions. [2024-05-12 12:23:38,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 398 transitions, 5949 flow [2024-05-12 12:23:38,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:38,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:38,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 232 transitions. [2024-05-12 12:23:38,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5603864734299517 [2024-05-12 12:23:38,985 INFO L175 Difference]: Start difference. First operand has 164 places, 301 transitions, 4230 flow. Second operand 9 states and 232 transitions. [2024-05-12 12:23:38,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 398 transitions, 5949 flow [2024-05-12 12:23:39,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 398 transitions, 5828 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-05-12 12:23:39,532 INFO L231 Difference]: Finished difference. Result has 170 places, 311 transitions, 4536 flow [2024-05-12 12:23:39,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4111, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4536, PETRI_PLACES=170, PETRI_TRANSITIONS=311} [2024-05-12 12:23:39,535 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 118 predicate places. [2024-05-12 12:23:39,535 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 311 transitions, 4536 flow [2024-05-12 12:23:39,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-05-12 12:23:39,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:39,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:39,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:23:39,535 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:39,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash 714381399, now seen corresponding path program 1 times [2024-05-12 12:23:39,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:39,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094026332] [2024-05-12 12:23:39,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:39,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:46,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:46,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094026332] [2024-05-12 12:23:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094026332] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:46,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:46,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:23:46,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831420981] [2024-05-12 12:23:46,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:46,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:23:46,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:46,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:23:46,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:23:46,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:23:46,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 311 transitions, 4536 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:23:46,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:46,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:23:46,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:50,228 INFO L124 PetriNetUnfolderBase]: 9282/14068 cut-off events. [2024-05-12 12:23:50,229 INFO L125 PetriNetUnfolderBase]: For 300319/300319 co-relation queries the response was YES. [2024-05-12 12:23:50,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93051 conditions, 14068 events. 9282/14068 cut-off events. For 300319/300319 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 90894 event pairs, 2586 based on Foata normal form. 3/13858 useless extension candidates. Maximal degree in co-relation 92969. Up to 12790 conditions per place. [2024-05-12 12:23:50,375 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 302 selfloop transitions, 74 changer transitions 0/383 dead transitions. [2024-05-12 12:23:50,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 383 transitions, 6039 flow [2024-05-12 12:23:50,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:23:50,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:23:50,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-05-12 12:23:50,377 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5108695652173914 [2024-05-12 12:23:50,377 INFO L175 Difference]: Start difference. First operand has 170 places, 311 transitions, 4536 flow. Second operand 8 states and 188 transitions. [2024-05-12 12:23:50,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 383 transitions, 6039 flow [2024-05-12 12:23:50,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 383 transitions, 5868 flow, removed 27 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:50,985 INFO L231 Difference]: Finished difference. Result has 175 places, 327 transitions, 4954 flow [2024-05-12 12:23:50,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4371, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=4954, PETRI_PLACES=175, PETRI_TRANSITIONS=327} [2024-05-12 12:23:50,986 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 123 predicate places. [2024-05-12 12:23:50,986 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 327 transitions, 4954 flow [2024-05-12 12:23:50,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:23:50,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:50,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:23:50,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:23:50,987 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:23:50,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1850982958, now seen corresponding path program 2 times [2024-05-12 12:23:50,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:50,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727984902] [2024-05-12 12:23:50,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:50,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:57,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:57,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727984902] [2024-05-12 12:23:57,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727984902] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:57,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:57,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:57,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282792566] [2024-05-12 12:23:57,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:57,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:57,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:57,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:57,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:58,129 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:23:58,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 327 transitions, 4954 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-05-12 12:23:58,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:58,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:23:58,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:02,211 INFO L124 PetriNetUnfolderBase]: 10109/15289 cut-off events. [2024-05-12 12:24:02,211 INFO L125 PetriNetUnfolderBase]: For 369158/369158 co-relation queries the response was YES. [2024-05-12 12:24:02,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103916 conditions, 15289 events. 10109/15289 cut-off events. For 369158/369158 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 100024 event pairs, 2483 based on Foata normal form. 60/15143 useless extension candidates. Maximal degree in co-relation 103830. Up to 12503 conditions per place. [2024-05-12 12:24:02,370 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 322 selfloop transitions, 105 changer transitions 0/434 dead transitions. [2024-05-12 12:24:02,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 434 transitions, 6956 flow [2024-05-12 12:24:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-05-12 12:24:02,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5700483091787439 [2024-05-12 12:24:02,371 INFO L175 Difference]: Start difference. First operand has 175 places, 327 transitions, 4954 flow. Second operand 9 states and 236 transitions. [2024-05-12 12:24:02,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 434 transitions, 6956 flow [2024-05-12 12:24:03,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 434 transitions, 6850 flow, removed 48 selfloop flow, removed 2 redundant places. [2024-05-12 12:24:03,179 INFO L231 Difference]: Finished difference. Result has 185 places, 347 transitions, 5601 flow [2024-05-12 12:24:03,180 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=4848, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5601, PETRI_PLACES=185, PETRI_TRANSITIONS=347} [2024-05-12 12:24:03,180 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 133 predicate places. [2024-05-12 12:24:03,180 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 347 transitions, 5601 flow [2024-05-12 12:24:03,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-05-12 12:24:03,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:03,181 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:03,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:24:03,181 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:03,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1851184768, now seen corresponding path program 3 times [2024-05-12 12:24:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229099868] [2024-05-12 12:24:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229099868] [2024-05-12 12:24:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229099868] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:11,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:11,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:24:11,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316545209] [2024-05-12 12:24:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:11,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:24:11,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:11,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:24:11,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:24:11,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:24:11,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 347 transitions, 5601 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-05-12 12:24:11,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:11,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:24:11,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:15,527 INFO L124 PetriNetUnfolderBase]: 10300/15762 cut-off events. [2024-05-12 12:24:15,528 INFO L125 PetriNetUnfolderBase]: For 400151/400151 co-relation queries the response was YES. [2024-05-12 12:24:15,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109597 conditions, 15762 events. 10300/15762 cut-off events. For 400151/400151 co-relation queries the response was YES. Maximal size of possible extension queue 699. Compared 105013 event pairs, 2815 based on Foata normal form. 18/15515 useless extension candidates. Maximal degree in co-relation 109506. Up to 13956 conditions per place. [2024-05-12 12:24:15,717 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 339 selfloop transitions, 70 changer transitions 0/416 dead transitions. [2024-05-12 12:24:15,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 416 transitions, 6882 flow [2024-05-12 12:24:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:15,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 209 transitions. [2024-05-12 12:24:15,718 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048309178743962 [2024-05-12 12:24:15,719 INFO L175 Difference]: Start difference. First operand has 185 places, 347 transitions, 5601 flow. Second operand 9 states and 209 transitions. [2024-05-12 12:24:15,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 416 transitions, 6882 flow [2024-05-12 12:24:16,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 416 transitions, 6760 flow, removed 42 selfloop flow, removed 3 redundant places. [2024-05-12 12:24:16,585 INFO L231 Difference]: Finished difference. Result has 191 places, 350 transitions, 5737 flow [2024-05-12 12:24:16,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5483, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5737, PETRI_PLACES=191, PETRI_TRANSITIONS=350} [2024-05-12 12:24:16,586 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 139 predicate places. [2024-05-12 12:24:16,586 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 350 transitions, 5737 flow [2024-05-12 12:24:16,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-05-12 12:24:16,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:16,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:16,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:24:16,587 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:16,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:16,587 INFO L85 PathProgramCache]: Analyzing trace with hash 714650510, now seen corresponding path program 1 times [2024-05-12 12:24:16,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:16,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598813301] [2024-05-12 12:24:16,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:16,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:24,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:24,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598813301] [2024-05-12 12:24:24,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598813301] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:24,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:24,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:24,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301172168] [2024-05-12 12:24:24,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:24,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:24,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:24,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:24,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:24,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:24:24,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 350 transitions, 5737 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:24:24,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:24,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:24:24,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:28,240 INFO L124 PetriNetUnfolderBase]: 10324/15647 cut-off events. [2024-05-12 12:24:28,240 INFO L125 PetriNetUnfolderBase]: For 394391/394391 co-relation queries the response was YES. [2024-05-12 12:24:28,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109995 conditions, 15647 events. 10324/15647 cut-off events. For 394391/394391 co-relation queries the response was YES. Maximal size of possible extension queue 698. Compared 103225 event pairs, 3187 based on Foata normal form. 4/15434 useless extension candidates. Maximal degree in co-relation 109902. Up to 14856 conditions per place. [2024-05-12 12:24:28,452 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 352 selfloop transitions, 42 changer transitions 0/401 dead transitions. [2024-05-12 12:24:28,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 401 transitions, 7130 flow [2024-05-12 12:24:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:24:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:24:28,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-05-12 12:24:28,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963768115942029 [2024-05-12 12:24:28,454 INFO L175 Difference]: Start difference. First operand has 191 places, 350 transitions, 5737 flow. Second operand 6 states and 137 transitions. [2024-05-12 12:24:28,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 401 transitions, 7130 flow [2024-05-12 12:24:29,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 401 transitions, 6920 flow, removed 41 selfloop flow, removed 6 redundant places. [2024-05-12 12:24:29,745 INFO L231 Difference]: Finished difference. Result has 192 places, 372 transitions, 6098 flow [2024-05-12 12:24:29,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5529, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=6098, PETRI_PLACES=192, PETRI_TRANSITIONS=372} [2024-05-12 12:24:29,746 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 140 predicate places. [2024-05-12 12:24:29,746 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 372 transitions, 6098 flow [2024-05-12 12:24:29,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:24:29,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:29,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:29,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:24:29,747 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:29,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash 714650169, now seen corresponding path program 2 times [2024-05-12 12:24:29,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:29,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458588610] [2024-05-12 12:24:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:29,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:29,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:36,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458588610] [2024-05-12 12:24:36,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458588610] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:36,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:36,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:36,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305289457] [2024-05-12 12:24:36,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:36,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:36,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:36,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:36,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:36,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:24:36,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 372 transitions, 6098 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:24:36,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:36,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:24:36,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:41,013 INFO L124 PetriNetUnfolderBase]: 10549/16007 cut-off events. [2024-05-12 12:24:41,013 INFO L125 PetriNetUnfolderBase]: For 408080/408080 co-relation queries the response was YES. [2024-05-12 12:24:41,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113540 conditions, 16007 events. 10549/16007 cut-off events. For 408080/408080 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 105799 event pairs, 3039 based on Foata normal form. 3/15776 useless extension candidates. Maximal degree in co-relation 113445. Up to 14888 conditions per place. [2024-05-12 12:24:41,199 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 373 selfloop transitions, 61 changer transitions 0/441 dead transitions. [2024-05-12 12:24:41,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 441 transitions, 7804 flow [2024-05-12 12:24:41,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:24:41,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:24:41,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-05-12 12:24:41,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186335403726708 [2024-05-12 12:24:41,201 INFO L175 Difference]: Start difference. First operand has 192 places, 372 transitions, 6098 flow. Second operand 7 states and 167 transitions. [2024-05-12 12:24:41,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 441 transitions, 7804 flow [2024-05-12 12:24:42,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 441 transitions, 7670 flow, removed 59 selfloop flow, removed 2 redundant places. [2024-05-12 12:24:42,256 INFO L231 Difference]: Finished difference. Result has 198 places, 390 transitions, 6640 flow [2024-05-12 12:24:42,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=5966, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=6640, PETRI_PLACES=198, PETRI_TRANSITIONS=390} [2024-05-12 12:24:42,257 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 146 predicate places. [2024-05-12 12:24:42,257 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 390 transitions, 6640 flow [2024-05-12 12:24:42,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:24:42,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:42,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:42,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:24:42,258 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:42,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:42,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1103371300, now seen corresponding path program 4 times [2024-05-12 12:24:42,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:42,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455208926] [2024-05-12 12:24:42,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:42,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:49,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:49,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455208926] [2024-05-12 12:24:49,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455208926] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:49,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:49,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:24:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655169901] [2024-05-12 12:24:49,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:49,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:24:49,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:49,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:24:49,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:24:49,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:24:49,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 390 transitions, 6640 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:24:49,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:49,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:24:49,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:54,234 INFO L124 PetriNetUnfolderBase]: 11692/17638 cut-off events. [2024-05-12 12:24:54,234 INFO L125 PetriNetUnfolderBase]: For 515429/515429 co-relation queries the response was YES. [2024-05-12 12:24:54,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127493 conditions, 17638 events. 11692/17638 cut-off events. For 515429/515429 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 117404 event pairs, 2602 based on Foata normal form. 60/17485 useless extension candidates. Maximal degree in co-relation 127395. Up to 13122 conditions per place. [2024-05-12 12:24:54,502 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 375 selfloop transitions, 124 changer transitions 0/506 dead transitions. [2024-05-12 12:24:54,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 506 transitions, 9022 flow [2024-05-12 12:24:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 236 transitions. [2024-05-12 12:24:54,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5700483091787439 [2024-05-12 12:24:54,504 INFO L175 Difference]: Start difference. First operand has 198 places, 390 transitions, 6640 flow. Second operand 9 states and 236 transitions. [2024-05-12 12:24:54,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 506 transitions, 9022 flow [2024-05-12 12:24:55,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 506 transitions, 8880 flow, removed 25 selfloop flow, removed 4 redundant places. [2024-05-12 12:24:55,726 INFO L231 Difference]: Finished difference. Result has 205 places, 412 transitions, 7333 flow [2024-05-12 12:24:55,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=6500, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7333, PETRI_PLACES=205, PETRI_TRANSITIONS=412} [2024-05-12 12:24:55,732 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 153 predicate places. [2024-05-12 12:24:55,732 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 412 transitions, 7333 flow [2024-05-12 12:24:55,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:24:55,732 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:55,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:24:55,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:24:55,732 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:24:55,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:55,733 INFO L85 PathProgramCache]: Analyzing trace with hash 422250460, now seen corresponding path program 5 times [2024-05-12 12:24:55,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:55,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607043506] [2024-05-12 12:24:55,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:55,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:25:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607043506] [2024-05-12 12:25:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607043506] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:25:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427955975] [2024-05-12 12:25:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:03,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:25:03,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:25:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:25:03,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:25:03,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 412 transitions, 7333 flow. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-05-12 12:25:03,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:03,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:25:03,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:08,062 INFO L124 PetriNetUnfolderBase]: 11790/17922 cut-off events. [2024-05-12 12:25:08,063 INFO L125 PetriNetUnfolderBase]: For 544410/544410 co-relation queries the response was YES. [2024-05-12 12:25:08,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132563 conditions, 17922 events. 11790/17922 cut-off events. For 544410/544410 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 120437 event pairs, 4424 based on Foata normal form. 18/17682 useless extension candidates. Maximal degree in co-relation 132463. Up to 16669 conditions per place. [2024-05-12 12:25:08,319 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 424 selfloop transitions, 36 changer transitions 0/467 dead transitions. [2024-05-12 12:25:08,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 467 transitions, 8527 flow [2024-05-12 12:25:08,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:25:08,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:25:08,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 200 transitions. [2024-05-12 12:25:08,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830917874396135 [2024-05-12 12:25:08,321 INFO L175 Difference]: Start difference. First operand has 205 places, 412 transitions, 7333 flow. Second operand 9 states and 200 transitions. [2024-05-12 12:25:08,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 467 transitions, 8527 flow [2024-05-12 12:25:10,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 467 transitions, 8309 flow, removed 57 selfloop flow, removed 4 redundant places. [2024-05-12 12:25:10,314 INFO L231 Difference]: Finished difference. Result has 209 places, 414 transitions, 7257 flow [2024-05-12 12:25:10,314 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7057, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7257, PETRI_PLACES=209, PETRI_TRANSITIONS=414} [2024-05-12 12:25:10,315 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 157 predicate places. [2024-05-12 12:25:10,315 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 414 transitions, 7257 flow [2024-05-12 12:25:10,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 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-05-12 12:25:10,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:10,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:10,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:25:10,315 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:10,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:10,316 INFO L85 PathProgramCache]: Analyzing trace with hash -184294040, now seen corresponding path program 2 times [2024-05-12 12:25:10,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:10,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392806648] [2024-05-12 12:25:10,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:10,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:16,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-05-12 12:25:16,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:16,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392806648] [2024-05-12 12:25:16,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392806648] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:16,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:16,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:25:16,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372491665] [2024-05-12 12:25:16,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:16,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:25:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:16,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:25:16,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:25:16,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:25:16,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 414 transitions, 7257 flow. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-05-12 12:25:16,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:16,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:25:16,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:21,661 INFO L124 PetriNetUnfolderBase]: 11808/18000 cut-off events. [2024-05-12 12:25:21,661 INFO L125 PetriNetUnfolderBase]: For 528641/528641 co-relation queries the response was YES. [2024-05-12 12:25:21,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131806 conditions, 18000 events. 11808/18000 cut-off events. For 528641/528641 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 121666 event pairs, 4557 based on Foata normal form. 2/17726 useless extension candidates. Maximal degree in co-relation 131704. Up to 17114 conditions per place. [2024-05-12 12:25:21,910 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 409 selfloop transitions, 26 changer transitions 0/442 dead transitions. [2024-05-12 12:25:21,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 442 transitions, 8330 flow [2024-05-12 12:25:21,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:25:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:25:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-05-12 12:25:21,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45652173913043476 [2024-05-12 12:25:21,912 INFO L175 Difference]: Start difference. First operand has 209 places, 414 transitions, 7257 flow. Second operand 6 states and 126 transitions. [2024-05-12 12:25:21,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 442 transitions, 8330 flow [2024-05-12 12:25:23,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 442 transitions, 8172 flow, removed 49 selfloop flow, removed 6 redundant places. [2024-05-12 12:25:23,577 INFO L231 Difference]: Finished difference. Result has 210 places, 423 transitions, 7310 flow [2024-05-12 12:25:23,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7099, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7310, PETRI_PLACES=210, PETRI_TRANSITIONS=423} [2024-05-12 12:25:23,578 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 158 predicate places. [2024-05-12 12:25:23,578 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 423 transitions, 7310 flow [2024-05-12 12:25:23,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 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-05-12 12:25:23,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:23,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:23,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:25:23,579 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:23,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash 920595693, now seen corresponding path program 1 times [2024-05-12 12:25:23,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:23,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126580806] [2024-05-12 12:25:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:25:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:31,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126580806] [2024-05-12 12:25:31,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126580806] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:31,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:31,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:25:31,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481679611] [2024-05-12 12:25:31,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:31,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:25:31,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:31,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:25:31,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:25:31,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:25:31,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 423 transitions, 7310 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:25:31,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:31,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:25:31,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:36,395 INFO L124 PetriNetUnfolderBase]: 11796/17905 cut-off events. [2024-05-12 12:25:36,396 INFO L125 PetriNetUnfolderBase]: For 521522/521522 co-relation queries the response was YES. [2024-05-12 12:25:36,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131339 conditions, 17905 events. 11796/17905 cut-off events. For 521522/521522 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 120491 event pairs, 4499 based on Foata normal form. 4/17659 useless extension candidates. Maximal degree in co-relation 131234. Up to 16934 conditions per place. [2024-05-12 12:25:36,769 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 416 selfloop transitions, 49 changer transitions 0/472 dead transitions. [2024-05-12 12:25:36,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 472 transitions, 8646 flow [2024-05-12 12:25:36,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:25:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:25:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 189 transitions. [2024-05-12 12:25:36,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45652173913043476 [2024-05-12 12:25:36,772 INFO L175 Difference]: Start difference. First operand has 210 places, 423 transitions, 7310 flow. Second operand 9 states and 189 transitions. [2024-05-12 12:25:36,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 472 transitions, 8646 flow [2024-05-12 12:25:38,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 472 transitions, 8573 flow, removed 25 selfloop flow, removed 2 redundant places. [2024-05-12 12:25:38,378 INFO L231 Difference]: Finished difference. Result has 218 places, 432 transitions, 7514 flow [2024-05-12 12:25:38,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7238, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=7514, PETRI_PLACES=218, PETRI_TRANSITIONS=432} [2024-05-12 12:25:38,379 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 166 predicate places. [2024-05-12 12:25:38,379 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 432 transitions, 7514 flow [2024-05-12 12:25:38,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:25:38,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:38,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:38,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:25:38,379 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:38,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:38,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1068412683, now seen corresponding path program 2 times [2024-05-12 12:25:38,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:38,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468191391] [2024-05-12 12:25:38,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:25:47,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:47,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468191391] [2024-05-12 12:25:47,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468191391] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:47,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:47,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:25:47,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915308827] [2024-05-12 12:25:47,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:47,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:25:47,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:47,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:25:47,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:25:47,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:25:47,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 432 transitions, 7514 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:25:47,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:47,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:25:47,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:52,947 INFO L124 PetriNetUnfolderBase]: 11856/17998 cut-off events. [2024-05-12 12:25:52,947 INFO L125 PetriNetUnfolderBase]: For 544843/544843 co-relation queries the response was YES. [2024-05-12 12:25:53,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133989 conditions, 17998 events. 11856/17998 cut-off events. For 544843/544843 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 121102 event pairs, 4313 based on Foata normal form. 4/17748 useless extension candidates. Maximal degree in co-relation 133881. Up to 17047 conditions per place. [2024-05-12 12:25:53,325 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 418 selfloop transitions, 47 changer transitions 0/472 dead transitions. [2024-05-12 12:25:53,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 472 transitions, 8763 flow [2024-05-12 12:25:53,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:25:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:25:53,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 170 transitions. [2024-05-12 12:25:53,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46195652173913043 [2024-05-12 12:25:53,327 INFO L175 Difference]: Start difference. First operand has 218 places, 432 transitions, 7514 flow. Second operand 8 states and 170 transitions. [2024-05-12 12:25:53,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 472 transitions, 8763 flow [2024-05-12 12:25:54,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 472 transitions, 8566 flow, removed 73 selfloop flow, removed 4 redundant places. [2024-05-12 12:25:54,664 INFO L231 Difference]: Finished difference. Result has 223 places, 438 transitions, 7542 flow [2024-05-12 12:25:54,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7332, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=7542, PETRI_PLACES=223, PETRI_TRANSITIONS=438} [2024-05-12 12:25:54,664 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 171 predicate places. [2024-05-12 12:25:54,664 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 438 transitions, 7542 flow [2024-05-12 12:25:54,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:25:54,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:54,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:54,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:25:54,665 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:25:54,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash -184494517, now seen corresponding path program 3 times [2024-05-12 12:25:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:54,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39524702] [2024-05-12 12:25:54,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:26:02,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-05-12 12:26:02,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:26:02,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39524702] [2024-05-12 12:26:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39524702] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:26:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:26:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:26:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359756572] [2024-05-12 12:26:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:26:02,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:26:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:26:02,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:26:02,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:26:02,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:26:02,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 438 transitions, 7542 flow. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:26:02,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:26:02,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:26:02,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:26:07,842 INFO L124 PetriNetUnfolderBase]: 11844/17982 cut-off events. [2024-05-12 12:26:07,843 INFO L125 PetriNetUnfolderBase]: For 551562/551562 co-relation queries the response was YES. [2024-05-12 12:26:07,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133813 conditions, 17982 events. 11844/17982 cut-off events. For 551562/551562 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 121084 event pairs, 4343 based on Foata normal form. 4/17731 useless extension candidates. Maximal degree in co-relation 133703. Up to 17039 conditions per place. [2024-05-12 12:26:08,371 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 412 selfloop transitions, 45 changer transitions 0/464 dead transitions. [2024-05-12 12:26:08,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 464 transitions, 8580 flow [2024-05-12 12:26:08,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:26:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:26:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 134 transitions. [2024-05-12 12:26:08,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2024-05-12 12:26:08,374 INFO L175 Difference]: Start difference. First operand has 223 places, 438 transitions, 7542 flow. Second operand 6 states and 134 transitions. [2024-05-12 12:26:08,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 464 transitions, 8580 flow [2024-05-12 12:26:09,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 464 transitions, 8465 flow, removed 28 selfloop flow, removed 4 redundant places. [2024-05-12 12:26:09,710 INFO L231 Difference]: Finished difference. Result has 225 places, 438 transitions, 7526 flow [2024-05-12 12:26:09,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7427, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7526, PETRI_PLACES=225, PETRI_TRANSITIONS=438} [2024-05-12 12:26:09,720 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 173 predicate places. [2024-05-12 12:26:09,720 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 438 transitions, 7526 flow [2024-05-12 12:26:09,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 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-05-12 12:26:09,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:26:09,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:26:09,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:26:09,721 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:26:09,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:26:09,721 INFO L85 PathProgramCache]: Analyzing trace with hash -184279191, now seen corresponding path program 1 times [2024-05-12 12:26:09,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:26:09,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942035568] [2024-05-12 12:26:09,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:26:09,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:26:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:26:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:26:18,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:26:18,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942035568] [2024-05-12 12:26:18,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942035568] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:26:18,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:26:18,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:26:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233126326] [2024-05-12 12:26:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:26:18,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:26:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:26:18,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:26:18,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:26:18,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:26:18,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 438 transitions, 7526 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:26:18,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:26:18,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:26:18,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:26:23,941 INFO L124 PetriNetUnfolderBase]: 11839/17975 cut-off events. [2024-05-12 12:26:23,941 INFO L125 PetriNetUnfolderBase]: For 559803/559803 co-relation queries the response was YES. [2024-05-12 12:26:24,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133810 conditions, 17975 events. 11839/17975 cut-off events. For 559803/559803 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 120687 event pairs, 4524 based on Foata normal form. 2/17723 useless extension candidates. Maximal degree in co-relation 133699. Up to 17155 conditions per place. [2024-05-12 12:26:24,174 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 429 selfloop transitions, 24 changer transitions 0/460 dead transitions. [2024-05-12 12:26:24,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 460 transitions, 8584 flow [2024-05-12 12:26:24,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:26:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:26:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-05-12 12:26:24,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4492753623188406 [2024-05-12 12:26:24,176 INFO L175 Difference]: Start difference. First operand has 225 places, 438 transitions, 7526 flow. Second operand 6 states and 124 transitions. [2024-05-12 12:26:24,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 460 transitions, 8584 flow [2024-05-12 12:26:25,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 460 transitions, 8490 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-05-12 12:26:25,666 INFO L231 Difference]: Finished difference. Result has 226 places, 441 transitions, 7568 flow [2024-05-12 12:26:25,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7432, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=7568, PETRI_PLACES=226, PETRI_TRANSITIONS=441} [2024-05-12 12:26:25,668 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 174 predicate places. [2024-05-12 12:26:25,668 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 441 transitions, 7568 flow [2024-05-12 12:26:25,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:26:25,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:26:25,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:26:25,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:26:25,669 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:26:25,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:26:25,670 INFO L85 PathProgramCache]: Analyzing trace with hash 670749039, now seen corresponding path program 1 times [2024-05-12 12:26:25,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:26:25,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908472186] [2024-05-12 12:26:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:26:25,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:26:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:26:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:26:34,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:26:34,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908472186] [2024-05-12 12:26:34,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908472186] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:26:34,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:26:34,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:26:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124278204] [2024-05-12 12:26:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:26:34,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:26:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:26:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:26:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:26:34,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-05-12 12:26:34,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 441 transitions, 7568 flow. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:26:34,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:26:34,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-05-12 12:26:34,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:26:39,710 INFO L124 PetriNetUnfolderBase]: 11963/18161 cut-off events. [2024-05-12 12:26:39,712 INFO L125 PetriNetUnfolderBase]: For 584564/584564 co-relation queries the response was YES. [2024-05-12 12:26:39,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136736 conditions, 18161 events. 11963/18161 cut-off events. For 584564/584564 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 122734 event pairs, 3291 based on Foata normal form. 3/17904 useless extension candidates. Maximal degree in co-relation 136624. Up to 16323 conditions per place. [2024-05-12 12:26:39,974 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 401 selfloop transitions, 124 changer transitions 0/532 dead transitions. [2024-05-12 12:26:39,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 532 transitions, 9726 flow [2024-05-12 12:26:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:26:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:26:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2024-05-12 12:26:39,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152173913043478 [2024-05-12 12:26:39,985 INFO L175 Difference]: Start difference. First operand has 226 places, 441 transitions, 7568 flow. Second operand 10 states and 237 transitions. [2024-05-12 12:26:39,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 532 transitions, 9726 flow [2024-05-12 12:26:42,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 532 transitions, 9614 flow, removed 34 selfloop flow, removed 4 redundant places. [2024-05-12 12:26:42,102 INFO L231 Difference]: Finished difference. Result has 233 places, 454 transitions, 8119 flow [2024-05-12 12:26:42,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=7456, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=115, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8119, PETRI_PLACES=233, PETRI_TRANSITIONS=454} [2024-05-12 12:26:42,103 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 181 predicate places. [2024-05-12 12:26:42,103 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 454 transitions, 8119 flow [2024-05-12 12:26:42,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 10 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:26:42,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:26:42,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:26:42,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:26:42,104 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 6 more)] === [2024-05-12 12:26:42,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:26:42,104 INFO L85 PathProgramCache]: Analyzing trace with hash 670988359, now seen corresponding path program 1 times [2024-05-12 12:26:42,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:26:42,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413192940] [2024-05-12 12:26:42,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:26:42,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:26:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat