./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe022_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/safe022_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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/safe022_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:20:12,447 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 12:20:12,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 12:20:12,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 12:20:12,510 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 12:20:12,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 12:20:12,536 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 12:20:12,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 12:20:12,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 12:20:12,540 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 12:20:12,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 12:20:12,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 12:20:12,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 12:20:12,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 12:20:12,543 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 12:20:12,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 12:20:12,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 12:20:12,543 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 12:20:12,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 12:20:12,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 12:20:12,551 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 12:20:12,551 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 12:20:12,551 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 12:20:12,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 12:20:12,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 12:20:12,552 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 12:20:12,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 12:20:12,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 12:20:12,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 12:20:12,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 12:20:12,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 12:20:12,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 12:20:12,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:20:12,554 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 12:20:12,554 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 12:20:12,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 12:20:12,555 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 12:20:12,555 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 12:20:12,555 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 12:20:12,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 12:20:12,555 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 12:20:12,556 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 12:20:12,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 12:20:12,556 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:20:12,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 12:20:12,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 12:20:12,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 12:20:12,782 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 12:20:12,782 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 12:20:12,783 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 12:20:13,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 12:20:13,982 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 12:20:13,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 12:20:14,002 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066fab8a6/6e18f292155b468bb8208fce364593fe/FLAG665e9b6fc [2024-05-12 12:20:14,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/066fab8a6/6e18f292155b468bb8208fce364593fe [2024-05-12 12:20:14,017 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 12:20:14,017 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 12:20:14,018 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.yml/witness.yml [2024-05-12 12:20:14,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 12:20:14,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 12:20:14,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 12:20:14,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 12:20:14,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 12:20:14,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:20:14" (1/2) ... [2024-05-12 12:20:14,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c492218 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:20:14, skipping insertion in model container [2024-05-12 12:20:14,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 12:20:14" (1/2) ... [2024-05-12 12:20:14,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5869e374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 12:20:14, skipping insertion in model container [2024-05-12 12:20:14,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:20:14" (2/2) ... [2024-05-12 12:20:14,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c492218 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14, skipping insertion in model container [2024-05-12 12:20:14,155 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:20:14" (2/2) ... [2024-05-12 12:20:14,155 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 12:20:14,209 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 12:20:14,210 INFO L97 edCorrectnessWitness]: Location invariant before [L811-L811] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_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_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$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_thd1) + (long long )y$w_buff0 >= 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$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_buff1_thd0) + (long long )y$r_buff1_thd2 >= 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_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 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$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 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_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$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_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$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_buff1_thd0 + (long long )y$r_buff1_thd2 >= 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$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$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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 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) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:20:14,211 INFO L97 edCorrectnessWitness]: Location invariant before [L810-L810] (((((((((((((((! multithreaded || ((0 <= y$w_buff0 && y$w_buff0 <= 1) && (y$w_buff0 == 0 || y$w_buff0 == 1))) && (! multithreaded || y$read_delayed == (_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_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$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_thd1) + (long long )y$w_buff0 >= 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$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_buff1_thd0) + (long long )y$r_buff1_thd2 >= 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_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 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$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$w_buff0) + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd2 >= 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_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd2 >= 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_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$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_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$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_buff1_thd0 + (long long )y$r_buff1_thd2 >= 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$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$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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd2 >= 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) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )x) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$w_buff1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$w_buff0 >= 0LL) && (1LL + (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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd2) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$read_delayed) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff0 >= 0LL) && (2LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL) && (2LL - (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_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd2 >= 0LL) && (long long )__unbuffered_p1_EBX - (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_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd2 >= 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_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$read_delayed >= 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$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$read_delayed >= 0LL) && (long long )y$r_buff1_thd2 - (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_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd2 >= 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_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd2 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || y$r_buff1_thd2 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd2 == (_Bool)0)) && (! multithreaded || ((((((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EAX <= 1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y <= 1) && y$mem_tmp <= 1) && y$w_buff0 <= 1) && y$w_buff1 <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd2 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd2 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1)) && (y$w_buff0 == 0 || y$w_buff0 == 1)) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || y$read_delayed_var == 0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y$w_buff1 && y$w_buff1 <= 1) && (y$w_buff1 == 0 || y$w_buff1 == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || ((0 <= y && y <= 1) && (y == 0 || y == 1)))) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || ((0 <= __unbuffered_p1_EAX && __unbuffered_p1_EAX <= 1) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)))) && (! multithreaded || ((0 <= y$mem_tmp && y$mem_tmp <= 1) && (y$mem_tmp == 0 || y$mem_tmp == 1)))) && (! multithreaded || 0 <= __unbuffered_cnt) [2024-05-12 12:20:14,212 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 12:20:14,212 INFO L106 edCorrectnessWitness]: ghost_update [L808-L808] multithreaded = 1; [2024-05-12 12:20:14,252 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 12:20:14,410 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2024-05-12 12:20:14,577 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:20:14,583 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-05-12 12:20:14,611 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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 12:20:14,874 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 12:20:14,922 INFO L206 MainTranslator]: Completed translation [2024-05-12 12:20:14,923 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14 WrapperNode [2024-05-12 12:20:14,923 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 12:20:14,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 12:20:14,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 12:20:14,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 12:20:14,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:14,968 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,031 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-05-12 12:20:15,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 12:20:15,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 12:20:15,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 12:20:15,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 12:20:15,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,104 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 12:20:15,104 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,127 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,130 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,144 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 12:20:15,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 12:20:15,156 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 12:20:15,156 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 12:20:15,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (1/1) ... [2024-05-12 12:20:15,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 12:20:15,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 12:20:15,185 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:20:15,205 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:20:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 12:20:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 12:20:15,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 12:20:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 12:20:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 12:20:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 12:20:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 12:20:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-05-12 12:20:15,220 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-05-12 12:20:15,220 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-05-12 12:20:15,221 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-05-12 12:20:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 12:20:15,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 12:20:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 12:20:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 12:20:15,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 12:20:15,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 12:20:15,224 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:20:15,351 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 12:20:15,353 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 12:20:15,994 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 12:20:15,994 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 12:20:16,142 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 12:20:16,143 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-12 12:20:16,144 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:20:16 BoogieIcfgContainer [2024-05-12 12:20:16,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 12:20:16,147 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 12:20:16,147 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 12:20:16,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 12:20:16,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 12:20:14" (1/4) ... [2024-05-12 12:20:16,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd648b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 12:20:16, skipping insertion in model container [2024-05-12 12:20:16,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 12:20:14" (2/4) ... [2024-05-12 12:20:16,154 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd648b9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:20:16, skipping insertion in model container [2024-05-12 12:20:16,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 12:20:14" (3/4) ... [2024-05-12 12:20:16,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd648b9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 12:20:16, skipping insertion in model container [2024-05-12 12:20:16,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 12:20:16" (4/4) ... [2024-05-12 12:20:16,156 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2024-05-12 12:20:16,170 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 12:20:16,170 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-12 12:20:16,170 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 12:20:16,230 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 12:20:16,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 12:20:16,299 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2024-05-12 12:20:16,300 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:20:16,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 34 events. 1/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 32. Up to 2 conditions per place. [2024-05-12 12:20:16,303 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 36 transitions, 80 flow [2024-05-12 12:20:16,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 34 transitions, 74 flow [2024-05-12 12:20:16,317 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 12:20:16,326 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;@323aca6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 12:20:16,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-05-12 12:20:16,330 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 12:20:16,331 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 12:20:16,331 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 12:20:16,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:16,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:20:16,332 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:16,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:16,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1016484713, now seen corresponding path program 1 times [2024-05-12 12:20:16,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:16,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307365551] [2024-05-12 12:20:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:16,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:16,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:16,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307365551] [2024-05-12 12:20:16,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307365551] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:16,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:16,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:20:16,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514101020] [2024-05-12 12:20:16,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:16,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:20:16,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:16,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:20:16,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:20:16,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 36 [2024-05-12 12:20:16,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:16,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:16,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 36 [2024-05-12 12:20:16,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:16,835 INFO L124 PetriNetUnfolderBase]: 138/332 cut-off events. [2024-05-12 12:20:16,835 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-05-12 12:20:16,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 332 events. 138/332 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1650 event pairs, 15 based on Foata normal form. 16/338 useless extension candidates. Maximal degree in co-relation 581. Up to 205 conditions per place. [2024-05-12 12:20:16,838 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 25 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2024-05-12 12:20:16,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 153 flow [2024-05-12 12:20:16,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:20:16,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:20:16,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-05-12 12:20:16,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7407407407407407 [2024-05-12 12:20:16,849 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 74 flow. Second operand 3 states and 80 transitions. [2024-05-12 12:20:16,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 153 flow [2024-05-12 12:20:16,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:20:16,853 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 70 flow [2024-05-12 12:20:16,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-05-12 12:20:16,857 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-05-12 12:20:16,857 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 70 flow [2024-05-12 12:20:16,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:16,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:16,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 12:20:16,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 12:20:16,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:16,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1016484276, now seen corresponding path program 1 times [2024-05-12 12:20:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296351468] [2024-05-12 12:20:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:16,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:20,429 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:20,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296351468] [2024-05-12 12:20:20,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296351468] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:20,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:20,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 12:20:20,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023780518] [2024-05-12 12:20:20,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:20,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 12:20:20,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:20,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 12:20:20,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 12:20:20,470 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-05-12 12:20:20,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:20,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:20,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-05-12 12:20:20,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:20,698 INFO L124 PetriNetUnfolderBase]: 278/500 cut-off events. [2024-05-12 12:20:20,698 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-05-12 12:20:20,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 500 events. 278/500 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2371 event pairs, 83 based on Foata normal form. 3/492 useless extension candidates. Maximal degree in co-relation 1015. Up to 453 conditions per place. [2024-05-12 12:20:20,704 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 30 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2024-05-12 12:20:20,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 162 flow [2024-05-12 12:20:20,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 12:20:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 12:20:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-05-12 12:20:20,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6296296296296297 [2024-05-12 12:20:20,708 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 70 flow. Second operand 3 states and 68 transitions. [2024-05-12 12:20:20,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 162 flow [2024-05-12 12:20:20,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 42 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 12:20:20,710 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 87 flow [2024-05-12 12:20:20,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2024-05-12 12:20:20,713 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2024-05-12 12:20:20,714 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 87 flow [2024-05-12 12:20:20,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:20,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:20,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:20,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 12:20:20,719 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:20,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1884229176, now seen corresponding path program 1 times [2024-05-12 12:20:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:20,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570494843] [2024-05-12 12:20:20,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:20,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:23,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:23,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570494843] [2024-05-12 12:20:23,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570494843] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:23,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:23,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 12:20:23,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663549960] [2024-05-12 12:20:23,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:23,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:20:23,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:23,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:20:23,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:20:23,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 36 [2024-05-12 12:20:23,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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:23,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:23,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 36 [2024-05-12 12:20:23,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:24,207 INFO L124 PetriNetUnfolderBase]: 296/620 cut-off events. [2024-05-12 12:20:24,207 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-05-12 12:20:24,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1271 conditions, 620 events. 296/620 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3210 event pairs, 117 based on Foata normal form. 4/590 useless extension candidates. Maximal degree in co-relation 1256. Up to 470 conditions per place. [2024-05-12 12:20:24,211 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 37 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2024-05-12 12:20:24,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 220 flow [2024-05-12 12:20:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:20:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:20:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-05-12 12:20:24,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2024-05-12 12:20:24,213 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 87 flow. Second operand 4 states and 87 transitions. [2024-05-12 12:20:24,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 220 flow [2024-05-12 12:20:24,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 12:20:24,215 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 131 flow [2024-05-12 12:20:24,215 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-05-12 12:20:24,216 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2024-05-12 12:20:24,216 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 131 flow [2024-05-12 12:20:24,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 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,216 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:24,216 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:24,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 12:20:24,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:24,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:24,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1730054795, now seen corresponding path program 1 times [2024-05-12 12:20:24,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:24,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850878791] [2024-05-12 12:20:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:24,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:27,018 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:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:27,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850878791] [2024-05-12 12:20:27,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850878791] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:27,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:27,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:20:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336800071] [2024-05-12 12:20:27,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:27,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:20:27,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:27,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:20:27,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:20:27,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:20:27,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:27,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:27,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:20:27,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:27,334 INFO L124 PetriNetUnfolderBase]: 355/728 cut-off events. [2024-05-12 12:20:27,334 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2024-05-12 12:20:27,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1718 conditions, 728 events. 355/728 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3788 event pairs, 129 based on Foata normal form. 2/691 useless extension candidates. Maximal degree in co-relation 1700. Up to 568 conditions per place. [2024-05-12 12:20:27,339 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 48 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2024-05-12 12:20:27,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 317 flow [2024-05-12 12:20:27,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:20:27,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:20:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-05-12 12:20:27,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2024-05-12 12:20:27,343 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 131 flow. Second operand 5 states and 101 transitions. [2024-05-12 12:20:27,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 317 flow [2024-05-12 12:20:27,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 308 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-05-12 12:20:27,347 INFO L231 Difference]: Finished difference. Result has 49 places, 45 transitions, 188 flow [2024-05-12 12:20:27,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=188, PETRI_PLACES=49, PETRI_TRANSITIONS=45} [2024-05-12 12:20:27,348 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2024-05-12 12:20:27,349 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 45 transitions, 188 flow [2024-05-12 12:20:27,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:27,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:27,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:27,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 12:20:27,349 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:27,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:27,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2092089679, now seen corresponding path program 1 times [2024-05-12 12:20:27,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:27,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260840143] [2024-05-12 12:20:27,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:27,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:30,222 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:30,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:30,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260840143] [2024-05-12 12:20:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260840143] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:30,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:20:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60628528] [2024-05-12 12:20:30,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:30,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 12:20:30,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:30,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 12:20:30,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 12:20:30,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:20:30,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 45 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:30,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:30,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:20:30,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:30,617 INFO L124 PetriNetUnfolderBase]: 352/639 cut-off events. [2024-05-12 12:20:30,618 INFO L125 PetriNetUnfolderBase]: For 478/478 co-relation queries the response was YES. [2024-05-12 12:20:30,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1762 conditions, 639 events. 352/639 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3036 event pairs, 75 based on Foata normal form. 2/630 useless extension candidates. Maximal degree in co-relation 1740. Up to 538 conditions per place. [2024-05-12 12:20:30,622 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 57 selfloop transitions, 15 changer transitions 0/80 dead transitions. [2024-05-12 12:20:30,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 80 transitions, 432 flow [2024-05-12 12:20:30,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:20:30,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:20:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 121 transitions. [2024-05-12 12:20:30,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5601851851851852 [2024-05-12 12:20:30,627 INFO L175 Difference]: Start difference. First operand has 49 places, 45 transitions, 188 flow. Second operand 6 states and 121 transitions. [2024-05-12 12:20:30,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 80 transitions, 432 flow [2024-05-12 12:20:30,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 80 transitions, 432 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-05-12 12:20:30,632 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 285 flow [2024-05-12 12:20:30,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2024-05-12 12:20:30,634 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2024-05-12 12:20:30,634 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 285 flow [2024-05-12 12:20:30,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:30,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:30,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:30,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 12:20:30,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:30,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:30,635 INFO L85 PathProgramCache]: Analyzing trace with hash -430269164, now seen corresponding path program 1 times [2024-05-12 12:20:30,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:30,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317396966] [2024-05-12 12:20:30,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:30,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:33,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:33,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317396966] [2024-05-12 12:20:33,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317396966] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:33,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:33,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 12:20:33,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580601189] [2024-05-12 12:20:33,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:33,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:20:33,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:33,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:20:33,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:20:33,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:20:33,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 285 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 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,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:33,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:20:33,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:34,018 INFO L124 PetriNetUnfolderBase]: 355/719 cut-off events. [2024-05-12 12:20:34,019 INFO L125 PetriNetUnfolderBase]: For 853/853 co-relation queries the response was YES. [2024-05-12 12:20:34,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 719 events. 355/719 cut-off events. For 853/853 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3697 event pairs, 60 based on Foata normal form. 4/687 useless extension candidates. Maximal degree in co-relation 2083. Up to 523 conditions per place. [2024-05-12 12:20:34,024 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 67 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2024-05-12 12:20:34,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 527 flow [2024-05-12 12:20:34,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:20:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:20:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-05-12 12:20:34,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2024-05-12 12:20:34,025 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 285 flow. Second operand 7 states and 135 transitions. [2024-05-12 12:20:34,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 527 flow [2024-05-12 12:20:34,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 519 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-05-12 12:20:34,031 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 320 flow [2024-05-12 12:20:34,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=320, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2024-05-12 12:20:34,033 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 25 predicate places. [2024-05-12 12:20:34,033 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 320 flow [2024-05-12 12:20:34,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:34,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:34,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:34,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 12:20:34,034 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:34,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 215998858, now seen corresponding path program 1 times [2024-05-12 12:20:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:34,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876974651] [2024-05-12 12:20:34,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:34,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:20:39,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:39,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876974651] [2024-05-12 12:20:39,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876974651] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:39,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:39,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:20:39,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308087604] [2024-05-12 12:20:39,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:39,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:20:39,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:39,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:20:39,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:20:39,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:20:39,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 320 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:39,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:39,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:20:39,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:39,645 INFO L124 PetriNetUnfolderBase]: 481/928 cut-off events. [2024-05-12 12:20:39,645 INFO L125 PetriNetUnfolderBase]: For 1245/1245 co-relation queries the response was YES. [2024-05-12 12:20:39,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 928 events. 481/928 cut-off events. For 1245/1245 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4815 event pairs, 115 based on Foata normal form. 3/893 useless extension candidates. Maximal degree in co-relation 2809. Up to 634 conditions per place. [2024-05-12 12:20:39,651 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 70 selfloop transitions, 16 changer transitions 0/93 dead transitions. [2024-05-12 12:20:39,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 612 flow [2024-05-12 12:20:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:20:39,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:20:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-05-12 12:20:39,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-05-12 12:20:39,653 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 320 flow. Second operand 7 states and 133 transitions. [2024-05-12 12:20:39,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 612 flow [2024-05-12 12:20:39,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 593 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-05-12 12:20:39,658 INFO L231 Difference]: Finished difference. Result has 68 places, 59 transitions, 366 flow [2024-05-12 12:20:39,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2024-05-12 12:20:39,659 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2024-05-12 12:20:39,660 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 366 flow [2024-05-12 12:20:39,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:39,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:39,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:39,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 12:20:39,660 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:39,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash 376711276, now seen corresponding path program 2 times [2024-05-12 12:20:39,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:39,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665908534] [2024-05-12 12:20:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:44,531 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:44,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:44,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665908534] [2024-05-12 12:20:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665908534] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:44,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:44,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:20:44,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244165198] [2024-05-12 12:20:44,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:44,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:20:44,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:44,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:20:44,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:20:44,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:20:44,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 366 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:44,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:44,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:20:44,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:45,209 INFO L124 PetriNetUnfolderBase]: 547/1045 cut-off events. [2024-05-12 12:20:45,209 INFO L125 PetriNetUnfolderBase]: For 1851/1851 co-relation queries the response was YES. [2024-05-12 12:20:45,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3389 conditions, 1045 events. 547/1045 cut-off events. For 1851/1851 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5558 event pairs, 120 based on Foata normal form. 3/1005 useless extension candidates. Maximal degree in co-relation 3355. Up to 764 conditions per place. [2024-05-12 12:20:45,215 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 71 selfloop transitions, 15 changer transitions 0/93 dead transitions. [2024-05-12 12:20:45,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 93 transitions, 644 flow [2024-05-12 12:20:45,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:20:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:20:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 128 transitions. [2024-05-12 12:20:45,217 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5079365079365079 [2024-05-12 12:20:45,217 INFO L175 Difference]: Start difference. First operand has 68 places, 59 transitions, 366 flow. Second operand 7 states and 128 transitions. [2024-05-12 12:20:45,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 93 transitions, 644 flow [2024-05-12 12:20:45,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 93 transitions, 621 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-05-12 12:20:45,221 INFO L231 Difference]: Finished difference. Result has 72 places, 63 transitions, 412 flow [2024-05-12 12:20:45,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=412, PETRI_PLACES=72, PETRI_TRANSITIONS=63} [2024-05-12 12:20:45,222 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2024-05-12 12:20:45,222 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 63 transitions, 412 flow [2024-05-12 12:20:45,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:45,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:45,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:45,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 12:20:45,223 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:45,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1993031104, now seen corresponding path program 1 times [2024-05-12 12:20:45,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:45,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094468568] [2024-05-12 12:20:45,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:49,621 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:49,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:49,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094468568] [2024-05-12 12:20:49,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094468568] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:49,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:49,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:20:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682236209] [2024-05-12 12:20:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:49,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:20:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:49,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:20:49,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:20:49,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:20:49,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 63 transitions, 412 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:49,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:49,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:20:49,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:50,121 INFO L124 PetriNetUnfolderBase]: 549/1050 cut-off events. [2024-05-12 12:20:50,121 INFO L125 PetriNetUnfolderBase]: For 2029/2029 co-relation queries the response was YES. [2024-05-12 12:20:50,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3518 conditions, 1050 events. 549/1050 cut-off events. For 2029/2029 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5661 event pairs, 104 based on Foata normal form. 2/1009 useless extension candidates. Maximal degree in co-relation 3482. Up to 775 conditions per place. [2024-05-12 12:20:50,129 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 62 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2024-05-12 12:20:50,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 85 transitions, 640 flow [2024-05-12 12:20:50,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:20:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:20:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2024-05-12 12:20:50,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5222222222222223 [2024-05-12 12:20:50,130 INFO L175 Difference]: Start difference. First operand has 72 places, 63 transitions, 412 flow. Second operand 5 states and 94 transitions. [2024-05-12 12:20:50,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 85 transitions, 640 flow [2024-05-12 12:20:50,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 85 transitions, 605 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 12:20:50,135 INFO L231 Difference]: Finished difference. Result has 74 places, 68 transitions, 469 flow [2024-05-12 12:20:50,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=74, PETRI_TRANSITIONS=68} [2024-05-12 12:20:50,136 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2024-05-12 12:20:50,136 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 68 transitions, 469 flow [2024-05-12 12:20:50,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:50,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:50,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:50,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 12:20:50,138 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:50,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:50,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1411823596, now seen corresponding path program 3 times [2024-05-12 12:20:50,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:50,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821114704] [2024-05-12 12:20:50,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:50,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:20:54,527 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,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:20:54,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821114704] [2024-05-12 12:20:54,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821114704] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:20:54,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:20:54,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:20:54,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844764212] [2024-05-12 12:20:54,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:20:54,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:20:54,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:20:54,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:20:54,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:20:54,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:20:54,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 68 transitions, 469 flow. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:54,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:20:54,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:20:54,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:20:55,087 INFO L124 PetriNetUnfolderBase]: 543/1040 cut-off events. [2024-05-12 12:20:55,087 INFO L125 PetriNetUnfolderBase]: For 2402/2402 co-relation queries the response was YES. [2024-05-12 12:20:55,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3647 conditions, 1040 events. 543/1040 cut-off events. For 2402/2402 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5641 event pairs, 129 based on Foata normal form. 3/1000 useless extension candidates. Maximal degree in co-relation 3609. Up to 775 conditions per place. [2024-05-12 12:20:55,094 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 72 selfloop transitions, 15 changer transitions 0/94 dead transitions. [2024-05-12 12:20:55,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 94 transitions, 713 flow [2024-05-12 12:20:55,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:20:55,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:20:55,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-05-12 12:20:55,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-05-12 12:20:55,095 INFO L175 Difference]: Start difference. First operand has 74 places, 68 transitions, 469 flow. Second operand 6 states and 114 transitions. [2024-05-12 12:20:55,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 94 transitions, 713 flow [2024-05-12 12:20:55,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 94 transitions, 693 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-05-12 12:20:55,102 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 487 flow [2024-05-12 12:20:55,103 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2024-05-12 12:20:55,104 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2024-05-12 12:20:55,104 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 487 flow [2024-05-12 12:20:55,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:20:55,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:20:55,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:20:55,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-12 12:20:55,105 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:20:55,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:20:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1993021215, now seen corresponding path program 1 times [2024-05-12 12:20:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:20:55,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045525857] [2024-05-12 12:20:55,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:20:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:20:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:01,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:01,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045525857] [2024-05-12 12:21:01,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045525857] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:01,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:01,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:21:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472756865] [2024-05-12 12:21:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:01,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:21:01,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:01,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:21:01,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:21:01,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:01,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 487 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:01,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:01,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:01,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:01,657 INFO L124 PetriNetUnfolderBase]: 540/1054 cut-off events. [2024-05-12 12:21:01,657 INFO L125 PetriNetUnfolderBase]: For 3003/3003 co-relation queries the response was YES. [2024-05-12 12:21:01,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3694 conditions, 1054 events. 540/1054 cut-off events. For 3003/3003 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5742 event pairs, 164 based on Foata normal form. 2/1015 useless extension candidates. Maximal degree in co-relation 3654. Up to 828 conditions per place. [2024-05-12 12:21:01,664 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 66 selfloop transitions, 10 changer transitions 0/83 dead transitions. [2024-05-12 12:21:01,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 677 flow [2024-05-12 12:21:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:21:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:21:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2024-05-12 12:21:01,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2024-05-12 12:21:01,666 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 487 flow. Second operand 5 states and 88 transitions. [2024-05-12 12:21:01,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 677 flow [2024-05-12 12:21:01,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 83 transitions, 640 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-05-12 12:21:01,671 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 475 flow [2024-05-12 12:21:01,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=475, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2024-05-12 12:21:01,673 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 38 predicate places. [2024-05-12 12:21:01,673 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 475 flow [2024-05-12 12:21:01,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:01,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:01,673 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:01,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-12 12:21:01,674 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:01,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1210660348, now seen corresponding path program 1 times [2024-05-12 12:21:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:01,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082229775] [2024-05-12 12:21:01,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:01,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:07,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:21:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082229775] [2024-05-12 12:21:07,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082229775] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:07,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:07,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:21:07,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34482164] [2024-05-12 12:21:07,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:07,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:21:07,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:21:07,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:21:07,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:07,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 475 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:07,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:07,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:07,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:08,508 INFO L124 PetriNetUnfolderBase]: 602/1113 cut-off events. [2024-05-12 12:21:08,509 INFO L125 PetriNetUnfolderBase]: For 3138/3138 co-relation queries the response was YES. [2024-05-12 12:21:08,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3915 conditions, 1113 events. 602/1113 cut-off events. For 3138/3138 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5982 event pairs, 110 based on Foata normal form. 3/1080 useless extension candidates. Maximal degree in co-relation 3874. Up to 632 conditions per place. [2024-05-12 12:21:08,515 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 88 selfloop transitions, 28 changer transitions 0/123 dead transitions. [2024-05-12 12:21:08,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 123 transitions, 895 flow [2024-05-12 12:21:08,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:21:08,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:21:08,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-05-12 12:21:08,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5339506172839507 [2024-05-12 12:21:08,517 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 475 flow. Second operand 9 states and 173 transitions. [2024-05-12 12:21:08,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 123 transitions, 895 flow [2024-05-12 12:21:08,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 123 transitions, 876 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-05-12 12:21:08,524 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 571 flow [2024-05-12 12:21:08,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=571, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2024-05-12 12:21:08,525 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 45 predicate places. [2024-05-12 12:21:08,525 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 571 flow [2024-05-12 12:21:08,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:08,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:08,526 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:08,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-12 12:21:08,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:08,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:08,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1206851068, now seen corresponding path program 2 times [2024-05-12 12:21:08,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:08,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43639825] [2024-05-12 12:21:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:08,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:14,113 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:14,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:14,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43639825] [2024-05-12 12:21:14,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43639825] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:14,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:14,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:21:14,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690859629] [2024-05-12 12:21:14,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:14,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:21:14,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:14,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:21:14,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:21:14,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:14,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 571 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:14,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:14,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:14,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:14,835 INFO L124 PetriNetUnfolderBase]: 635/1179 cut-off events. [2024-05-12 12:21:14,835 INFO L125 PetriNetUnfolderBase]: For 4117/4117 co-relation queries the response was YES. [2024-05-12 12:21:14,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4605 conditions, 1179 events. 635/1179 cut-off events. For 4117/4117 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6425 event pairs, 131 based on Foata normal form. 3/1140 useless extension candidates. Maximal degree in co-relation 4562. Up to 862 conditions per place. [2024-05-12 12:21:14,843 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 88 selfloop transitions, 18 changer transitions 0/113 dead transitions. [2024-05-12 12:21:14,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 113 transitions, 920 flow [2024-05-12 12:21:14,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:21:14,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:21:14,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 146 transitions. [2024-05-12 12:21:14,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5069444444444444 [2024-05-12 12:21:14,844 INFO L175 Difference]: Start difference. First operand has 85 places, 74 transitions, 571 flow. Second operand 8 states and 146 transitions. [2024-05-12 12:21:14,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 113 transitions, 920 flow [2024-05-12 12:21:14,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 113 transitions, 879 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 12:21:14,852 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 605 flow [2024-05-12 12:21:14,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=605, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2024-05-12 12:21:14,853 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2024-05-12 12:21:14,853 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 605 flow [2024-05-12 12:21:14,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:14,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:14,853 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:14,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-12 12:21:14,853 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:14,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1654420847, now seen corresponding path program 1 times [2024-05-12 12:21:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:14,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138996075] [2024-05-12 12:21:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:19,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:19,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138996075] [2024-05-12 12:21:19,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138996075] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:19,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:19,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:21:19,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575001520] [2024-05-12 12:21:19,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:19,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:21:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:19,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:21:19,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:21:19,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:19,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 605 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:19,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:19,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:19,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:19,848 INFO L124 PetriNetUnfolderBase]: 637/1208 cut-off events. [2024-05-12 12:21:19,849 INFO L125 PetriNetUnfolderBase]: For 4234/4234 co-relation queries the response was YES. [2024-05-12 12:21:19,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4732 conditions, 1208 events. 637/1208 cut-off events. For 4234/4234 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6733 event pairs, 134 based on Foata normal form. 2/1159 useless extension candidates. Maximal degree in co-relation 4687. Up to 855 conditions per place. [2024-05-12 12:21:19,856 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 78 selfloop transitions, 21 changer transitions 0/106 dead transitions. [2024-05-12 12:21:19,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 106 transitions, 903 flow [2024-05-12 12:21:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:21:19,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:21:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2024-05-12 12:21:19,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2024-05-12 12:21:19,858 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 605 flow. Second operand 6 states and 116 transitions. [2024-05-12 12:21:19,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 106 transitions, 903 flow [2024-05-12 12:21:19,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 106 transitions, 863 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 12:21:19,866 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 642 flow [2024-05-12 12:21:19,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2024-05-12 12:21:19,868 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 48 predicate places. [2024-05-12 12:21:19,868 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 642 flow [2024-05-12 12:21:19,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:19,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:19,869 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:19,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-12 12:21:19,869 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:19,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1662671962, now seen corresponding path program 3 times [2024-05-12 12:21:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136973339] [2024-05-12 12:21:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:24,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:21:24,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:24,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136973339] [2024-05-12 12:21:24,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136973339] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:24,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:24,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:21:24,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855664560] [2024-05-12 12:21:24,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:24,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:21:24,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:24,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:21:24,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:21:24,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:24,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 642 flow. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:24,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:24,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:24,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:25,235 INFO L124 PetriNetUnfolderBase]: 631/1177 cut-off events. [2024-05-12 12:21:25,235 INFO L125 PetriNetUnfolderBase]: For 4439/4439 co-relation queries the response was YES. [2024-05-12 12:21:25,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4744 conditions, 1177 events. 631/1177 cut-off events. For 4439/4439 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6449 event pairs, 146 based on Foata normal form. 3/1137 useless extension candidates. Maximal degree in co-relation 4698. Up to 856 conditions per place. [2024-05-12 12:21:25,243 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 87 selfloop transitions, 20 changer transitions 0/114 dead transitions. [2024-05-12 12:21:25,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 114 transitions, 958 flow [2024-05-12 12:21:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:21:25,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:21:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 136 transitions. [2024-05-12 12:21:25,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5396825396825397 [2024-05-12 12:21:25,244 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 642 flow. Second operand 7 states and 136 transitions. [2024-05-12 12:21:25,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 114 transitions, 958 flow [2024-05-12 12:21:25,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 114 transitions, 904 flow, removed 7 selfloop flow, removed 5 redundant places. [2024-05-12 12:21:25,253 INFO L231 Difference]: Finished difference. Result has 90 places, 79 transitions, 637 flow [2024-05-12 12:21:25,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=637, PETRI_PLACES=90, PETRI_TRANSITIONS=79} [2024-05-12 12:21:25,254 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 50 predicate places. [2024-05-12 12:21:25,254 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 79 transitions, 637 flow [2024-05-12 12:21:25,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 9 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:25,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:25,254 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:25,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-12 12:21:25,254 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:25,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1002590099, now seen corresponding path program 1 times [2024-05-12 12:21:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:25,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068543835] [2024-05-12 12:21:25,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:25,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:30,510 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:30,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:30,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068543835] [2024-05-12 12:21:30,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068543835] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:30,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:30,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:21:30,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670210273] [2024-05-12 12:21:30,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:30,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:21:30,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:30,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:21:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:21:30,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:30,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 79 transitions, 637 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:30,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:30,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:30,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:31,235 INFO L124 PetriNetUnfolderBase]: 647/1120 cut-off events. [2024-05-12 12:21:31,235 INFO L125 PetriNetUnfolderBase]: For 4175/4175 co-relation queries the response was YES. [2024-05-12 12:21:31,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4763 conditions, 1120 events. 647/1120 cut-off events. For 4175/4175 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5757 event pairs, 75 based on Foata normal form. 2/1107 useless extension candidates. Maximal degree in co-relation 4717. Up to 766 conditions per place. [2024-05-12 12:21:31,242 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 98 selfloop transitions, 35 changer transitions 0/140 dead transitions. [2024-05-12 12:21:31,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 140 transitions, 1194 flow [2024-05-12 12:21:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:21:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:21:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 12:21:31,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-05-12 12:21:31,253 INFO L175 Difference]: Start difference. First operand has 90 places, 79 transitions, 637 flow. Second operand 9 states and 163 transitions. [2024-05-12 12:21:31,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 140 transitions, 1194 flow [2024-05-12 12:21:31,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 140 transitions, 1134 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-05-12 12:21:31,263 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 870 flow [2024-05-12 12:21:31,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=870, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2024-05-12 12:21:31,263 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 57 predicate places. [2024-05-12 12:21:31,264 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 870 flow [2024-05-12 12:21:31,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:31,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:31,264 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:31,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-12 12:21:31,264 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:31,264 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1124236171, now seen corresponding path program 2 times [2024-05-12 12:21:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:31,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206336283] [2024-05-12 12:21:31,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:31,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:37,258 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:37,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:37,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206336283] [2024-05-12 12:21:37,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206336283] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:37,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:37,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:21:37,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943044219] [2024-05-12 12:21:37,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:37,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:21:37,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:37,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:21:37,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:21:37,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:37,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 870 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:37,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:37,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:37,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:38,031 INFO L124 PetriNetUnfolderBase]: 674/1217 cut-off events. [2024-05-12 12:21:38,031 INFO L125 PetriNetUnfolderBase]: For 5324/5324 co-relation queries the response was YES. [2024-05-12 12:21:38,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5390 conditions, 1217 events. 674/1217 cut-off events. For 5324/5324 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6551 event pairs, 112 based on Foata normal form. 2/1188 useless extension candidates. Maximal degree in co-relation 5339. Up to 707 conditions per place. [2024-05-12 12:21:38,039 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 97 selfloop transitions, 41 changer transitions 0/145 dead transitions. [2024-05-12 12:21:38,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 145 transitions, 1312 flow [2024-05-12 12:21:38,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:21:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:21:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 168 transitions. [2024-05-12 12:21:38,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2024-05-12 12:21:38,041 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 870 flow. Second operand 9 states and 168 transitions. [2024-05-12 12:21:38,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 145 transitions, 1312 flow [2024-05-12 12:21:38,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 145 transitions, 1252 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-05-12 12:21:38,054 INFO L231 Difference]: Finished difference. Result has 103 places, 99 transitions, 936 flow [2024-05-12 12:21:38,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=936, PETRI_PLACES=103, PETRI_TRANSITIONS=99} [2024-05-12 12:21:38,055 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 63 predicate places. [2024-05-12 12:21:38,055 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 99 transitions, 936 flow [2024-05-12 12:21:38,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:38,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:38,055 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:38,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-12 12:21:38,056 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:38,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:38,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1413716423, now seen corresponding path program 1 times [2024-05-12 12:21:38,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:38,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387668715] [2024-05-12 12:21:38,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:38,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:44,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:44,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387668715] [2024-05-12 12:21:44,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387668715] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:44,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:44,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:21:44,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784555800] [2024-05-12 12:21:44,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:44,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:21:44,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:21:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:21:44,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:21:44,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 99 transitions, 936 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:21:44,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:44,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:21:44,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:45,435 INFO L124 PetriNetUnfolderBase]: 604/1123 cut-off events. [2024-05-12 12:21:45,436 INFO L125 PetriNetUnfolderBase]: For 5794/5794 co-relation queries the response was YES. [2024-05-12 12:21:45,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5012 conditions, 1123 events. 604/1123 cut-off events. For 5794/5794 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6287 event pairs, 112 based on Foata normal form. 2/1090 useless extension candidates. Maximal degree in co-relation 4960. Up to 636 conditions per place. [2024-05-12 12:21:45,443 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 95 selfloop transitions, 41 changer transitions 0/144 dead transitions. [2024-05-12 12:21:45,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 144 transitions, 1400 flow [2024-05-12 12:21:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:21:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:21:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 172 transitions. [2024-05-12 12:21:45,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2024-05-12 12:21:45,444 INFO L175 Difference]: Start difference. First operand has 103 places, 99 transitions, 936 flow. Second operand 9 states and 172 transitions. [2024-05-12 12:21:45,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 144 transitions, 1400 flow [2024-05-12 12:21:45,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 144 transitions, 1348 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:45,459 INFO L231 Difference]: Finished difference. Result has 108 places, 103 transitions, 1019 flow [2024-05-12 12:21:45,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1019, PETRI_PLACES=108, PETRI_TRANSITIONS=103} [2024-05-12 12:21:45,460 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 68 predicate places. [2024-05-12 12:21:45,460 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 103 transitions, 1019 flow [2024-05-12 12:21:45,460 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:21:45,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:45,460 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:45,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-05-12 12:21:45,461 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:45,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:45,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1416512933, now seen corresponding path program 2 times [2024-05-12 12:21:45,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:45,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442597856] [2024-05-12 12:21:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:21:50,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:50,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442597856] [2024-05-12 12:21:50,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442597856] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:50,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:50,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:21:50,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594243289] [2024-05-12 12:21:50,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:50,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:21:50,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:21:50,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:21:50,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:50,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 103 transitions, 1019 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:50,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:50,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:50,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:51,484 INFO L124 PetriNetUnfolderBase]: 768/1327 cut-off events. [2024-05-12 12:21:51,484 INFO L125 PetriNetUnfolderBase]: For 7474/7474 co-relation queries the response was YES. [2024-05-12 12:21:51,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6273 conditions, 1327 events. 768/1327 cut-off events. For 7474/7474 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7091 event pairs, 62 based on Foata normal form. 2/1310 useless extension candidates. Maximal degree in co-relation 6219. Up to 821 conditions per place. [2024-05-12 12:21:51,492 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 102 selfloop transitions, 58 changer transitions 0/167 dead transitions. [2024-05-12 12:21:51,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 167 transitions, 1660 flow [2024-05-12 12:21:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:21:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:21:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 185 transitions. [2024-05-12 12:21:51,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-05-12 12:21:51,494 INFO L175 Difference]: Start difference. First operand has 108 places, 103 transitions, 1019 flow. Second operand 10 states and 185 transitions. [2024-05-12 12:21:51,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 167 transitions, 1660 flow [2024-05-12 12:21:51,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 167 transitions, 1603 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 12:21:51,516 INFO L231 Difference]: Finished difference. Result has 115 places, 118 transitions, 1326 flow [2024-05-12 12:21:51,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1326, PETRI_PLACES=115, PETRI_TRANSITIONS=118} [2024-05-12 12:21:51,516 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 75 predicate places. [2024-05-12 12:21:51,516 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 118 transitions, 1326 flow [2024-05-12 12:21:51,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:51,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:51,517 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:51,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-05-12 12:21:51,517 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:51,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1416512809, now seen corresponding path program 3 times [2024-05-12 12:21:51,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:51,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425319024] [2024-05-12 12:21:51,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:51,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:21:57,764 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:57,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:21:57,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425319024] [2024-05-12 12:21:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425319024] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:21:57,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:21:57,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:21:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140177015] [2024-05-12 12:21:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:21:57,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:21:57,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:21:57,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:21:57,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:21:57,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:21:57,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 1326 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:57,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:21:57,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:21:57,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:21:58,632 INFO L124 PetriNetUnfolderBase]: 852/1592 cut-off events. [2024-05-12 12:21:58,633 INFO L125 PetriNetUnfolderBase]: For 11197/11197 co-relation queries the response was YES. [2024-05-12 12:21:58,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7351 conditions, 1592 events. 852/1592 cut-off events. For 11197/11197 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9511 event pairs, 157 based on Foata normal form. 12/1550 useless extension candidates. Maximal degree in co-relation 7293. Up to 971 conditions per place. [2024-05-12 12:21:58,645 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 131 selfloop transitions, 30 changer transitions 0/168 dead transitions. [2024-05-12 12:21:58,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 168 transitions, 1819 flow [2024-05-12 12:21:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:21:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:21:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 170 transitions. [2024-05-12 12:21:58,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5246913580246914 [2024-05-12 12:21:58,647 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 1326 flow. Second operand 9 states and 170 transitions. [2024-05-12 12:21:58,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 168 transitions, 1819 flow [2024-05-12 12:21:58,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 1694 flow, removed 50 selfloop flow, removed 4 redundant places. [2024-05-12 12:21:58,672 INFO L231 Difference]: Finished difference. Result has 120 places, 119 transitions, 1280 flow [2024-05-12 12:21:58,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1280, PETRI_PLACES=120, PETRI_TRANSITIONS=119} [2024-05-12 12:21:58,673 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 80 predicate places. [2024-05-12 12:21:58,673 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 119 transitions, 1280 flow [2024-05-12 12:21:58,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:21:58,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:21:58,674 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:58,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-05-12 12:21:58,674 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:21:58,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:21:58,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1531803979, now seen corresponding path program 4 times [2024-05-12 12:21:58,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:21:58,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6032659] [2024-05-12 12:21:58,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:21:58,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:21:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:03,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:03,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:03,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6032659] [2024-05-12 12:22:03,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6032659] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:03,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:03,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:03,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292982609] [2024-05-12 12:22:03,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:03,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:03,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:03,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:03,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:04,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:22:04,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 119 transitions, 1280 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:04,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:04,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:22:04,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:04,862 INFO L124 PetriNetUnfolderBase]: 952/1764 cut-off events. [2024-05-12 12:22:04,862 INFO L125 PetriNetUnfolderBase]: For 12031/12031 co-relation queries the response was YES. [2024-05-12 12:22:04,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7928 conditions, 1764 events. 952/1764 cut-off events. For 12031/12031 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10735 event pairs, 207 based on Foata normal form. 14/1727 useless extension candidates. Maximal degree in co-relation 7870. Up to 1216 conditions per place. [2024-05-12 12:22:04,874 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 137 selfloop transitions, 23 changer transitions 0/167 dead transitions. [2024-05-12 12:22:04,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 167 transitions, 1771 flow [2024-05-12 12:22:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:04,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 167 transitions. [2024-05-12 12:22:04,875 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5154320987654321 [2024-05-12 12:22:04,875 INFO L175 Difference]: Start difference. First operand has 120 places, 119 transitions, 1280 flow. Second operand 9 states and 167 transitions. [2024-05-12 12:22:04,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 167 transitions, 1771 flow [2024-05-12 12:22:04,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 167 transitions, 1687 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 12:22:04,898 INFO L231 Difference]: Finished difference. Result has 121 places, 120 transitions, 1262 flow [2024-05-12 12:22:04,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1262, PETRI_PLACES=121, PETRI_TRANSITIONS=120} [2024-05-12 12:22:04,899 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 81 predicate places. [2024-05-12 12:22:04,899 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 120 transitions, 1262 flow [2024-05-12 12:22:04,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:04,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:04,900 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,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-05-12 12:22:04,900 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:04,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:04,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1242323975, now seen corresponding path program 3 times [2024-05-12 12:22:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873148805] [2024-05-12 12:22:04,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:04,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:10,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:10,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873148805] [2024-05-12 12:22:10,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873148805] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:10,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:10,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:10,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431935080] [2024-05-12 12:22:10,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:10,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:10,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:10,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:10,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:10,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:22:10,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 120 transitions, 1262 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:10,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:10,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:22:10,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:11,050 INFO L124 PetriNetUnfolderBase]: 974/1828 cut-off events. [2024-05-12 12:22:11,050 INFO L125 PetriNetUnfolderBase]: For 10487/10487 co-relation queries the response was YES. [2024-05-12 12:22:11,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8053 conditions, 1828 events. 974/1828 cut-off events. For 10487/10487 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11276 event pairs, 225 based on Foata normal form. 2/1769 useless extension candidates. Maximal degree in co-relation 7994. Up to 1430 conditions per place. [2024-05-12 12:22:11,060 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 133 selfloop transitions, 24 changer transitions 0/164 dead transitions. [2024-05-12 12:22:11,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 164 transitions, 1724 flow [2024-05-12 12:22:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-05-12 12:22:11,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030864197530864 [2024-05-12 12:22:11,062 INFO L175 Difference]: Start difference. First operand has 121 places, 120 transitions, 1262 flow. Second operand 9 states and 163 transitions. [2024-05-12 12:22:11,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 164 transitions, 1724 flow [2024-05-12 12:22:11,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 164 transitions, 1677 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-05-12 12:22:11,086 INFO L231 Difference]: Finished difference. Result has 123 places, 122 transitions, 1300 flow [2024-05-12 12:22:11,086 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1300, PETRI_PLACES=123, PETRI_TRANSITIONS=122} [2024-05-12 12:22:11,086 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 83 predicate places. [2024-05-12 12:22:11,087 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 122 transitions, 1300 flow [2024-05-12 12:22:11,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:11,087 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:11,087 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:11,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 12:22:11,087 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:11,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:11,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1531988677, now seen corresponding path program 1 times [2024-05-12 12:22:11,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:11,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895780663] [2024-05-12 12:22:11,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:11,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:16,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:16,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895780663] [2024-05-12 12:22:16,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895780663] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:16,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:16,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:16,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725480818] [2024-05-12 12:22:16,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:16,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:16,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:16,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:16,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:16,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:22:16,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 122 transitions, 1300 flow. Second operand has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:16,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:16,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:22:16,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:16,897 INFO L124 PetriNetUnfolderBase]: 1035/1947 cut-off events. [2024-05-12 12:22:16,897 INFO L125 PetriNetUnfolderBase]: For 12162/12162 co-relation queries the response was YES. [2024-05-12 12:22:16,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8693 conditions, 1947 events. 1035/1947 cut-off events. For 12162/12162 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12237 event pairs, 266 based on Foata normal form. 2/1884 useless extension candidates. Maximal degree in co-relation 8633. Up to 1616 conditions per place. [2024-05-12 12:22:16,909 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 135 selfloop transitions, 19 changer transitions 0/161 dead transitions. [2024-05-12 12:22:16,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 161 transitions, 1816 flow [2024-05-12 12:22:16,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:22:16,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:22:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 149 transitions. [2024-05-12 12:22:16,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45987654320987653 [2024-05-12 12:22:16,910 INFO L175 Difference]: Start difference. First operand has 123 places, 122 transitions, 1300 flow. Second operand 9 states and 149 transitions. [2024-05-12 12:22:16,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 161 transitions, 1816 flow [2024-05-12 12:22:16,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 161 transitions, 1739 flow, removed 10 selfloop flow, removed 7 redundant places. [2024-05-12 12:22:16,940 INFO L231 Difference]: Finished difference. Result has 129 places, 131 transitions, 1421 flow [2024-05-12 12:22:16,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1235, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1421, PETRI_PLACES=129, PETRI_TRANSITIONS=131} [2024-05-12 12:22:16,941 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2024-05-12 12:22:16,942 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 131 transitions, 1421 flow [2024-05-12 12:22:16,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.555555555555555) internal successors, (95), 9 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:16,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:16,942 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:16,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-05-12 12:22:16,942 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:16,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:16,943 INFO L85 PathProgramCache]: Analyzing trace with hash 261737443, now seen corresponding path program 2 times [2024-05-12 12:22:16,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:16,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497154317] [2024-05-12 12:22:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:22,028 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:22,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:22,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497154317] [2024-05-12 12:22:22,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497154317] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:22,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:22,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 12:22:22,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514224797] [2024-05-12 12:22:22,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:22,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-12 12:22:22,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:22,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-12 12:22:22,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-12 12:22:22,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:22:22,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 131 transitions, 1421 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:22,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:22,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:22:22,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:22,480 INFO L124 PetriNetUnfolderBase]: 876/1573 cut-off events. [2024-05-12 12:22:22,480 INFO L125 PetriNetUnfolderBase]: For 10764/10764 co-relation queries the response was YES. [2024-05-12 12:22:22,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7484 conditions, 1573 events. 876/1573 cut-off events. For 10764/10764 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 9446 event pairs, 123 based on Foata normal form. 2/1550 useless extension candidates. Maximal degree in co-relation 7419. Up to 1259 conditions per place. [2024-05-12 12:22:22,491 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 114 selfloop transitions, 29 changer transitions 0/151 dead transitions. [2024-05-12 12:22:22,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 151 transitions, 1769 flow [2024-05-12 12:22:22,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:22:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:22:22,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-05-12 12:22:22,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5722222222222222 [2024-05-12 12:22:22,505 INFO L175 Difference]: Start difference. First operand has 129 places, 131 transitions, 1421 flow. Second operand 5 states and 103 transitions. [2024-05-12 12:22:22,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 151 transitions, 1769 flow [2024-05-12 12:22:22,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 151 transitions, 1723 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 12:22:22,538 INFO L231 Difference]: Finished difference. Result has 129 places, 132 transitions, 1454 flow [2024-05-12 12:22:22,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1454, PETRI_PLACES=129, PETRI_TRANSITIONS=132} [2024-05-12 12:22:22,538 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 89 predicate places. [2024-05-12 12:22:22,539 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 132 transitions, 1454 flow [2024-05-12 12:22:22,539 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:22,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:22,540 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:22,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-05-12 12:22:22,540 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:22,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:22,540 INFO L85 PathProgramCache]: Analyzing trace with hash 262062943, now seen corresponding path program 3 times [2024-05-12 12:22:22,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:22,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363973606] [2024-05-12 12:22:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:22,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:27,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:22:27,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:27,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363973606] [2024-05-12 12:22:27,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363973606] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:27,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:27,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:27,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895043333] [2024-05-12 12:22:27,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:27,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:27,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:27,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:27,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:27,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:22:27,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 132 transitions, 1454 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:27,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:27,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:22:27,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:28,357 INFO L124 PetriNetUnfolderBase]: 1052/1935 cut-off events. [2024-05-12 12:22:28,357 INFO L125 PetriNetUnfolderBase]: For 12639/12639 co-relation queries the response was YES. [2024-05-12 12:22:28,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8841 conditions, 1935 events. 1052/1935 cut-off events. For 12639/12639 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11915 event pairs, 346 based on Foata normal form. 2/1893 useless extension candidates. Maximal degree in co-relation 8777. Up to 1692 conditions per place. [2024-05-12 12:22:28,370 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 131 selfloop transitions, 13 changer transitions 0/151 dead transitions. [2024-05-12 12:22:28,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 151 transitions, 1802 flow [2024-05-12 12:22:28,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 12:22:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 12:22:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2024-05-12 12:22:28,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47685185185185186 [2024-05-12 12:22:28,371 INFO L175 Difference]: Start difference. First operand has 129 places, 132 transitions, 1454 flow. Second operand 6 states and 103 transitions. [2024-05-12 12:22:28,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 151 transitions, 1802 flow [2024-05-12 12:22:28,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 151 transitions, 1739 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:28,407 INFO L231 Difference]: Finished difference. Result has 133 places, 135 transitions, 1452 flow [2024-05-12 12:22:28,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1452, PETRI_PLACES=133, PETRI_TRANSITIONS=135} [2024-05-12 12:22:28,408 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 93 predicate places. [2024-05-12 12:22:28,408 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 135 transitions, 1452 flow [2024-05-12 12:22:28,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:28,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:28,408 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:28,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-05-12 12:22:28,408 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:28,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:28,409 INFO L85 PathProgramCache]: Analyzing trace with hash 252562559, now seen corresponding path program 4 times [2024-05-12 12:22:28,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:28,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341187492] [2024-05-12 12:22:28,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:33,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341187492] [2024-05-12 12:22:33,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341187492] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:33,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:33,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:33,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436666054] [2024-05-12 12:22:33,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:33,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:33,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:33,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:33,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:33,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:22:33,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 135 transitions, 1452 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:33,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:33,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:22:33,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:34,052 INFO L124 PetriNetUnfolderBase]: 1054/1959 cut-off events. [2024-05-12 12:22:34,053 INFO L125 PetriNetUnfolderBase]: For 11388/11388 co-relation queries the response was YES. [2024-05-12 12:22:34,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8823 conditions, 1959 events. 1054/1959 cut-off events. For 11388/11388 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12194 event pairs, 228 based on Foata normal form. 2/1901 useless extension candidates. Maximal degree in co-relation 8756. Up to 1477 conditions per place. [2024-05-12 12:22:34,066 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 131 selfloop transitions, 34 changer transitions 0/172 dead transitions. [2024-05-12 12:22:34,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 172 transitions, 1922 flow [2024-05-12 12:22:34,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:22:34,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:22:34,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-05-12 12:22:34,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5476190476190477 [2024-05-12 12:22:34,067 INFO L175 Difference]: Start difference. First operand has 133 places, 135 transitions, 1452 flow. Second operand 7 states and 138 transitions. [2024-05-12 12:22:34,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 172 transitions, 1922 flow [2024-05-12 12:22:34,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 172 transitions, 1889 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-05-12 12:22:34,104 INFO L231 Difference]: Finished difference. Result has 137 places, 137 transitions, 1533 flow [2024-05-12 12:22:34,105 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1533, PETRI_PLACES=137, PETRI_TRANSITIONS=137} [2024-05-12 12:22:34,105 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 97 predicate places. [2024-05-12 12:22:34,105 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 137 transitions, 1533 flow [2024-05-12 12:22:34,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:34,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:34,106 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:34,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-05-12 12:22:34,106 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:34,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:34,106 INFO L85 PathProgramCache]: Analyzing trace with hash -447149301, now seen corresponding path program 5 times [2024-05-12 12:22:34,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:34,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928332066] [2024-05-12 12:22:34,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:34,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:39,929 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:39,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:39,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928332066] [2024-05-12 12:22:39,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928332066] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:39,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:39,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:22:39,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671016713] [2024-05-12 12:22:39,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:39,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:22:39,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:39,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:22:39,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:22:40,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:22:40,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 137 transitions, 1533 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:40,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:40,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:22:40,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:40,957 INFO L124 PetriNetUnfolderBase]: 1123/2099 cut-off events. [2024-05-12 12:22:40,957 INFO L125 PetriNetUnfolderBase]: For 15390/15390 co-relation queries the response was YES. [2024-05-12 12:22:40,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9546 conditions, 2099 events. 1123/2099 cut-off events. For 15390/15390 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 13368 event pairs, 234 based on Foata normal form. 12/2050 useless extension candidates. Maximal degree in co-relation 9478. Up to 1500 conditions per place. [2024-05-12 12:22:40,971 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 147 selfloop transitions, 28 changer transitions 0/182 dead transitions. [2024-05-12 12:22:40,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 182 transitions, 2060 flow [2024-05-12 12:22:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 157 transitions. [2024-05-12 12:22:40,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5451388888888888 [2024-05-12 12:22:40,972 INFO L175 Difference]: Start difference. First operand has 137 places, 137 transitions, 1533 flow. Second operand 8 states and 157 transitions. [2024-05-12 12:22:40,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 182 transitions, 2060 flow [2024-05-12 12:22:41,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 182 transitions, 1977 flow, removed 9 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:41,011 INFO L231 Difference]: Finished difference. Result has 139 places, 138 transitions, 1529 flow [2024-05-12 12:22:41,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1529, PETRI_PLACES=139, PETRI_TRANSITIONS=138} [2024-05-12 12:22:41,011 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 99 predicate places. [2024-05-12 12:22:41,011 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 138 transitions, 1529 flow [2024-05-12 12:22:41,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:41,012 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:41,012 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:41,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-05-12 12:22:41,012 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:41,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash -3221851, now seen corresponding path program 5 times [2024-05-12 12:22:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:41,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713476174] [2024-05-12 12:22:41,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:41,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:46,073 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:46,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:46,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713476174] [2024-05-12 12:22:46,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713476174] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:46,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:46,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:22:46,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797128074] [2024-05-12 12:22:46,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:46,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-05-12 12:22:46,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:46,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-05-12 12:22:46,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-05-12 12:22:46,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:22:46,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 138 transitions, 1529 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:46,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:46,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:22:46,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:46,747 INFO L124 PetriNetUnfolderBase]: 931/1825 cut-off events. [2024-05-12 12:22:46,748 INFO L125 PetriNetUnfolderBase]: For 11147/11147 co-relation queries the response was YES. [2024-05-12 12:22:46,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8125 conditions, 1825 events. 931/1825 cut-off events. For 11147/11147 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 12164 event pairs, 257 based on Foata normal form. 2/1755 useless extension candidates. Maximal degree in co-relation 8057. Up to 1408 conditions per place. [2024-05-12 12:22:46,759 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 137 selfloop transitions, 28 changer transitions 0/173 dead transitions. [2024-05-12 12:22:46,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 173 transitions, 1977 flow [2024-05-12 12:22:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:22:46,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:22:46,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 155 transitions. [2024-05-12 12:22:46,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5381944444444444 [2024-05-12 12:22:46,760 INFO L175 Difference]: Start difference. First operand has 139 places, 138 transitions, 1529 flow. Second operand 8 states and 155 transitions. [2024-05-12 12:22:46,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 173 transitions, 1977 flow [2024-05-12 12:22:46,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 173 transitions, 1913 flow, removed 7 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:46,790 INFO L231 Difference]: Finished difference. Result has 141 places, 138 transitions, 1526 flow [2024-05-12 12:22:46,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1526, PETRI_PLACES=141, PETRI_TRANSITIONS=138} [2024-05-12 12:22:46,790 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2024-05-12 12:22:46,790 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 138 transitions, 1526 flow [2024-05-12 12:22:46,791 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:46,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:46,791 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:46,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-05-12 12:22:46,791 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:46,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:46,791 INFO L85 PathProgramCache]: Analyzing trace with hash 512470807, now seen corresponding path program 1 times [2024-05-12 12:22:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:46,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854649827] [2024-05-12 12:22:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:46,934 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:46,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:46,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854649827] [2024-05-12 12:22:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854649827] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:46,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 12:22:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377530376] [2024-05-12 12:22:46,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:46,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 12:22:46,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:46,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 12:22:46,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 12:22:46,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:22:46,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 138 transitions, 1526 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:46,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:46,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:22:46,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:47,236 INFO L124 PetriNetUnfolderBase]: 681/1551 cut-off events. [2024-05-12 12:22:47,236 INFO L125 PetriNetUnfolderBase]: For 8663/8723 co-relation queries the response was YES. [2024-05-12 12:22:47,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5836 conditions, 1551 events. 681/1551 cut-off events. For 8663/8723 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 10407 event pairs, 130 based on Foata normal form. 149/1611 useless extension candidates. Maximal degree in co-relation 5767. Up to 569 conditions per place. [2024-05-12 12:22:47,244 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 63 selfloop transitions, 32 changer transitions 0/122 dead transitions. [2024-05-12 12:22:47,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 122 transitions, 1454 flow [2024-05-12 12:22:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 12:22:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 12:22:47,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-05-12 12:22:47,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2024-05-12 12:22:47,245 INFO L175 Difference]: Start difference. First operand has 141 places, 138 transitions, 1526 flow. Second operand 4 states and 93 transitions. [2024-05-12 12:22:47,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 122 transitions, 1454 flow [2024-05-12 12:22:47,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 122 transitions, 1172 flow, removed 33 selfloop flow, removed 27 redundant places. [2024-05-12 12:22:47,265 INFO L231 Difference]: Finished difference. Result has 119 places, 105 transitions, 1018 flow [2024-05-12 12:22:47,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1018, PETRI_PLACES=119, PETRI_TRANSITIONS=105} [2024-05-12 12:22:47,266 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 79 predicate places. [2024-05-12 12:22:47,266 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 105 transitions, 1018 flow [2024-05-12 12:22:47,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:47,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:47,266 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:22:47,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-05-12 12:22:47,266 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:47,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:47,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1864531140, now seen corresponding path program 1 times [2024-05-12 12:22:47,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:47,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849423148] [2024-05-12 12:22:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:47,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:52,648 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:52,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:52,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849423148] [2024-05-12 12:22:52,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849423148] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:52,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:52,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:22:52,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222571498] [2024-05-12 12:22:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:52,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:22:52,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:52,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:22:52,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:22:52,839 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:22:52,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 105 transitions, 1018 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:52,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:52,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:22:52,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:53,581 INFO L124 PetriNetUnfolderBase]: 944/1927 cut-off events. [2024-05-12 12:22:53,581 INFO L125 PetriNetUnfolderBase]: For 11001/11001 co-relation queries the response was YES. [2024-05-12 12:22:53,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7571 conditions, 1927 events. 944/1927 cut-off events. For 11001/11001 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 12467 event pairs, 175 based on Foata normal form. 8/1825 useless extension candidates. Maximal degree in co-relation 7514. Up to 752 conditions per place. [2024-05-12 12:22:53,591 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 100 selfloop transitions, 51 changer transitions 0/159 dead transitions. [2024-05-12 12:22:53,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 159 transitions, 1554 flow [2024-05-12 12:22:53,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:22:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:22:53,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 195 transitions. [2024-05-12 12:22:53,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-05-12 12:22:53,592 INFO L175 Difference]: Start difference. First operand has 119 places, 105 transitions, 1018 flow. Second operand 11 states and 195 transitions. [2024-05-12 12:22:53,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 159 transitions, 1554 flow [2024-05-12 12:22:53,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 159 transitions, 1511 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-05-12 12:22:53,615 INFO L231 Difference]: Finished difference. Result has 130 places, 108 transitions, 1156 flow [2024-05-12 12:22:53,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=979, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1156, PETRI_PLACES=130, PETRI_TRANSITIONS=108} [2024-05-12 12:22:53,615 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 90 predicate places. [2024-05-12 12:22:53,615 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 108 transitions, 1156 flow [2024-05-12 12:22:53,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:53,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:53,615 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:22:53,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-05-12 12:22:53,616 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:53,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:53,616 INFO L85 PathProgramCache]: Analyzing trace with hash 99181442, now seen corresponding path program 2 times [2024-05-12 12:22:53,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:53,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944674022] [2024-05-12 12:22:53,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:53,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:22:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:22:58,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:22:58,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944674022] [2024-05-12 12:22:58,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944674022] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:22:58,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:22:58,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:22:58,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927609913] [2024-05-12 12:22:58,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:22:58,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:22:58,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:22:58,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:22:58,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:22:58,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:22:58,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 108 transitions, 1156 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:58,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:22:58,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:22:58,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:22:59,817 INFO L124 PetriNetUnfolderBase]: 1038/2189 cut-off events. [2024-05-12 12:22:59,817 INFO L125 PetriNetUnfolderBase]: For 14542/14542 co-relation queries the response was YES. [2024-05-12 12:22:59,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9008 conditions, 2189 events. 1038/2189 cut-off events. For 14542/14542 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 14904 event pairs, 382 based on Foata normal form. 4/2050 useless extension candidates. Maximal degree in co-relation 8947. Up to 1434 conditions per place. [2024-05-12 12:22:59,827 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 93 selfloop transitions, 51 changer transitions 0/152 dead transitions. [2024-05-12 12:22:59,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 152 transitions, 1651 flow [2024-05-12 12:22:59,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:22:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:22:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 178 transitions. [2024-05-12 12:22:59,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2024-05-12 12:22:59,829 INFO L175 Difference]: Start difference. First operand has 130 places, 108 transitions, 1156 flow. Second operand 10 states and 178 transitions. [2024-05-12 12:22:59,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 152 transitions, 1651 flow [2024-05-12 12:22:59,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 152 transitions, 1536 flow, removed 24 selfloop flow, removed 6 redundant places. [2024-05-12 12:22:59,858 INFO L231 Difference]: Finished difference. Result has 135 places, 111 transitions, 1208 flow [2024-05-12 12:22:59,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1059, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1208, PETRI_PLACES=135, PETRI_TRANSITIONS=111} [2024-05-12 12:22:59,859 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 95 predicate places. [2024-05-12 12:22:59,859 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 111 transitions, 1208 flow [2024-05-12 12:22:59,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:22:59,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:22:59,859 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:22:59,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-05-12 12:22:59,859 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:22:59,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:22:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash 875537448, now seen corresponding path program 3 times [2024-05-12 12:22:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:22:59,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798354782] [2024-05-12 12:22:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:22:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:22:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:04,653 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:04,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:04,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798354782] [2024-05-12 12:23:04,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798354782] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:04,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:04,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:04,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390081813] [2024-05-12 12:23:04,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:04,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:04,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:04,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:04,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:23:04,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 111 transitions, 1208 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:04,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:04,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:23:04,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:05,288 INFO L124 PetriNetUnfolderBase]: 820/1860 cut-off events. [2024-05-12 12:23:05,289 INFO L125 PetriNetUnfolderBase]: For 11889/11889 co-relation queries the response was YES. [2024-05-12 12:23:05,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7217 conditions, 1860 events. 820/1860 cut-off events. For 11889/11889 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13296 event pairs, 360 based on Foata normal form. 10/1711 useless extension candidates. Maximal degree in co-relation 7153. Up to 1201 conditions per place. [2024-05-12 12:23:05,298 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 76 selfloop transitions, 55 changer transitions 0/140 dead transitions. [2024-05-12 12:23:05,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 1550 flow [2024-05-12 12:23:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:23:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:23:05,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 12:23:05,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 12:23:05,299 INFO L175 Difference]: Start difference. First operand has 135 places, 111 transitions, 1208 flow. Second operand 10 states and 175 transitions. [2024-05-12 12:23:05,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 1550 flow [2024-05-12 12:23:05,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 140 transitions, 1463 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-05-12 12:23:05,326 INFO L231 Difference]: Finished difference. Result has 139 places, 111 transitions, 1235 flow [2024-05-12 12:23:05,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1235, PETRI_PLACES=139, PETRI_TRANSITIONS=111} [2024-05-12 12:23:05,327 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 99 predicate places. [2024-05-12 12:23:05,327 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 111 transitions, 1235 flow [2024-05-12 12:23:05,327 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:05,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:05,327 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:05,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-05-12 12:23:05,328 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:05,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:05,328 INFO L85 PathProgramCache]: Analyzing trace with hash 962379360, now seen corresponding path program 1 times [2024-05-12 12:23:05,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:05,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957767168] [2024-05-12 12:23:05,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:11,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:23:11,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:11,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957767168] [2024-05-12 12:23:11,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957767168] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:11,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:11,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:11,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937053093] [2024-05-12 12:23:11,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:11,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:11,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:11,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:11,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:11,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:23:11,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 111 transitions, 1235 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:11,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:11,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:23:11,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:11,909 INFO L124 PetriNetUnfolderBase]: 842/1890 cut-off events. [2024-05-12 12:23:11,909 INFO L125 PetriNetUnfolderBase]: For 10295/10295 co-relation queries the response was YES. [2024-05-12 12:23:11,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7417 conditions, 1890 events. 842/1890 cut-off events. For 10295/10295 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 13526 event pairs, 372 based on Foata normal form. 2/1731 useless extension candidates. Maximal degree in co-relation 7351. Up to 1431 conditions per place. [2024-05-12 12:23:11,921 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 96 selfloop transitions, 35 changer transitions 0/140 dead transitions. [2024-05-12 12:23:11,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 140 transitions, 1628 flow [2024-05-12 12:23:11,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:23:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:23:11,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-05-12 12:23:11,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-05-12 12:23:11,922 INFO L175 Difference]: Start difference. First operand has 139 places, 111 transitions, 1235 flow. Second operand 9 states and 152 transitions. [2024-05-12 12:23:11,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 140 transitions, 1628 flow [2024-05-12 12:23:11,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 140 transitions, 1510 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:23:11,953 INFO L231 Difference]: Finished difference. Result has 144 places, 119 transitions, 1323 flow [2024-05-12 12:23:11,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1323, PETRI_PLACES=144, PETRI_TRANSITIONS=119} [2024-05-12 12:23:11,954 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 104 predicate places. [2024-05-12 12:23:11,954 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 119 transitions, 1323 flow [2024-05-12 12:23:11,954 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:11,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:11,954 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:11,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-05-12 12:23:11,954 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:11,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:11,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1011859168, now seen corresponding path program 4 times [2024-05-12 12:23:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:11,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983125899] [2024-05-12 12:23:11,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:11,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:18,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:23:18,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983125899] [2024-05-12 12:23:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983125899] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:18,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:18,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:23:18,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606216641] [2024-05-12 12:23:18,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:18,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:23:18,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:18,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:23:18,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:23:18,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:23:18,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 119 transitions, 1323 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:18,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:18,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:23:18,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:19,101 INFO L124 PetriNetUnfolderBase]: 1216/2605 cut-off events. [2024-05-12 12:23:19,102 INFO L125 PetriNetUnfolderBase]: For 17432/17432 co-relation queries the response was YES. [2024-05-12 12:23:19,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10507 conditions, 2605 events. 1216/2605 cut-off events. For 17432/17432 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18832 event pairs, 483 based on Foata normal form. 8/2452 useless extension candidates. Maximal degree in co-relation 10436. Up to 1569 conditions per place. [2024-05-12 12:23:19,116 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 119 selfloop transitions, 34 changer transitions 0/161 dead transitions. [2024-05-12 12:23:19,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 161 transitions, 1834 flow [2024-05-12 12:23:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:23:19,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:23:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 175 transitions. [2024-05-12 12:23:19,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2024-05-12 12:23:19,117 INFO L175 Difference]: Start difference. First operand has 144 places, 119 transitions, 1323 flow. Second operand 10 states and 175 transitions. [2024-05-12 12:23:19,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 161 transitions, 1834 flow [2024-05-12 12:23:19,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 161 transitions, 1800 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-05-12 12:23:19,165 INFO L231 Difference]: Finished difference. Result has 151 places, 119 transitions, 1360 flow [2024-05-12 12:23:19,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1360, PETRI_PLACES=151, PETRI_TRANSITIONS=119} [2024-05-12 12:23:19,166 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 111 predicate places. [2024-05-12 12:23:19,166 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 119 transitions, 1360 flow [2024-05-12 12:23:19,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:19,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:19,166 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:19,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-05-12 12:23:19,166 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:19,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash 962229258, now seen corresponding path program 5 times [2024-05-12 12:23:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:19,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828320174] [2024-05-12 12:23:19,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:19,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:24,353 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,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:24,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828320174] [2024-05-12 12:23:24,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828320174] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:24,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:24,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:24,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922914615] [2024-05-12 12:23:24,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:24,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:24,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:24,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:24,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:24,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:23:24,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 119 transitions, 1360 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:24,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:24,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:23:24,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:24,986 INFO L124 PetriNetUnfolderBase]: 944/2160 cut-off events. [2024-05-12 12:23:24,987 INFO L125 PetriNetUnfolderBase]: For 15126/15126 co-relation queries the response was YES. [2024-05-12 12:23:24,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8463 conditions, 2160 events. 944/2160 cut-off events. For 15126/15126 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 16192 event pairs, 506 based on Foata normal form. 10/1987 useless extension candidates. Maximal degree in co-relation 8390. Up to 1531 conditions per place. [2024-05-12 12:23:25,000 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 104 selfloop transitions, 34 changer transitions 0/147 dead transitions. [2024-05-12 12:23:25,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 147 transitions, 1742 flow [2024-05-12 12:23:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:23:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:23:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 171 transitions. [2024-05-12 12:23:25,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2024-05-12 12:23:25,001 INFO L175 Difference]: Start difference. First operand has 151 places, 119 transitions, 1360 flow. Second operand 10 states and 171 transitions. [2024-05-12 12:23:25,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 147 transitions, 1742 flow [2024-05-12 12:23:25,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 147 transitions, 1675 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:23:25,052 INFO L231 Difference]: Finished difference. Result has 153 places, 119 transitions, 1365 flow [2024-05-12 12:23:25,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1365, PETRI_PLACES=153, PETRI_TRANSITIONS=119} [2024-05-12 12:23:25,052 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 113 predicate places. [2024-05-12 12:23:25,052 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 119 transitions, 1365 flow [2024-05-12 12:23:25,052 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:25,052 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:25,052 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:25,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-05-12 12:23:25,053 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:25,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 241288232, now seen corresponding path program 6 times [2024-05-12 12:23:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358720065] [2024-05-12 12:23:25,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:30,500 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:30,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:30,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358720065] [2024-05-12 12:23:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358720065] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:30,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:30,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:23:30,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487512348] [2024-05-12 12:23:30,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:30,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:23:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:30,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:23:30,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:23:30,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:23:30,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 119 transitions, 1365 flow. Second operand has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:30,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:30,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:23:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:31,202 INFO L124 PetriNetUnfolderBase]: 1002/2301 cut-off events. [2024-05-12 12:23:31,203 INFO L125 PetriNetUnfolderBase]: For 16072/16072 co-relation queries the response was YES. [2024-05-12 12:23:31,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8927 conditions, 2301 events. 1002/2301 cut-off events. For 16072/16072 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 17665 event pairs, 558 based on Foata normal form. 10/2117 useless extension candidates. Maximal degree in co-relation 8853. Up to 1683 conditions per place. [2024-05-12 12:23:31,214 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 109 selfloop transitions, 28 changer transitions 0/146 dead transitions. [2024-05-12 12:23:31,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 146 transitions, 1747 flow [2024-05-12 12:23:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:23:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:23:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-05-12 12:23:31,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-05-12 12:23:31,215 INFO L175 Difference]: Start difference. First operand has 153 places, 119 transitions, 1365 flow. Second operand 10 states and 167 transitions. [2024-05-12 12:23:31,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 146 transitions, 1747 flow [2024-05-12 12:23:31,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 146 transitions, 1681 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:23:31,256 INFO L231 Difference]: Finished difference. Result has 155 places, 119 transitions, 1359 flow [2024-05-12 12:23:31,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1359, PETRI_PLACES=155, PETRI_TRANSITIONS=119} [2024-05-12 12:23:31,257 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 115 predicate places. [2024-05-12 12:23:31,257 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 119 transitions, 1359 flow [2024-05-12 12:23:31,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.363636363636363) internal successors, (125), 11 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:31,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:31,257 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:31,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-05-12 12:23:31,258 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:31,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:31,258 INFO L85 PathProgramCache]: Analyzing trace with hash 241284512, now seen corresponding path program 7 times [2024-05-12 12:23:31,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:31,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504832977] [2024-05-12 12:23:31,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:31,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:36,936 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:36,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:36,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504832977] [2024-05-12 12:23:36,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504832977] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:36,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:36,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-12 12:23:36,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748942479] [2024-05-12 12:23:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:36,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-12 12:23:36,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:36,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-12 12:23:36,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-05-12 12:23:37,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:23:37,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 119 transitions, 1359 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:37,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:37,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:23:37,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:37,800 INFO L124 PetriNetUnfolderBase]: 1062/2482 cut-off events. [2024-05-12 12:23:37,801 INFO L125 PetriNetUnfolderBase]: For 16260/16260 co-relation queries the response was YES. [2024-05-12 12:23:37,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9392 conditions, 2482 events. 1062/2482 cut-off events. For 16260/16260 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 19591 event pairs, 574 based on Foata normal form. 8/2283 useless extension candidates. Maximal degree in co-relation 9317. Up to 1558 conditions per place. [2024-05-12 12:23:37,851 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 112 selfloop transitions, 31 changer transitions 0/152 dead transitions. [2024-05-12 12:23:37,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 152 transitions, 1786 flow [2024-05-12 12:23:37,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:23:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:23:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 173 transitions. [2024-05-12 12:23:37,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48055555555555557 [2024-05-12 12:23:37,852 INFO L175 Difference]: Start difference. First operand has 155 places, 119 transitions, 1359 flow. Second operand 10 states and 173 transitions. [2024-05-12 12:23:37,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 152 transitions, 1786 flow [2024-05-12 12:23:37,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 152 transitions, 1732 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:23:37,896 INFO L231 Difference]: Finished difference. Result has 157 places, 119 transitions, 1370 flow [2024-05-12 12:23:37,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1370, PETRI_PLACES=157, PETRI_TRANSITIONS=119} [2024-05-12 12:23:37,896 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 117 predicate places. [2024-05-12 12:23:37,896 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 119 transitions, 1370 flow [2024-05-12 12:23:37,896 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:37,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:37,897 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:37,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-05-12 12:23:37,897 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:37,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash -136939412, now seen corresponding path program 2 times [2024-05-12 12:23:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:37,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632681622] [2024-05-12 12:23:37,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:37,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:43,217 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:43,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:43,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632681622] [2024-05-12 12:23:43,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632681622] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:43,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:43,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:23:43,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566536989] [2024-05-12 12:23:43,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:43,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:23:43,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:43,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:23:43,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:23:43,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:23:43,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 119 transitions, 1370 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:43,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:43,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:23:43,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:44,329 INFO L124 PetriNetUnfolderBase]: 1382/2977 cut-off events. [2024-05-12 12:23:44,329 INFO L125 PetriNetUnfolderBase]: For 16393/16393 co-relation queries the response was YES. [2024-05-12 12:23:44,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11521 conditions, 2977 events. 1382/2977 cut-off events. For 16393/16393 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22669 event pairs, 664 based on Foata normal form. 2/2791 useless extension candidates. Maximal degree in co-relation 11445. Up to 2337 conditions per place. [2024-05-12 12:23:44,348 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 116 selfloop transitions, 32 changer transitions 0/156 dead transitions. [2024-05-12 12:23:44,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 156 transitions, 1792 flow [2024-05-12 12:23:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:23:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:23:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2024-05-12 12:23:44,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44191919191919193 [2024-05-12 12:23:44,349 INFO L175 Difference]: Start difference. First operand has 157 places, 119 transitions, 1370 flow. Second operand 11 states and 175 transitions. [2024-05-12 12:23:44,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 156 transitions, 1792 flow [2024-05-12 12:23:44,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 156 transitions, 1733 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:23:44,403 INFO L231 Difference]: Finished difference. Result has 164 places, 124 transitions, 1438 flow [2024-05-12 12:23:44,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1438, PETRI_PLACES=164, PETRI_TRANSITIONS=124} [2024-05-12 12:23:44,403 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 124 predicate places. [2024-05-12 12:23:44,403 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 124 transitions, 1438 flow [2024-05-12 12:23:44,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:44,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:44,403 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:44,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-05-12 12:23:44,403 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:44,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash -760286206, now seen corresponding path program 3 times [2024-05-12 12:23:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052757757] [2024-05-12 12:23:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:50,102 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:50,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:50,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052757757] [2024-05-12 12:23:50,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052757757] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:23:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931407855] [2024-05-12 12:23:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:50,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:23:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:23:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:23:50,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:23:50,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 124 transitions, 1438 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:50,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:50,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:23:50,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:51,216 INFO L124 PetriNetUnfolderBase]: 1399/3024 cut-off events. [2024-05-12 12:23:51,216 INFO L125 PetriNetUnfolderBase]: For 17127/17127 co-relation queries the response was YES. [2024-05-12 12:23:51,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11860 conditions, 3024 events. 1399/3024 cut-off events. For 17127/17127 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 23161 event pairs, 705 based on Foata normal form. 2/2832 useless extension candidates. Maximal degree in co-relation 11780. Up to 2443 conditions per place. [2024-05-12 12:23:51,240 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 110 selfloop transitions, 29 changer transitions 0/147 dead transitions. [2024-05-12 12:23:51,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 147 transitions, 1792 flow [2024-05-12 12:23:51,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:23:51,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:23:51,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-05-12 12:23:51,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49206349206349204 [2024-05-12 12:23:51,241 INFO L175 Difference]: Start difference. First operand has 164 places, 124 transitions, 1438 flow. Second operand 7 states and 124 transitions. [2024-05-12 12:23:51,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 147 transitions, 1792 flow [2024-05-12 12:23:51,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 147 transitions, 1734 flow, removed 11 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:51,298 INFO L231 Difference]: Finished difference. Result has 166 places, 125 transitions, 1456 flow [2024-05-12 12:23:51,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1380, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1456, PETRI_PLACES=166, PETRI_TRANSITIONS=125} [2024-05-12 12:23:51,299 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 126 predicate places. [2024-05-12 12:23:51,299 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 125 transitions, 1456 flow [2024-05-12 12:23:51,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:51,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:51,299 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:51,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-05-12 12:23:51,300 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:51,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:51,300 INFO L85 PathProgramCache]: Analyzing trace with hash -476072626, now seen corresponding path program 4 times [2024-05-12 12:23:51,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:51,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985891288] [2024-05-12 12:23:51,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:51,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:23:56,126 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:56,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:23:56,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985891288] [2024-05-12 12:23:56,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985891288] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:23:56,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:23:56,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:23:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062031239] [2024-05-12 12:23:56,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:23:56,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:23:56,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:23:56,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:23:56,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:23:56,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:23:56,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 125 transitions, 1456 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:56,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:23:56,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:23:56,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:23:57,096 INFO L124 PetriNetUnfolderBase]: 1416/3061 cut-off events. [2024-05-12 12:23:57,096 INFO L125 PetriNetUnfolderBase]: For 17784/17784 co-relation queries the response was YES. [2024-05-12 12:23:57,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12022 conditions, 3061 events. 1416/3061 cut-off events. For 17784/17784 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 23549 event pairs, 711 based on Foata normal form. 2/2868 useless extension candidates. Maximal degree in co-relation 11940. Up to 2414 conditions per place. [2024-05-12 12:23:57,116 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 115 selfloop transitions, 25 changer transitions 0/148 dead transitions. [2024-05-12 12:23:57,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 148 transitions, 1816 flow [2024-05-12 12:23:57,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:23:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:23:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2024-05-12 12:23:57,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2024-05-12 12:23:57,117 INFO L175 Difference]: Start difference. First operand has 166 places, 125 transitions, 1456 flow. Second operand 7 states and 123 transitions. [2024-05-12 12:23:57,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 148 transitions, 1816 flow [2024-05-12 12:23:57,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 148 transitions, 1754 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-05-12 12:23:57,183 INFO L231 Difference]: Finished difference. Result has 168 places, 126 transitions, 1462 flow [2024-05-12 12:23:57,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1462, PETRI_PLACES=168, PETRI_TRANSITIONS=126} [2024-05-12 12:23:57,183 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 128 predicate places. [2024-05-12 12:23:57,183 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 126 transitions, 1462 flow [2024-05-12 12:23:57,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:23:57,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:23:57,184 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:57,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-05-12 12:23:57,184 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:23:57,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:23:57,184 INFO L85 PathProgramCache]: Analyzing trace with hash 107194366, now seen corresponding path program 5 times [2024-05-12 12:23:57,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:23:57,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980924845] [2024-05-12 12:23:57,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:23:57,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:23:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24: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:24:01,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:01,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980924845] [2024-05-12 12:24:01,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980924845] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:01,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:01,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:01,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775640518] [2024-05-12 12:24:01,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:01,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:24:01,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:01,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:24:01,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:24:01,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:24:01,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 126 transitions, 1462 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:01,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:01,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:24:01,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:02,575 INFO L124 PetriNetUnfolderBase]: 1417/3059 cut-off events. [2024-05-12 12:24:02,576 INFO L125 PetriNetUnfolderBase]: For 17426/17426 co-relation queries the response was YES. [2024-05-12 12:24:02,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11977 conditions, 3059 events. 1417/3059 cut-off events. For 17426/17426 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 23452 event pairs, 712 based on Foata normal form. 2/2879 useless extension candidates. Maximal degree in co-relation 11894. Up to 2531 conditions per place. [2024-05-12 12:24:02,595 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 127 selfloop transitions, 12 changer transitions 0/147 dead transitions. [2024-05-12 12:24:02,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 147 transitions, 1816 flow [2024-05-12 12:24:02,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-12 12:24:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-05-12 12:24:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2024-05-12 12:24:02,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-05-12 12:24:02,596 INFO L175 Difference]: Start difference. First operand has 168 places, 126 transitions, 1462 flow. Second operand 7 states and 117 transitions. [2024-05-12 12:24:02,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 147 transitions, 1816 flow [2024-05-12 12:24:02,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 147 transitions, 1758 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 12:24:02,666 INFO L231 Difference]: Finished difference. Result has 170 places, 127 transitions, 1448 flow [2024-05-12 12:24:02,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1404, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1448, PETRI_PLACES=170, PETRI_TRANSITIONS=127} [2024-05-12 12:24:02,667 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 130 predicate places. [2024-05-12 12:24:02,667 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 127 transitions, 1448 flow [2024-05-12 12:24:02,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:02,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:02,667 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:02,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-05-12 12:24:02,668 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:02,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:02,668 INFO L85 PathProgramCache]: Analyzing trace with hash -760493968, now seen corresponding path program 8 times [2024-05-12 12:24:02,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:02,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628236904] [2024-05-12 12:24:02,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:02,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:07,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:24:07,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:07,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628236904] [2024-05-12 12:24:07,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628236904] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:07,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:07,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:07,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909791861] [2024-05-12 12:24:07,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:07,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:24:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:24:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:24:07,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:24:07,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 127 transitions, 1448 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:07,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:07,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:24:07,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:08,515 INFO L124 PetriNetUnfolderBase]: 1448/3260 cut-off events. [2024-05-12 12:24:08,515 INFO L125 PetriNetUnfolderBase]: For 19791/19791 co-relation queries the response was YES. [2024-05-12 12:24:08,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12078 conditions, 3260 events. 1448/3260 cut-off events. For 19791/19791 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 25765 event pairs, 661 based on Foata normal form. 10/3076 useless extension candidates. Maximal degree in co-relation 11995. Up to 2362 conditions per place. [2024-05-12 12:24:08,541 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 116 selfloop transitions, 34 changer transitions 0/158 dead transitions. [2024-05-12 12:24:08,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 158 transitions, 1850 flow [2024-05-12 12:24:08,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:24:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:24:08,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-05-12 12:24:08,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2024-05-12 12:24:08,542 INFO L175 Difference]: Start difference. First operand has 170 places, 127 transitions, 1448 flow. Second operand 8 states and 147 transitions. [2024-05-12 12:24:08,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 158 transitions, 1850 flow [2024-05-12 12:24:08,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 158 transitions, 1816 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-05-12 12:24:08,610 INFO L231 Difference]: Finished difference. Result has 173 places, 127 transitions, 1490 flow [2024-05-12 12:24:08,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1490, PETRI_PLACES=173, PETRI_TRANSITIONS=127} [2024-05-12 12:24:08,611 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 133 predicate places. [2024-05-12 12:24:08,611 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 127 transitions, 1490 flow [2024-05-12 12:24:08,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:08,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:08,611 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:08,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-05-12 12:24:08,611 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:08,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1065790616, now seen corresponding path program 9 times [2024-05-12 12:24:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420849375] [2024-05-12 12:24:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:15,229 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:15,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:15,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420849375] [2024-05-12 12:24:15,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420849375] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:15,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:15,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:15,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146260760] [2024-05-12 12:24:15,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:15,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:24:15,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:15,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:24:15,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:24:15,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 36 [2024-05-12 12:24:15,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 127 transitions, 1490 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:15,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:15,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 36 [2024-05-12 12:24:15,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:16,575 INFO L124 PetriNetUnfolderBase]: 1825/3881 cut-off events. [2024-05-12 12:24:16,575 INFO L125 PetriNetUnfolderBase]: For 24823/24823 co-relation queries the response was YES. [2024-05-12 12:24:16,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14489 conditions, 3881 events. 1825/3881 cut-off events. For 24823/24823 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 30180 event pairs, 849 based on Foata normal form. 8/3672 useless extension candidates. Maximal degree in co-relation 14405. Up to 2592 conditions per place. [2024-05-12 12:24:16,600 INFO L140 encePairwiseOnDemand]: 24/36 looper letters, 133 selfloop transitions, 36 changer transitions 0/176 dead transitions. [2024-05-12 12:24:16,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 176 transitions, 2139 flow [2024-05-12 12:24:16,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-05-12 12:24:16,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-05-12 12:24:16,601 INFO L175 Difference]: Start difference. First operand has 173 places, 127 transitions, 1490 flow. Second operand 9 states and 159 transitions. [2024-05-12 12:24:16,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 176 transitions, 2139 flow [2024-05-12 12:24:16,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 176 transitions, 2048 flow, removed 3 selfloop flow, removed 9 redundant places. [2024-05-12 12:24:16,670 INFO L231 Difference]: Finished difference. Result has 175 places, 133 transitions, 1566 flow [2024-05-12 12:24:16,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1403, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1566, PETRI_PLACES=175, PETRI_TRANSITIONS=133} [2024-05-12 12:24:16,671 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 135 predicate places. [2024-05-12 12:24:16,671 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 133 transitions, 1566 flow [2024-05-12 12:24:16,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:16,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:16,671 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,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-05-12 12:24:16,671 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:16,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -99876086, now seen corresponding path program 10 times [2024-05-12 12:24:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:16,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005813818] [2024-05-12 12:24:16,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:16,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:22,033 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:22,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:22,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005813818] [2024-05-12 12:24:22,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005813818] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:22,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:22,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765694655] [2024-05-12 12:24:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:22,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:24:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:22,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:24:22,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:24:22,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:24:22,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 133 transitions, 1566 flow. Second operand has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:22,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:22,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:24:22,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:23,372 INFO L124 PetriNetUnfolderBase]: 1627/3537 cut-off events. [2024-05-12 12:24:23,372 INFO L125 PetriNetUnfolderBase]: For 22884/22884 co-relation queries the response was YES. [2024-05-12 12:24:23,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13512 conditions, 3537 events. 1627/3537 cut-off events. For 22884/22884 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 28148 event pairs, 858 based on Foata normal form. 10/3331 useless extension candidates. Maximal degree in co-relation 13428. Up to 2735 conditions per place. [2024-05-12 12:24:23,399 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 125 selfloop transitions, 33 changer transitions 0/168 dead transitions. [2024-05-12 12:24:23,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 168 transitions, 2004 flow [2024-05-12 12:24:23,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:24:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:24:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 159 transitions. [2024-05-12 12:24:23,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-05-12 12:24:23,402 INFO L175 Difference]: Start difference. First operand has 175 places, 133 transitions, 1566 flow. Second operand 9 states and 159 transitions. [2024-05-12 12:24:23,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 168 transitions, 2004 flow [2024-05-12 12:24:23,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 168 transitions, 1944 flow, removed 10 selfloop flow, removed 4 redundant places. [2024-05-12 12:24:23,480 INFO L231 Difference]: Finished difference. Result has 180 places, 133 transitions, 1586 flow [2024-05-12 12:24:23,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1586, PETRI_PLACES=180, PETRI_TRANSITIONS=133} [2024-05-12 12:24:23,481 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 140 predicate places. [2024-05-12 12:24:23,481 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 133 transitions, 1586 flow [2024-05-12 12:24:23,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.363636363636363) internal successors, (114), 11 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:23,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:23,482 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:24:23,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-05-12 12:24:23,483 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:23,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:23,483 INFO L85 PathProgramCache]: Analyzing trace with hash -231009648, now seen corresponding path program 1 times [2024-05-12 12:24:23,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:23,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924064532] [2024-05-12 12:24:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:23,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:29,945 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:29,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924064532] [2024-05-12 12:24:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924064532] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:29,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:29,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:24:29,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565212860] [2024-05-12 12:24:29,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:29,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:24:29,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:29,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:24:29,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:24:30,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:24:30,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 133 transitions, 1586 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:30,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:30,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:24:30,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:31,250 INFO L124 PetriNetUnfolderBase]: 1664/3602 cut-off events. [2024-05-12 12:24:31,250 INFO L125 PetriNetUnfolderBase]: For 19340/19340 co-relation queries the response was YES. [2024-05-12 12:24:31,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13254 conditions, 3602 events. 1664/3602 cut-off events. For 19340/19340 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 28884 event pairs, 821 based on Foata normal form. 6/3393 useless extension candidates. Maximal degree in co-relation 13168. Up to 2830 conditions per place. [2024-05-12 12:24:31,273 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 123 selfloop transitions, 35 changer transitions 0/168 dead transitions. [2024-05-12 12:24:31,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 168 transitions, 2014 flow [2024-05-12 12:24:31,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 12:24:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 12:24:31,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2024-05-12 12:24:31,275 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4638888888888889 [2024-05-12 12:24:31,275 INFO L175 Difference]: Start difference. First operand has 180 places, 133 transitions, 1586 flow. Second operand 10 states and 167 transitions. [2024-05-12 12:24:31,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 168 transitions, 2014 flow [2024-05-12 12:24:31,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 168 transitions, 1949 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-05-12 12:24:31,344 INFO L231 Difference]: Finished difference. Result has 183 places, 133 transitions, 1594 flow [2024-05-12 12:24:31,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1594, PETRI_PLACES=183, PETRI_TRANSITIONS=133} [2024-05-12 12:24:31,345 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 143 predicate places. [2024-05-12 12:24:31,345 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 133 transitions, 1594 flow [2024-05-12 12:24:31,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:31,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:31,345 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:24:31,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-05-12 12:24:31,346 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:31,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash -932624444, now seen corresponding path program 2 times [2024-05-12 12:24:31,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:31,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924411449] [2024-05-12 12:24:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:31,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:24:37,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:37,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924411449] [2024-05-12 12:24:37,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924411449] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:37,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:37,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:24:37,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648468743] [2024-05-12 12:24:37,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:37,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:24:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:37,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:24:37,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:24:37,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:24:37,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 133 transitions, 1594 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:37,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:37,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:24:37,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:38,426 INFO L124 PetriNetUnfolderBase]: 1701/3687 cut-off events. [2024-05-12 12:24:38,426 INFO L125 PetriNetUnfolderBase]: For 20453/20453 co-relation queries the response was YES. [2024-05-12 12:24:38,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13547 conditions, 3687 events. 1701/3687 cut-off events. For 20453/20453 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 29726 event pairs, 881 based on Foata normal form. 6/3475 useless extension candidates. Maximal degree in co-relation 13460. Up to 2901 conditions per place. [2024-05-12 12:24:38,457 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 134 selfloop transitions, 29 changer transitions 0/173 dead transitions. [2024-05-12 12:24:38,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 173 transitions, 2046 flow [2024-05-12 12:24:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-12 12:24:38,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-05-12 12:24:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 191 transitions. [2024-05-12 12:24:38,458 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44212962962962965 [2024-05-12 12:24:38,458 INFO L175 Difference]: Start difference. First operand has 183 places, 133 transitions, 1594 flow. Second operand 12 states and 191 transitions. [2024-05-12 12:24:38,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 173 transitions, 2046 flow [2024-05-12 12:24:38,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 173 transitions, 1977 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-05-12 12:24:38,537 INFO L231 Difference]: Finished difference. Result has 187 places, 133 transitions, 1586 flow [2024-05-12 12:24:38,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1586, PETRI_PLACES=187, PETRI_TRANSITIONS=133} [2024-05-12 12:24:38,538 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 147 predicate places. [2024-05-12 12:24:38,538 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 133 transitions, 1586 flow [2024-05-12 12:24:38,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:38,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:38,538 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:24:38,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-05-12 12:24:38,538 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:38,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1873348254, now seen corresponding path program 3 times [2024-05-12 12:24:38,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:38,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292820815] [2024-05-12 12:24:38,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:38,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:43,730 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:43,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292820815] [2024-05-12 12:24:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292820815] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987343223] [2024-05-12 12:24:43,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:43,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:24:43,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:43,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:24:43,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:24:43,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:24:43,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 133 transitions, 1586 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:43,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:43,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:24:43,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:44,926 INFO L124 PetriNetUnfolderBase]: 1773/3849 cut-off events. [2024-05-12 12:24:44,927 INFO L125 PetriNetUnfolderBase]: For 18566/18566 co-relation queries the response was YES. [2024-05-12 12:24:44,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14030 conditions, 3849 events. 1773/3849 cut-off events. For 18566/18566 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 31335 event pairs, 954 based on Foata normal form. 2/3619 useless extension candidates. Maximal degree in co-relation 13942. Up to 3111 conditions per place. [2024-05-12 12:24:44,957 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 130 selfloop transitions, 25 changer transitions 0/165 dead transitions. [2024-05-12 12:24:44,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 165 transitions, 2012 flow [2024-05-12 12:24:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:24:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:24:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 139 transitions. [2024-05-12 12:24:44,958 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4826388888888889 [2024-05-12 12:24:44,958 INFO L175 Difference]: Start difference. First operand has 187 places, 133 transitions, 1586 flow. Second operand 8 states and 139 transitions. [2024-05-12 12:24:44,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 165 transitions, 2012 flow [2024-05-12 12:24:45,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 165 transitions, 1955 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-05-12 12:24:45,042 INFO L231 Difference]: Finished difference. Result has 187 places, 137 transitions, 1627 flow [2024-05-12 12:24:45,042 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1529, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1627, PETRI_PLACES=187, PETRI_TRANSITIONS=137} [2024-05-12 12:24:45,042 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 147 predicate places. [2024-05-12 12:24:45,042 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 137 transitions, 1627 flow [2024-05-12 12:24:45,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:45,043 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:45,043 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:24:45,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-05-12 12:24:45,043 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:45,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2094034642, now seen corresponding path program 4 times [2024-05-12 12:24:45,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:45,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223727567] [2024-05-12 12:24:45,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:45,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:51,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:24:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:51,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223727567] [2024-05-12 12:24:51,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223727567] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:51,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:51,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:24:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003526222] [2024-05-12 12:24:51,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:51,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:24:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:24:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:24:51,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:24:51,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 137 transitions, 1627 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:51,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:51,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:24:51,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:53,002 INFO L124 PetriNetUnfolderBase]: 1836/4000 cut-off events. [2024-05-12 12:24:53,003 INFO L125 PetriNetUnfolderBase]: For 27607/27607 co-relation queries the response was YES. [2024-05-12 12:24:53,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14758 conditions, 4000 events. 1836/4000 cut-off events. For 27607/27607 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 33007 event pairs, 993 based on Foata normal form. 12/3779 useless extension candidates. Maximal degree in co-relation 14667. Up to 3168 conditions per place. [2024-05-12 12:24:53,033 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 130 selfloop transitions, 27 changer transitions 0/167 dead transitions. [2024-05-12 12:24:53,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 167 transitions, 2043 flow [2024-05-12 12:24:53,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:24:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:24:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-05-12 12:24:53,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-05-12 12:24:53,034 INFO L175 Difference]: Start difference. First operand has 187 places, 137 transitions, 1627 flow. Second operand 8 states and 141 transitions. [2024-05-12 12:24:53,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 167 transitions, 2043 flow [2024-05-12 12:24:53,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 167 transitions, 1993 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-05-12 12:24:53,121 INFO L231 Difference]: Finished difference. Result has 191 places, 137 transitions, 1634 flow [2024-05-12 12:24:53,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1634, PETRI_PLACES=191, PETRI_TRANSITIONS=137} [2024-05-12 12:24:53,122 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 151 predicate places. [2024-05-12 12:24:53,122 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 137 transitions, 1634 flow [2024-05-12 12:24:53,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:53,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:53,122 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:24:53,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-05-12 12:24:53,122 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:53,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1560542754, now seen corresponding path program 5 times [2024-05-12 12:24:53,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:53,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947471634] [2024-05-12 12:24:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:24:58,435 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:58,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:24:58,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947471634] [2024-05-12 12:24:58,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947471634] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:24:58,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:24:58,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:24:58,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46448345] [2024-05-12 12:24:58,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:24:58,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:24:58,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:24:58,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:24:58,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:24:58,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:24:58,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 137 transitions, 1634 flow. Second operand has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:58,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:24:58,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:24:58,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:24:59,657 INFO L124 PetriNetUnfolderBase]: 1879/4086 cut-off events. [2024-05-12 12:24:59,657 INFO L125 PetriNetUnfolderBase]: For 24019/24019 co-relation queries the response was YES. [2024-05-12 12:24:59,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15007 conditions, 4086 events. 1879/4086 cut-off events. For 24019/24019 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 33825 event pairs, 1048 based on Foata normal form. 6/3871 useless extension candidates. Maximal degree in co-relation 14915. Up to 3341 conditions per place. [2024-05-12 12:24:59,692 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 142 selfloop transitions, 14 changer transitions 0/166 dead transitions. [2024-05-12 12:24:59,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 166 transitions, 2046 flow [2024-05-12 12:24:59,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:24:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:24:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2024-05-12 12:24:59,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4652777777777778 [2024-05-12 12:24:59,696 INFO L175 Difference]: Start difference. First operand has 191 places, 137 transitions, 1634 flow. Second operand 8 states and 134 transitions. [2024-05-12 12:24:59,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 166 transitions, 2046 flow [2024-05-12 12:24:59,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 166 transitions, 1996 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-05-12 12:24:59,798 INFO L231 Difference]: Finished difference. Result has 194 places, 137 transitions, 1616 flow [2024-05-12 12:24:59,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1616, PETRI_PLACES=194, PETRI_TRANSITIONS=137} [2024-05-12 12:24:59,799 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2024-05-12 12:24:59,799 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 137 transitions, 1616 flow [2024-05-12 12:24:59,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.454545454545455) internal successors, (115), 11 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:24:59,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:24:59,799 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:24:59,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-05-12 12:24:59,799 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:24:59,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:24:59,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1203463056, now seen corresponding path program 6 times [2024-05-12 12:24:59,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:24:59,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091586314] [2024-05-12 12:24:59,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:24:59,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:24:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:05,618 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:05,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:05,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091586314] [2024-05-12 12:25:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091586314] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:05,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:25:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039357772] [2024-05-12 12:25:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:05,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:25:05,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:25:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:25:05,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:25:05,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 137 transitions, 1616 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:25:05,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:05,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:25:05,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:06,994 INFO L124 PetriNetUnfolderBase]: 1944/4255 cut-off events. [2024-05-12 12:25:06,994 INFO L125 PetriNetUnfolderBase]: For 25169/25169 co-relation queries the response was YES. [2024-05-12 12:25:07,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15552 conditions, 4255 events. 1944/4255 cut-off events. For 25169/25169 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 35608 event pairs, 1107 based on Foata normal form. 6/4007 useless extension candidates. Maximal degree in co-relation 15459. Up to 3484 conditions per place. [2024-05-12 12:25:07,027 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 141 selfloop transitions, 22 changer transitions 0/173 dead transitions. [2024-05-12 12:25:07,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 173 transitions, 2093 flow [2024-05-12 12:25:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:25:07,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:25:07,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2024-05-12 12:25:07,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-05-12 12:25:07,028 INFO L175 Difference]: Start difference. First operand has 194 places, 137 transitions, 1616 flow. Second operand 9 states and 153 transitions. [2024-05-12 12:25:07,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 173 transitions, 2093 flow [2024-05-12 12:25:07,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 173 transitions, 2023 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-05-12 12:25:07,119 INFO L231 Difference]: Finished difference. Result has 198 places, 140 transitions, 1638 flow [2024-05-12 12:25:07,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1638, PETRI_PLACES=198, PETRI_TRANSITIONS=140} [2024-05-12 12:25:07,119 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2024-05-12 12:25:07,119 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 140 transitions, 1638 flow [2024-05-12 12:25:07,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:25:07,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:07,119 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:25:07,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-05-12 12:25:07,120 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:25:07,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:07,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1375952946, now seen corresponding path program 7 times [2024-05-12 12:25:07,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:07,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998720666] [2024-05-12 12:25:07,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:07,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:13,448 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:13,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:13,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998720666] [2024-05-12 12:25:13,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998720666] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:13,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:13,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:25:13,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009915134] [2024-05-12 12:25:13,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:13,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:25:13,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:13,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:25:13,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:25:13,586 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:25:13,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 140 transitions, 1638 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:25:13,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:13,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:25:13,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:14,835 INFO L124 PetriNetUnfolderBase]: 1938/4257 cut-off events. [2024-05-12 12:25:14,835 INFO L125 PetriNetUnfolderBase]: For 20699/20699 co-relation queries the response was YES. [2024-05-12 12:25:14,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15276 conditions, 4257 events. 1938/4257 cut-off events. For 20699/20699 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 35774 event pairs, 1110 based on Foata normal form. 6/4007 useless extension candidates. Maximal degree in co-relation 15182. Up to 3452 conditions per place. [2024-05-12 12:25:14,866 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 136 selfloop transitions, 24 changer transitions 0/170 dead transitions. [2024-05-12 12:25:14,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 170 transitions, 2058 flow [2024-05-12 12:25:14,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:25:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:25:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 12:25:14,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-05-12 12:25:14,867 INFO L175 Difference]: Start difference. First operand has 198 places, 140 transitions, 1638 flow. Second operand 9 states and 151 transitions. [2024-05-12 12:25:14,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 170 transitions, 2058 flow [2024-05-12 12:25:14,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 170 transitions, 2015 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-05-12 12:25:14,943 INFO L231 Difference]: Finished difference. Result has 202 places, 140 transitions, 1646 flow [2024-05-12 12:25:14,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1646, PETRI_PLACES=202, PETRI_TRANSITIONS=140} [2024-05-12 12:25:14,943 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 162 predicate places. [2024-05-12 12:25:14,943 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 140 transitions, 1646 flow [2024-05-12 12:25:14,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:25:14,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:14,944 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:25:14,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-05-12 12:25:14,944 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:25:14,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1376183586, now seen corresponding path program 8 times [2024-05-12 12:25:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560163149] [2024-05-12 12:25:14,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:25:20,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:20,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560163149] [2024-05-12 12:25:20,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560163149] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:20,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:20,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:25:20,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171822582] [2024-05-12 12:25:20,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:20,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:25:20,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:20,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:25:20,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:25:21,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:25:21,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 140 transitions, 1646 flow. Second operand has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:25:21,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:21,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:25:21,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:22,429 INFO L124 PetriNetUnfolderBase]: 1955/4280 cut-off events. [2024-05-12 12:25:22,429 INFO L125 PetriNetUnfolderBase]: For 19501/19501 co-relation queries the response was YES. [2024-05-12 12:25:22,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15275 conditions, 4280 events. 1955/4280 cut-off events. For 19501/19501 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 36062 event pairs, 1102 based on Foata normal form. 6/4036 useless extension candidates. Maximal degree in co-relation 15180. Up to 3450 conditions per place. [2024-05-12 12:25:22,460 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 140 selfloop transitions, 22 changer transitions 0/172 dead transitions. [2024-05-12 12:25:22,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 172 transitions, 2078 flow [2024-05-12 12:25:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:25:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:25:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-05-12 12:25:22,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660493827160494 [2024-05-12 12:25:22,461 INFO L175 Difference]: Start difference. First operand has 202 places, 140 transitions, 1646 flow. Second operand 9 states and 151 transitions. [2024-05-12 12:25:22,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 172 transitions, 2078 flow [2024-05-12 12:25:22,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 172 transitions, 2016 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-05-12 12:25:22,542 INFO L231 Difference]: Finished difference. Result has 204 places, 140 transitions, 1631 flow [2024-05-12 12:25:22,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1584, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1631, PETRI_PLACES=204, PETRI_TRANSITIONS=140} [2024-05-12 12:25:22,542 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 164 predicate places. [2024-05-12 12:25:22,542 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 140 transitions, 1631 flow [2024-05-12 12:25:22,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.333333333333334) internal successors, (124), 12 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-12 12:25:22,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:22,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:22,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-05-12 12:25:22,543 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:25:22,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash -33793857, now seen corresponding path program 1 times [2024-05-12 12:25:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:22,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775551005] [2024-05-12 12:25:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:22,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 12:25:28,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:28,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775551005] [2024-05-12 12:25:28,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775551005] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:28,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:28,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-05-12 12:25:28,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330710961] [2024-05-12 12:25:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:28,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-05-12 12:25:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:28,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-05-12 12:25:28,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-05-12 12:25:28,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-05-12 12:25:28,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 140 transitions, 1631 flow. Second operand has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:28,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:28,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-05-12 12:25:28,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:30,268 INFO L124 PetriNetUnfolderBase]: 1975/4346 cut-off events. [2024-05-12 12:25:30,269 INFO L125 PetriNetUnfolderBase]: For 17797/17797 co-relation queries the response was YES. [2024-05-12 12:25:30,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15346 conditions, 4346 events. 1975/4346 cut-off events. For 17797/17797 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 36799 event pairs, 1096 based on Foata normal form. 4/4095 useless extension candidates. Maximal degree in co-relation 15253. Up to 3196 conditions per place. [2024-05-12 12:25:30,302 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 126 selfloop transitions, 51 changer transitions 0/187 dead transitions. [2024-05-12 12:25:30,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 187 transitions, 2129 flow [2024-05-12 12:25:30,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 12:25:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 12:25:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 193 transitions. [2024-05-12 12:25:30,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48737373737373735 [2024-05-12 12:25:30,303 INFO L175 Difference]: Start difference. First operand has 204 places, 140 transitions, 1631 flow. Second operand 11 states and 193 transitions. [2024-05-12 12:25:30,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 187 transitions, 2129 flow [2024-05-12 12:25:30,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 187 transitions, 2076 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-05-12 12:25:30,394 INFO L231 Difference]: Finished difference. Result has 207 places, 140 transitions, 1683 flow [2024-05-12 12:25:30,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1683, PETRI_PLACES=207, PETRI_TRANSITIONS=140} [2024-05-12 12:25:30,394 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 167 predicate places. [2024-05-12 12:25:30,395 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 140 transitions, 1683 flow [2024-05-12 12:25:30,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.416666666666666) internal successors, (125), 12 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:30,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:30,395 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:30,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-05-12 12:25:30,395 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:25:30,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash -483413327, now seen corresponding path program 2 times [2024-05-12 12:25:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:30,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552352131] [2024-05-12 12:25:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:35,993 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:35,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552352131] [2024-05-12 12:25:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552352131] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:35,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:35,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-05-12 12:25:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615073010] [2024-05-12 12:25:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:35,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-12 12:25:35,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:35,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-12 12:25:35,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-05-12 12:25:36,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-05-12 12:25:36,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 140 transitions, 1683 flow. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:36,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:36,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-05-12 12:25:36,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:36,841 INFO L124 PetriNetUnfolderBase]: 1561/3624 cut-off events. [2024-05-12 12:25:36,841 INFO L125 PetriNetUnfolderBase]: For 12717/12717 co-relation queries the response was YES. [2024-05-12 12:25:36,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12614 conditions, 3624 events. 1561/3624 cut-off events. For 12717/12717 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 31817 event pairs, 1042 based on Foata normal form. 4/3354 useless extension candidates. Maximal degree in co-relation 12522. Up to 2849 conditions per place. [2024-05-12 12:25:36,863 INFO L140 encePairwiseOnDemand]: 26/36 looper letters, 133 selfloop transitions, 25 changer transitions 0/169 dead transitions. [2024-05-12 12:25:36,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 169 transitions, 2007 flow [2024-05-12 12:25:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 12:25:36,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 12:25:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2024-05-12 12:25:36,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876543209876543 [2024-05-12 12:25:36,864 INFO L175 Difference]: Start difference. First operand has 207 places, 140 transitions, 1683 flow. Second operand 9 states and 158 transitions. [2024-05-12 12:25:36,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 169 transitions, 2007 flow [2024-05-12 12:25:36,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 169 transitions, 1732 flow, removed 3 selfloop flow, removed 50 redundant places. [2024-05-12 12:25:36,894 INFO L231 Difference]: Finished difference. Result has 164 places, 139 transitions, 1366 flow [2024-05-12 12:25:36,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1366, PETRI_PLACES=164, PETRI_TRANSITIONS=139} [2024-05-12 12:25:36,894 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 124 predicate places. [2024-05-12 12:25:36,894 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 139 transitions, 1366 flow [2024-05-12 12:25:36,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 11 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:36,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:36,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:36,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-05-12 12:25:36,895 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:25:36,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:36,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2101672245, now seen corresponding path program 1 times [2024-05-12 12:25:36,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:36,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230774702] [2024-05-12 12:25:36,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:37,052 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:37,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:37,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230774702] [2024-05-12 12:25:37,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230774702] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:37,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:37,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 12:25:37,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300247551] [2024-05-12 12:25:37,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:37,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 12:25:37,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:37,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 12:25:37,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 12:25:37,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 36 [2024-05-12 12:25:37,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 139 transitions, 1366 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:37,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:37,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 36 [2024-05-12 12:25:37,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:37,378 INFO L124 PetriNetUnfolderBase]: 1229/3042 cut-off events. [2024-05-12 12:25:37,378 INFO L125 PetriNetUnfolderBase]: For 6031/6063 co-relation queries the response was YES. [2024-05-12 12:25:37,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9860 conditions, 3042 events. 1229/3042 cut-off events. For 6031/6063 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 25388 event pairs, 262 based on Foata normal form. 247/3160 useless extension candidates. Maximal degree in co-relation 9810. Up to 879 conditions per place. [2024-05-12 12:25:37,392 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 68 selfloop transitions, 46 changer transitions 0/144 dead transitions. [2024-05-12 12:25:37,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 144 transitions, 1584 flow [2024-05-12 12:25:37,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 12:25:37,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 12:25:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2024-05-12 12:25:37,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5777777777777777 [2024-05-12 12:25:37,393 INFO L175 Difference]: Start difference. First operand has 164 places, 139 transitions, 1366 flow. Second operand 5 states and 104 transitions. [2024-05-12 12:25:37,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 144 transitions, 1584 flow [2024-05-12 12:25:37,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 144 transitions, 1491 flow, removed 8 selfloop flow, removed 14 redundant places. [2024-05-12 12:25:37,412 INFO L231 Difference]: Finished difference. Result has 156 places, 134 transitions, 1389 flow [2024-05-12 12:25:37,412 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1389, PETRI_PLACES=156, PETRI_TRANSITIONS=134} [2024-05-12 12:25:37,412 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 116 predicate places. [2024-05-12 12:25:37,412 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 134 transitions, 1389 flow [2024-05-12 12:25:37,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:37,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:37,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:37,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-05-12 12:25:37,413 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:25:37,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:37,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1409358948, now seen corresponding path program 1 times [2024-05-12 12:25:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:37,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186022588] [2024-05-12 12:25:37,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:37,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 12:25:37,856 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:37,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 12:25:37,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186022588] [2024-05-12 12:25:37,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186022588] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 12:25:37,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 12:25:37,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-12 12:25:37,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383108829] [2024-05-12 12:25:37,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 12:25:37,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 12:25:37,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 12:25:37,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 12:25:37,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-12 12:25:37,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 36 [2024-05-12 12:25:37,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 134 transitions, 1389 flow. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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:37,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 12:25:37,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 36 [2024-05-12 12:25:37,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 12:25:38,349 INFO L124 PetriNetUnfolderBase]: 871/2435 cut-off events. [2024-05-12 12:25:38,349 INFO L125 PetriNetUnfolderBase]: For 5483/5504 co-relation queries the response was YES. [2024-05-12 12:25:38,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8211 conditions, 2435 events. 871/2435 cut-off events. For 5483/5504 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 21186 event pairs, 435 based on Foata normal form. 52/2345 useless extension candidates. Maximal degree in co-relation 8164. Up to 978 conditions per place. [2024-05-12 12:25:38,359 INFO L140 encePairwiseOnDemand]: 28/36 looper letters, 41 selfloop transitions, 20 changer transitions 51/166 dead transitions. [2024-05-12 12:25:38,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 166 transitions, 1688 flow [2024-05-12 12:25:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-12 12:25:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-05-12 12:25:38,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2024-05-12 12:25:38,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-05-12 12:25:38,360 INFO L175 Difference]: Start difference. First operand has 156 places, 134 transitions, 1389 flow. Second operand 8 states and 164 transitions. [2024-05-12 12:25:38,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 166 transitions, 1688 flow [2024-05-12 12:25:38,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 166 transitions, 1590 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-05-12 12:25:38,376 INFO L231 Difference]: Finished difference. Result has 164 places, 107 transitions, 1010 flow [2024-05-12 12:25:38,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1010, PETRI_PLACES=164, PETRI_TRANSITIONS=107} [2024-05-12 12:25:38,376 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 124 predicate places. [2024-05-12 12:25:38,376 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 107 transitions, 1010 flow [2024-05-12 12:25:38,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 7 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:38,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 12:25:38,376 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:38,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-05-12 12:25:38,377 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-05-12 12:25:38,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 12:25:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash 418931184, now seen corresponding path program 2 times [2024-05-12 12:25:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 12:25:38,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698631384] [2024-05-12 12:25:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 12:25:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 12:25:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 12:25:38,407 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 12:25:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 12:25:38,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 12:25:38,454 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 12:25:38,454 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-05-12 12:25:38,456 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-05-12 12:25:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-05-12 12:25:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-05-12 12:25:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-05-12 12:25:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-05-12 12:25:38,457 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-05-12 12:25:38,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-05-12 12:25:38,458 INFO L445 BasicCegarLoop]: Path program histogram: [10, 8, 5, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 12:25:38,462 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 12:25:38,462 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 12:25:38,505 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 12:25:38,506 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 12:25:38,506 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 12:25:38 BasicIcfg [2024-05-12 12:25:38,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 12:25:38,507 INFO L158 Benchmark]: Toolchain (without parser) took 324360.69ms. Allocated memory was 148.9MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 90.0MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 214.6MB. Max. memory is 16.1GB. [2024-05-12 12:25:38,507 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:25:38,507 INFO L158 Benchmark]: Witness Parser took 0.09ms. Allocated memory is still 148.9MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 12:25:38,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 776.39ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 90.0MB in the beginning and 158.5MB in the end (delta: -68.5MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-05-12 12:25:38,508 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.16ms. Allocated memory is still 203.4MB. Free memory was 158.5MB in the beginning and 142.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-05-12 12:25:38,508 INFO L158 Benchmark]: Boogie Preprocessor took 121.81ms. Allocated memory is still 203.4MB. Free memory was 142.8MB in the beginning and 135.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-05-12 12:25:38,508 INFO L158 Benchmark]: RCFGBuilder took 988.94ms. Allocated memory is still 203.4MB. Free memory was 135.5MB in the beginning and 103.1MB in the end (delta: 32.4MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2024-05-12 12:25:38,508 INFO L158 Benchmark]: TraceAbstraction took 322359.60ms. Allocated memory was 203.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 102.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 171.5MB. Max. memory is 16.1GB. [2024-05-12 12:25:38,509 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 148.9MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.09ms. Allocated memory is still 148.9MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 776.39ms. Allocated memory was 148.9MB in the beginning and 203.4MB in the end (delta: 54.5MB). Free memory was 90.0MB in the beginning and 158.5MB in the end (delta: -68.5MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.16ms. Allocated memory is still 203.4MB. Free memory was 158.5MB in the beginning and 142.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.81ms. Allocated memory is still 203.4MB. Free memory was 142.8MB in the beginning and 135.5MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 988.94ms. Allocated memory is still 203.4MB. Free memory was 135.5MB in the beginning and 103.1MB in the end (delta: 32.4MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * TraceAbstraction took 322359.60ms. Allocated memory was 203.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 102.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 171.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2305; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L808] 0 //@ ghost multithreaded = 1; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 0 pthread_t t2306; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L810] 0 //@ assert ((((((((((((((((!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (y$read_delayed == (_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_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$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_thd1) + (long long) y$w_buff0) >= 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$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_buff1_thd0) + (long long) y$r_buff1_thd2) >= 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_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff1) >= 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$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$w_buff0) + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) __unbuffered_p1_EAX) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) __unbuffered_p1_EBX) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) 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_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd2) >= 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_p1_EAX + (long long) __unbuffered_p1_EBX) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) weak$$choice2) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) x) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) weak$$choice2) >= 0LL)) && (((long long) 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_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd2) >= 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_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$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_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$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_buff1_thd0 + (long long) y$r_buff1_thd2) >= 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$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$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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd2) >= 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)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EBX) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EBX) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) x) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (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_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$read_delayed) >= 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$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$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (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_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (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_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd2) >= 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_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$read_delayed) >= 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$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$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 - (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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$read_delayed) >= 0LL)))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (0 <= __unbuffered_p1_EAX)) && (0 <= __unbuffered_p1_EBX)) && (0 <= x)) && (0 <= y)) && (0 <= y$mem_tmp)) && (0 <= y$w_buff0)) && (0 <= y$w_buff1)) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EBX <= 1)) && (x <= 1)) && (y <= 1)) && (y$mem_tmp <= 1)) && (y$w_buff0 <= 1)) && (y$w_buff1 <= 1)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (((0 <= __unbuffered_p1_EBX) && (__unbuffered_p1_EBX <= 1)) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))); [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L811] 0 //@ assert ((((((((((((((((!multithreaded || (((0 <= y$w_buff0) && (y$w_buff0 <= 1)) && ((y$w_buff0 == 0) || (y$w_buff0 == 1)))) && (!multithreaded || (y$read_delayed == (_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_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$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_thd1) + (long long) y$w_buff0) >= 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$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_buff1_thd0) + (long long) y$r_buff1_thd2) >= 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_thd1) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd1) + (long long) y$w_buff1) >= 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$read_delayed) + (long long) y$w_buff0) >= 0LL)) && (((0LL - (long long) y$read_delayed) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$w_buff0) + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) __unbuffered_p1_EAX) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) __unbuffered_p1_EBX) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) 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_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt + (long long) y$r_buff1_thd2) >= 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_p1_EAX + (long long) __unbuffered_p1_EBX) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) x) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p1_EAX + (long long) weak$$choice2) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) main$tmp_guard1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) x) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$flush_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) y$w_buff1) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p1_EBX + (long long) weak$$choice2) >= 0LL)) && (((long long) 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_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) x + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp + (long long) y$r_buff1_thd2) >= 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_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$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_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$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_buff1_thd0 + (long long) y$r_buff1_thd2) >= 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$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$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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 + (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 + (long long) y$r_buff1_thd2) >= 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)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EBX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EBX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EBX) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EBX) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) x) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) x) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$mem_tmp) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$w_buff1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (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_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$read_delayed) >= 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$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$read_delayed) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$read_delayed) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$read_delayed) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$r_buff1_thd1) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff0) >= 0LL)) && (((2LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((2LL - (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_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) y$read_delayed) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$r_buff0_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$r_buff0_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$r_buff1_thd0) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) __unbuffered_p1_EBX - (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_buff1_thd0) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) x - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$r_buff1_thd2) >= 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_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$read_delayed) >= 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$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$read_delayed) >= 0LL)) && (((long long) y$r_buff1_thd2 - (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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$r_buff1_thd2) >= 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_buff1_thd0) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$r_buff1_thd2) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$read_delayed) >= 0LL)))) && (!multithreaded || (y$r_buff1_thd2 == (_Bool) 0))) && (!multithreaded || (y$r_buff0_thd2 == (_Bool) 0))) && (!multithreaded || (((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (0 <= __unbuffered_p1_EAX)) && (0 <= __unbuffered_p1_EBX)) && (0 <= x)) && (0 <= y)) && (0 <= y$mem_tmp)) && (0 <= y$w_buff0)) && (0 <= y$w_buff1)) && (__unbuffered_p1_EAX <= 1)) && (__unbuffered_p1_EBX <= 1)) && (x <= 1)) && (y <= 1)) && (y$mem_tmp <= 1)) && (y$w_buff0 <= 1)) && (y$w_buff1 <= 1)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))) && ((y$w_buff0 == 0) || (y$w_buff0 == 1))) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (y$read_delayed_var == 0))) && (!multithreaded || (y$r_buff0_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y$w_buff1) && (y$w_buff1 <= 1)) && ((y$w_buff1 == 0) || (y$w_buff1 == 1))))) && (!multithreaded || (((0 <= __unbuffered_p1_EBX) && (__unbuffered_p1_EBX <= 1)) && ((__unbuffered_p1_EBX == 0) || (__unbuffered_p1_EBX == 1))))) && (!multithreaded || (y$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || (((0 <= y) && (y <= 1)) && ((y == 0) || (y == 1))))) && (!multithreaded || (((0 <= x) && (x <= 1)) && ((x == 0) || (x == 1))))) && (!multithreaded || (((0 <= __unbuffered_p1_EAX) && (__unbuffered_p1_EAX <= 1)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))))) && (!multithreaded || (((0 <= y$mem_tmp) && (y$mem_tmp <= 1)) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))))) && (!multithreaded || (0 <= __unbuffered_cnt))); VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L825] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 808]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 322.2s, OverallIterations: 57, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 48.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3874 SdHoareTripleChecker+Valid, 21.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3434 mSDsluCounter, 683 SdHoareTripleChecker+Invalid, 19.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 557 mSDsCounter, 915 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23826 IncrementalHoareTripleChecker+Invalid, 24741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 915 mSolverCounterUnsat, 126 mSDtfsCounter, 23826 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 534 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 518 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 15.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1683occurred in iteration=53, InterpolantAutomatonStates: 443, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 270.1s InterpolantComputationTime, 914 NumberOfCodeBlocks, 914 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 832 ConstructedInterpolants, 0 QuantifiedInterpolants, 37205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 56 InterpolantComputations, 56 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-12 12:25:38,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE