./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_rmo.oepc_rmo.opt-thin000_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-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 22:39:03,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:39:03,738 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:39:03,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:39:03,743 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:39:03,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:39:03,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:39:03,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:39:03,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:39:03,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:39:03,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:39:03,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:39:03,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:39:03,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:39:03,771 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:39:03,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:39:03,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:39:03,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:39:03,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:39:03,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:39:03,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:39:03,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:39:03,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:39:03,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:39:03,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:39:03,774 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:39:03,774 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:39:03,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:39:03,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:39:03,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:39:03,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:39:03,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:39:03,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:39:03,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:39:03,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:39:03,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:39:03,788 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:39:03,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:39:03,788 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:39:03,788 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:39:03,788 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:39:03,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:39:03,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:39:03,789 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 22:39:04,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:39:04,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:39:04,030 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:39:04,031 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:39:04,031 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:39:04,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml [2024-06-27 22:39:04,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:39:04,091 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:39:04,092 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-27 22:39:05,116 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:39:05,288 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:39:05,288 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-27 22:39:05,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58103cb24/c75ddd3b548042f2b3e3de03df01dd12/FLAG9bb3eba30 [2024-06-27 22:39:05,311 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58103cb24/c75ddd3b548042f2b3e3de03df01dd12 [2024-06-27 22:39:05,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:39:05,313 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:39:05,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:39:05,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:39:05,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:39:05,318 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:39:04" (1/2) ... [2024-06-27 22:39:05,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae44b71 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:39:05, skipping insertion in model container [2024-06-27 22:39:05,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:39:04" (1/2) ... [2024-06-27 22:39:05,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@24257a90 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:39:05, skipping insertion in model container [2024-06-27 22:39:05,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:39:05" (2/2) ... [2024-06-27 22:39:05,320 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ae44b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05, skipping insertion in model container [2024-06-27 22:39:05,320 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:39:05" (2/2) ... [2024-06-27 22:39:05,321 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:39:05,336 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:39:05,340 INFO L97 edCorrectnessWitness]: Location invariant before [L816-L816] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )x) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) [2024-06-27 22:39:05,340 INFO L97 edCorrectnessWitness]: Location invariant before [L815-L815] ! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL && (1LL - (long long )__unbuffered_p1_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) + (long long )y$w_buff1_used >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )x) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice1) - (long long )y$mem_tmp >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$mem_tmp) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff0_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$r_buff1_thd2) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff0_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )__unbuffered_p1_EAX >= 0LL) && (1LL - (long long )__unbuffered_p0_EAX$w_buff1_used) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EAX) - (long long )y$w_buff1_used >= 0LL) && (1LL - (long long )y$flush_delayed) - (long long )y$mem_tmp >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff0_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$r_buff1_thd2 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff0_used >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1 >= 0LL) && (1LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )__unbuffered_p1_EAX >= 0LL) && (2LL - (long long )__unbuffered_p0_EAX$read_delayed) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )__unbuffered_p1_EAX) - (long long )weak$$choice2 >= 0LL) && (2LL - (long long )x) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )y$mem_tmp >= 0LL) && (2LL - (long long )weak$$choice2) - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL) && (long long )y - (long long )y$mem_tmp >= 0LL) [2024-06-27 22:39:05,341 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:39:05,341 INFO L106 edCorrectnessWitness]: ghost_update [L813-L813] multithreaded = 1; [2024-06-27 22:39:05,380 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:39:05,538 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2024-06-27 22:39:05,701 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:39:05,710 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:39:05,734 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:39:05,863 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:39:05,891 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:39:05,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05 WrapperNode [2024-06-27 22:39:05,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:39:05,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:39:05,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:39:05,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:39:05,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:05,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:05,965 INFO L138 Inliner]: procedures = 174, calls = 50, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-06-27 22:39:05,965 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:39:05,966 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:39:05,966 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:39:05,966 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:39:05,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:05,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:05,979 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:05,995 INFO L175 MemorySlicer]: Split 19 memory accesses to 2 slices as follows [2, 17]. 89 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-06-27 22:39:05,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:05,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:06,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:06,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:06,012 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:06,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:06,020 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:39:06,021 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:39:06,021 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:39:06,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:39:06,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (1/1) ... [2024-06-27 22:39:06,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:39:06,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:39:06,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 22:39:06,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 22:39:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 22:39:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 22:39:06,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 22:39:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 22:39:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:39:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:39:06,124 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:39:06,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:39:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:39:06,125 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:39:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:39:06,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 22:39:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:39:06,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:39:06,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:39:06,130 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 22:39:06,244 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:39:06,245 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:39:06,721 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:39:06,722 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:39:06,965 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:39:06,965 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:39:06,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:39:06 BoogieIcfgContainer [2024-06-27 22:39:06,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:39:06,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:39:06,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:39:06,971 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:39:06,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:39:04" (1/4) ... [2024-06-27 22:39:06,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489914c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:39:06, skipping insertion in model container [2024-06-27 22:39:06,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:39:05" (2/4) ... [2024-06-27 22:39:06,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489914c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:39:06, skipping insertion in model container [2024-06-27 22:39:06,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:39:05" (3/4) ... [2024-06-27 22:39:06,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489914c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:39:06, skipping insertion in model container [2024-06-27 22:39:06,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:39:06" (4/4) ... [2024-06-27 22:39:06,975 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-06-27 22:39:06,989 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:39:06,989 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 22:39:06,989 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:39:07,042 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:39:07,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:39:07,104 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 22:39:07,104 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:39:07,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 33 events. 1/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 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-06-27 22:39:07,107 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:39:07,111 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 66 flow [2024-06-27 22:39:07,122 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:39:07,132 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;@5f2f59fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:39:07,132 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 22:39:07,138 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:39:07,138 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:39:07,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:39:07,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:07,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:39:07,139 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:07,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash 477228305, now seen corresponding path program 1 times [2024-06-27 22:39:07,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:07,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422346978] [2024-06-27 22:39:07,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:07,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:09,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422346978] [2024-06-27 22:39:09,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422346978] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:09,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:09,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:39:09,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948281364] [2024-06-27 22:39:09,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:09,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:39:09,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:09,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:39:09,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:39:09,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:39:09,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 30 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:09,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:09,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:39:09,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:09,738 INFO L124 PetriNetUnfolderBase]: 353/621 cut-off events. [2024-06-27 22:39:09,738 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-27 22:39:09,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1239 conditions, 621 events. 353/621 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2759 event pairs, 133 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 1228. Up to 590 conditions per place. [2024-06-27 22:39:09,746 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2024-06-27 22:39:09,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 43 transitions, 167 flow [2024-06-27 22:39:09,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:39:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:39:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2024-06-27 22:39:09,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6476190476190476 [2024-06-27 22:39:09,757 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 66 flow. Second operand 3 states and 68 transitions. [2024-06-27 22:39:09,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 43 transitions, 167 flow [2024-06-27 22:39:09,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:39:09,761 INFO L231 Difference]: Finished difference. Result has 38 places, 32 transitions, 85 flow [2024-06-27 22:39:09,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=38, PETRI_TRANSITIONS=32} [2024-06-27 22:39:09,765 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-06-27 22:39:09,765 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 32 transitions, 85 flow [2024-06-27 22:39:09,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:09,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:09,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:09,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:39:09,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:09,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:09,767 INFO L85 PathProgramCache]: Analyzing trace with hash -945061392, now seen corresponding path program 1 times [2024-06-27 22:39:09,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:09,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277811870] [2024-06-27 22:39:09,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:09,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:12,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277811870] [2024-06-27 22:39:12,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277811870] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:12,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:12,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:39:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509902084] [2024-06-27 22:39:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:12,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:39:12,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:12,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:39:12,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:39:12,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:39:12,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 32 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:12,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:12,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:39:12,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:12,756 INFO L124 PetriNetUnfolderBase]: 350/615 cut-off events. [2024-06-27 22:39:12,756 INFO L125 PetriNetUnfolderBase]: For 92/96 co-relation queries the response was YES. [2024-06-27 22:39:12,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 615 events. 350/615 cut-off events. For 92/96 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2730 event pairs, 94 based on Foata normal form. 4/616 useless extension candidates. Maximal degree in co-relation 1354. Up to 562 conditions per place. [2024-06-27 22:39:12,760 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2024-06-27 22:39:12,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 56 transitions, 237 flow [2024-06-27 22:39:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:39:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:39:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-27 22:39:12,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-27 22:39:12,762 INFO L175 Difference]: Start difference. First operand has 38 places, 32 transitions, 85 flow. Second operand 4 states and 91 transitions. [2024-06-27 22:39:12,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 56 transitions, 237 flow [2024-06-27 22:39:12,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 56 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:39:12,763 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 109 flow [2024-06-27 22:39:12,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2024-06-27 22:39:12,764 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2024-06-27 22:39:12,764 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 109 flow [2024-06-27 22:39:12,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:12,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:12,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:12,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:39:12,765 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:12,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:12,766 INFO L85 PathProgramCache]: Analyzing trace with hash 767869174, now seen corresponding path program 1 times [2024-06-27 22:39:12,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:12,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143922316] [2024-06-27 22:39:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:12,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:15,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:15,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143922316] [2024-06-27 22:39:15,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143922316] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:15,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:15,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:39:15,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980516692] [2024-06-27 22:39:15,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:15,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:39:15,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:39:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:39:15,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:39:15,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-06-27 22:39:15,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:15,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:39:15,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:15,604 INFO L124 PetriNetUnfolderBase]: 419/724 cut-off events. [2024-06-27 22:39:15,604 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2024-06-27 22:39:15,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1750 conditions, 724 events. 419/724 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3219 event pairs, 67 based on Foata normal form. 2/724 useless extension candidates. Maximal degree in co-relation 1736. Up to 649 conditions per place. [2024-06-27 22:39:15,610 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 60 selfloop transitions, 7 changer transitions 0/73 dead transitions. [2024-06-27 22:39:15,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 73 transitions, 335 flow [2024-06-27 22:39:15,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:39:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:39:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-06-27 22:39:15,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-27 22:39:15,616 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 109 flow. Second operand 5 states and 110 transitions. [2024-06-27 22:39:15,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 73 transitions, 335 flow [2024-06-27 22:39:15,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 73 transitions, 324 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 22:39:15,619 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 153 flow [2024-06-27 22:39:15,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=153, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2024-06-27 22:39:15,620 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2024-06-27 22:39:15,620 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 153 flow [2024-06-27 22:39:15,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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-06-27 22:39:15,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:15,621 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:15,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:39:15,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:15,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:15,622 INFO L85 PathProgramCache]: Analyzing trace with hash -812652193, now seen corresponding path program 1 times [2024-06-27 22:39:15,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:15,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023463650] [2024-06-27 22:39:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:15,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:18,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:18,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023463650] [2024-06-27 22:39:18,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023463650] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:18,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:18,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:39:18,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796972528] [2024-06-27 22:39:18,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:18,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:39:18,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:18,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:39:18,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:39:18,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:39:18,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 153 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:18,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:18,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:39:18,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:19,476 INFO L124 PetriNetUnfolderBase]: 415/716 cut-off events. [2024-06-27 22:39:19,476 INFO L125 PetriNetUnfolderBase]: For 424/424 co-relation queries the response was YES. [2024-06-27 22:39:19,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1905 conditions, 716 events. 415/716 cut-off events. For 424/424 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3185 event pairs, 18 based on Foata normal form. 4/718 useless extension candidates. Maximal degree in co-relation 1888. Up to 595 conditions per place. [2024-06-27 22:39:19,480 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 66 selfloop transitions, 8 changer transitions 0/80 dead transitions. [2024-06-27 22:39:19,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 381 flow [2024-06-27 22:39:19,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:39:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:39:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-27 22:39:19,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 22:39:19,483 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 153 flow. Second operand 6 states and 126 transitions. [2024-06-27 22:39:19,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 381 flow [2024-06-27 22:39:19,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 80 transitions, 381 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:39:19,488 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 165 flow [2024-06-27 22:39:19,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-06-27 22:39:19,490 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2024-06-27 22:39:19,490 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 165 flow [2024-06-27 22:39:19,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:19,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:19,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:19,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:39:19,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:19,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:19,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1021243570, now seen corresponding path program 1 times [2024-06-27 22:39:19,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:19,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369221001] [2024-06-27 22:39:19,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:19,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:21,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:21,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369221001] [2024-06-27 22:39:21,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369221001] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:21,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:21,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:39:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517622470] [2024-06-27 22:39:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:21,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:39:21,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:21,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:39:21,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:39:21,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:21,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:21,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:21,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:21,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:22,543 INFO L124 PetriNetUnfolderBase]: 418/727 cut-off events. [2024-06-27 22:39:22,544 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2024-06-27 22:39:22,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 727 events. 418/727 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3250 event pairs, 74 based on Foata normal form. 1/726 useless extension candidates. Maximal degree in co-relation 2017. Up to 641 conditions per place. [2024-06-27 22:39:22,549 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 47 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2024-06-27 22:39:22,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 64 transitions, 357 flow [2024-06-27 22:39:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:39:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:39:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-27 22:39:22,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2024-06-27 22:39:22,552 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 165 flow. Second operand 5 states and 92 transitions. [2024-06-27 22:39:22,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 64 transitions, 357 flow [2024-06-27 22:39:22,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 334 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 22:39:22,557 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 223 flow [2024-06-27 22:39:22,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=223, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2024-06-27 22:39:22,562 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2024-06-27 22:39:22,563 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 223 flow [2024-06-27 22:39:22,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:22,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:22,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:22,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:39:22,563 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:22,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:22,564 INFO L85 PathProgramCache]: Analyzing trace with hash -563307317, now seen corresponding path program 1 times [2024-06-27 22:39:22,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:22,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472089401] [2024-06-27 22:39:22,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:22,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:25,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472089401] [2024-06-27 22:39:25,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472089401] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:25,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:25,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087807032] [2024-06-27 22:39:25,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:25,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:25,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:25,851 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:25,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 223 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:25,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:25,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:25,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:26,399 INFO L124 PetriNetUnfolderBase]: 416/722 cut-off events. [2024-06-27 22:39:26,399 INFO L125 PetriNetUnfolderBase]: For 776/776 co-relation queries the response was YES. [2024-06-27 22:39:26,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2190 conditions, 722 events. 416/722 cut-off events. For 776/776 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3226 event pairs, 68 based on Foata normal form. 1/721 useless extension candidates. Maximal degree in co-relation 2165. Up to 639 conditions per place. [2024-06-27 22:39:26,403 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 49 selfloop transitions, 10 changer transitions 0/64 dead transitions. [2024-06-27 22:39:26,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 385 flow [2024-06-27 22:39:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:39:26,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:39:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-27 22:39:26,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:39:26,405 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 223 flow. Second operand 5 states and 90 transitions. [2024-06-27 22:39:26,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 385 flow [2024-06-27 22:39:26,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 64 transitions, 385 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:39:26,409 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 251 flow [2024-06-27 22:39:26,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2024-06-27 22:39:26,411 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 21 predicate places. [2024-06-27 22:39:26,411 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 251 flow [2024-06-27 22:39:26,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:26,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:26,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:26,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:39:26,412 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:26,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:26,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1559112793, now seen corresponding path program 1 times [2024-06-27 22:39:26,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:26,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967753830] [2024-06-27 22:39:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:26,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:30,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:30,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:30,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967753830] [2024-06-27 22:39:30,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967753830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:30,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:30,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:30,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614433886] [2024-06-27 22:39:30,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:30,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:30,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:30,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:30,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:30,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:30,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:30,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:31,553 INFO L124 PetriNetUnfolderBase]: 431/751 cut-off events. [2024-06-27 22:39:31,553 INFO L125 PetriNetUnfolderBase]: For 1037/1037 co-relation queries the response was YES. [2024-06-27 22:39:31,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2376 conditions, 751 events. 431/751 cut-off events. For 1037/1037 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3400 event pairs, 60 based on Foata normal form. 1/750 useless extension candidates. Maximal degree in co-relation 2346. Up to 597 conditions per place. [2024-06-27 22:39:31,558 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 89 selfloop transitions, 17 changer transitions 0/111 dead transitions. [2024-06-27 22:39:31,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 641 flow [2024-06-27 22:39:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:39:31,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:39:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 181 transitions. [2024-06-27 22:39:31,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5171428571428571 [2024-06-27 22:39:31,559 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 251 flow. Second operand 10 states and 181 transitions. [2024-06-27 22:39:31,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 641 flow [2024-06-27 22:39:31,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 111 transitions, 626 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:39:31,563 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 299 flow [2024-06-27 22:39:31,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=299, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2024-06-27 22:39:31,564 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 28 predicate places. [2024-06-27 22:39:31,564 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 299 flow [2024-06-27 22:39:31,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:31,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:31,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:31,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:39:31,565 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:31,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:31,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1559232763, now seen corresponding path program 2 times [2024-06-27 22:39:31,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:31,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583663132] [2024-06-27 22:39:31,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:31,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:39,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:39,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583663132] [2024-06-27 22:39:39,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583663132] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:39,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:39,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:39,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555124151] [2024-06-27 22:39:39,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:39,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:39,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:39,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:39,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 299 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:39,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:39,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:39,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:40,498 INFO L124 PetriNetUnfolderBase]: 495/875 cut-off events. [2024-06-27 22:39:40,500 INFO L125 PetriNetUnfolderBase]: For 1685/1688 co-relation queries the response was YES. [2024-06-27 22:39:40,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2961 conditions, 875 events. 495/875 cut-off events. For 1685/1688 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4209 event pairs, 75 based on Foata normal form. 3/875 useless extension candidates. Maximal degree in co-relation 2930. Up to 693 conditions per place. [2024-06-27 22:39:40,506 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 65 selfloop transitions, 18 changer transitions 0/88 dead transitions. [2024-06-27 22:39:40,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 88 transitions, 606 flow [2024-06-27 22:39:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:39:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:39:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 122 transitions. [2024-06-27 22:39:40,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49795918367346936 [2024-06-27 22:39:40,509 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 299 flow. Second operand 7 states and 122 transitions. [2024-06-27 22:39:40,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 88 transitions, 606 flow [2024-06-27 22:39:40,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 553 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-06-27 22:39:40,513 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 373 flow [2024-06-27 22:39:40,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=373, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2024-06-27 22:39:40,515 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2024-06-27 22:39:40,515 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 373 flow [2024-06-27 22:39:40,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:40,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:40,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:40,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:39:40,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:40,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:40,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1559232949, now seen corresponding path program 1 times [2024-06-27 22:39:40,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:40,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290702970] [2024-06-27 22:39:40,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:40,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:44,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290702970] [2024-06-27 22:39:44,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290702970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:44,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:44,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:44,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504559630] [2024-06-27 22:39:44,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:44,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:44,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:44,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:44,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:44,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:44,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 373 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:44,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:44,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:44,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:44,740 INFO L124 PetriNetUnfolderBase]: 525/921 cut-off events. [2024-06-27 22:39:44,741 INFO L125 PetriNetUnfolderBase]: For 1843/1846 co-relation queries the response was YES. [2024-06-27 22:39:44,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 921 events. 525/921 cut-off events. For 1843/1846 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4376 event pairs, 73 based on Foata normal form. 4/922 useless extension candidates. Maximal degree in co-relation 3112. Up to 743 conditions per place. [2024-06-27 22:39:44,746 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 68 selfloop transitions, 16 changer transitions 0/89 dead transitions. [2024-06-27 22:39:44,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 89 transitions, 619 flow [2024-06-27 22:39:44,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:39:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:39:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-27 22:39:44,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 22:39:44,748 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 373 flow. Second operand 7 states and 120 transitions. [2024-06-27 22:39:44,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 89 transitions, 619 flow [2024-06-27 22:39:44,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 600 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-06-27 22:39:44,753 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 403 flow [2024-06-27 22:39:44,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=403, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2024-06-27 22:39:44,755 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 34 predicate places. [2024-06-27 22:39:44,755 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 403 flow [2024-06-27 22:39:44,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:44,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:44,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:44,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:39:44,755 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:44,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1700615517, now seen corresponding path program 2 times [2024-06-27 22:39:44,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:44,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447220399] [2024-06-27 22:39:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:44,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:47,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:47,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:47,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447220399] [2024-06-27 22:39:47,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447220399] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:47,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:47,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:47,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345601157] [2024-06-27 22:39:47,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:47,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:47,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:47,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:47,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:47,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:47,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 403 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:47,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:47,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:47,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:48,569 INFO L124 PetriNetUnfolderBase]: 555/961 cut-off events. [2024-06-27 22:39:48,569 INFO L125 PetriNetUnfolderBase]: For 2414/2414 co-relation queries the response was YES. [2024-06-27 22:39:48,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3416 conditions, 961 events. 555/961 cut-off events. For 2414/2414 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4548 event pairs, 73 based on Foata normal form. 2/961 useless extension candidates. Maximal degree in co-relation 3382. Up to 680 conditions per place. [2024-06-27 22:39:48,576 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 83 selfloop transitions, 22 changer transitions 0/110 dead transitions. [2024-06-27 22:39:48,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 110 transitions, 765 flow [2024-06-27 22:39:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:39:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:39:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 22:39:48,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-27 22:39:48,578 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 403 flow. Second operand 8 states and 148 transitions. [2024-06-27 22:39:48,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 110 transitions, 765 flow [2024-06-27 22:39:48,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 110 transitions, 732 flow, removed 2 selfloop flow, removed 5 redundant places. [2024-06-27 22:39:48,586 INFO L231 Difference]: Finished difference. Result has 74 places, 65 transitions, 448 flow [2024-06-27 22:39:48,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=448, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2024-06-27 22:39:48,587 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 37 predicate places. [2024-06-27 22:39:48,587 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 448 flow [2024-06-27 22:39:48,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:48,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:48,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:48,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:39:48,589 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:48,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:48,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1658472749, now seen corresponding path program 3 times [2024-06-27 22:39:48,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:48,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281005139] [2024-06-27 22:39:48,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:48,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:51,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:51,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281005139] [2024-06-27 22:39:51,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281005139] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:51,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:51,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:51,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298385355] [2024-06-27 22:39:51,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:51,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:51,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:51,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:51,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:51,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:51,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 448 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:51,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:51,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:51,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:51,817 INFO L124 PetriNetUnfolderBase]: 563/989 cut-off events. [2024-06-27 22:39:51,818 INFO L125 PetriNetUnfolderBase]: For 3015/3024 co-relation queries the response was YES. [2024-06-27 22:39:51,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 989 events. 563/989 cut-off events. For 3015/3024 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4798 event pairs, 89 based on Foata normal form. 7/992 useless extension candidates. Maximal degree in co-relation 3582. Up to 726 conditions per place. [2024-06-27 22:39:51,823 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 64 selfloop transitions, 25 changer transitions 0/94 dead transitions. [2024-06-27 22:39:51,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 726 flow [2024-06-27 22:39:51,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:39:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:39:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-27 22:39:51,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 22:39:51,825 INFO L175 Difference]: Start difference. First operand has 74 places, 65 transitions, 448 flow. Second operand 7 states and 120 transitions. [2024-06-27 22:39:51,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 726 flow [2024-06-27 22:39:51,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 679 flow, removed 8 selfloop flow, removed 5 redundant places. [2024-06-27 22:39:51,831 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 489 flow [2024-06-27 22:39:51,831 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=489, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2024-06-27 22:39:51,832 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2024-06-27 22:39:51,832 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 489 flow [2024-06-27 22:39:51,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:51,832 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:51,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:51,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:39:51,833 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:51,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash -973038255, now seen corresponding path program 3 times [2024-06-27 22:39:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:51,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182091137] [2024-06-27 22:39:51,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:51,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:54,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:54,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182091137] [2024-06-27 22:39:54,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182091137] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:54,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:54,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:54,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009046138] [2024-06-27 22:39:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:54,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:54,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:54,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:54,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:54,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 489 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:54,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:54,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:54,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:54,858 INFO L124 PetriNetUnfolderBase]: 578/1017 cut-off events. [2024-06-27 22:39:54,858 INFO L125 PetriNetUnfolderBase]: For 3182/3191 co-relation queries the response was YES. [2024-06-27 22:39:54,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3868 conditions, 1017 events. 578/1017 cut-off events. For 3182/3191 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5013 event pairs, 89 based on Foata normal form. 7/1020 useless extension candidates. Maximal degree in co-relation 3833. Up to 788 conditions per place. [2024-06-27 22:39:54,865 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 65 selfloop transitions, 20 changer transitions 0/90 dead transitions. [2024-06-27 22:39:54,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 90 transitions, 726 flow [2024-06-27 22:39:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:39:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:39:54,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-06-27 22:39:54,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2024-06-27 22:39:54,866 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 489 flow. Second operand 6 states and 102 transitions. [2024-06-27 22:39:54,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 90 transitions, 726 flow [2024-06-27 22:39:54,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 90 transitions, 686 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-27 22:39:54,872 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 524 flow [2024-06-27 22:39:54,872 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2024-06-27 22:39:54,873 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 41 predicate places. [2024-06-27 22:39:54,873 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 524 flow [2024-06-27 22:39:54,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:54,873 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:54,874 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:54,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:39:54,874 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:54,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash -282656021, now seen corresponding path program 1 times [2024-06-27 22:39:54,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:54,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266190830] [2024-06-27 22:39:54,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:54,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:58,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:58,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:58,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266190830] [2024-06-27 22:39:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266190830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:58,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:58,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:39:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600410569] [2024-06-27 22:39:58,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:58,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:39:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:58,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:39:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:39:58,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:58,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 524 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:58,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:58,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:58,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:59,145 INFO L124 PetriNetUnfolderBase]: 575/1004 cut-off events. [2024-06-27 22:39:59,145 INFO L125 PetriNetUnfolderBase]: For 3530/3530 co-relation queries the response was YES. [2024-06-27 22:39:59,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 1004 events. 575/1004 cut-off events. For 3530/3530 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4802 event pairs, 100 based on Foata normal form. 2/1004 useless extension candidates. Maximal degree in co-relation 3863. Up to 856 conditions per place. [2024-06-27 22:39:59,153 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 81 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2024-06-27 22:39:59,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 778 flow [2024-06-27 22:39:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:39:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:39:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-27 22:39:59,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46530612244897956 [2024-06-27 22:39:59,156 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 524 flow. Second operand 7 states and 114 transitions. [2024-06-27 22:39:59,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 778 flow [2024-06-27 22:39:59,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 97 transitions, 744 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-27 22:39:59,164 INFO L231 Difference]: Finished difference. Result has 81 places, 71 transitions, 516 flow [2024-06-27 22:39:59,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=516, PETRI_PLACES=81, PETRI_TRANSITIONS=71} [2024-06-27 22:39:59,165 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 44 predicate places. [2024-06-27 22:39:59,165 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 71 transitions, 516 flow [2024-06-27 22:39:59,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:39:59,165 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:59,165 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:59,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:39:59,165 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:39:59,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1087857887, now seen corresponding path program 1 times [2024-06-27 22:39:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:59,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546923769] [2024-06-27 22:39:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:59,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:02,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:02,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546923769] [2024-06-27 22:40:02,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546923769] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:02,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:02,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:02,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779545856] [2024-06-27 22:40:02,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:02,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:02,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:02,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:02,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:02,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 71 transitions, 516 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:02,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:02,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:02,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:04,279 INFO L124 PetriNetUnfolderBase]: 639/1117 cut-off events. [2024-06-27 22:40:04,288 INFO L125 PetriNetUnfolderBase]: For 3383/3387 co-relation queries the response was YES. [2024-06-27 22:40:04,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4251 conditions, 1117 events. 639/1117 cut-off events. For 3383/3387 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5482 event pairs, 65 based on Foata normal form. 6/1121 useless extension candidates. Maximal degree in co-relation 4214. Up to 656 conditions per place. [2024-06-27 22:40:04,294 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 118 selfloop transitions, 37 changer transitions 0/160 dead transitions. [2024-06-27 22:40:04,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 160 transitions, 1128 flow [2024-06-27 22:40:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:40:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:40:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 236 transitions. [2024-06-27 22:40:04,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5186813186813187 [2024-06-27 22:40:04,296 INFO L175 Difference]: Start difference. First operand has 81 places, 71 transitions, 516 flow. Second operand 13 states and 236 transitions. [2024-06-27 22:40:04,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 160 transitions, 1128 flow [2024-06-27 22:40:04,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 160 transitions, 1097 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-06-27 22:40:04,303 INFO L231 Difference]: Finished difference. Result has 88 places, 75 transitions, 592 flow [2024-06-27 22:40:04,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=592, PETRI_PLACES=88, PETRI_TRANSITIONS=75} [2024-06-27 22:40:04,304 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 51 predicate places. [2024-06-27 22:40:04,304 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 75 transitions, 592 flow [2024-06-27 22:40:04,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:04,304 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:04,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:04,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:40:04,305 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:04,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2096485307, now seen corresponding path program 2 times [2024-06-27 22:40:04,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:04,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417531128] [2024-06-27 22:40:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:04,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:09,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:09,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417531128] [2024-06-27 22:40:09,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417531128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:09,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:09,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720476690] [2024-06-27 22:40:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:09,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:09,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:09,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:09,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:09,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 75 transitions, 592 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:09,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:09,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:09,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:10,547 INFO L124 PetriNetUnfolderBase]: 703/1227 cut-off events. [2024-06-27 22:40:10,547 INFO L125 PetriNetUnfolderBase]: For 4808/4814 co-relation queries the response was YES. [2024-06-27 22:40:10,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4960 conditions, 1227 events. 703/1227 cut-off events. For 4808/4814 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6170 event pairs, 81 based on Foata normal form. 6/1230 useless extension candidates. Maximal degree in co-relation 4923. Up to 904 conditions per place. [2024-06-27 22:40:10,555 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 105 selfloop transitions, 25 changer transitions 0/135 dead transitions. [2024-06-27 22:40:10,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 135 transitions, 1078 flow [2024-06-27 22:40:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:40:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:40:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 177 transitions. [2024-06-27 22:40:10,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057142857142857 [2024-06-27 22:40:10,556 INFO L175 Difference]: Start difference. First operand has 88 places, 75 transitions, 592 flow. Second operand 10 states and 177 transitions. [2024-06-27 22:40:10,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 135 transitions, 1078 flow [2024-06-27 22:40:10,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 135 transitions, 1007 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-06-27 22:40:10,566 INFO L231 Difference]: Finished difference. Result has 89 places, 79 transitions, 615 flow [2024-06-27 22:40:10,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=615, PETRI_PLACES=89, PETRI_TRANSITIONS=79} [2024-06-27 22:40:10,567 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 52 predicate places. [2024-06-27 22:40:10,567 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 79 transitions, 615 flow [2024-06-27 22:40:10,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:10,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:10,568 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:10,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:40:10,568 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:10,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1091576957, now seen corresponding path program 3 times [2024-06-27 22:40:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:10,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597204939] [2024-06-27 22:40:10,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:10,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:15,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597204939] [2024-06-27 22:40:15,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597204939] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:15,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:15,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252664401] [2024-06-27 22:40:15,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:15,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:15,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:15,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:15,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:15,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 79 transitions, 615 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:15,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:15,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:15,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:16,555 INFO L124 PetriNetUnfolderBase]: 699/1213 cut-off events. [2024-06-27 22:40:16,555 INFO L125 PetriNetUnfolderBase]: For 4713/4719 co-relation queries the response was YES. [2024-06-27 22:40:16,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 1213 events. 699/1213 cut-off events. For 4713/4719 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6062 event pairs, 80 based on Foata normal form. 6/1216 useless extension candidates. Maximal degree in co-relation 4882. Up to 901 conditions per place. [2024-06-27 22:40:16,562 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 97 selfloop transitions, 25 changer transitions 0/127 dead transitions. [2024-06-27 22:40:16,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 127 transitions, 1005 flow [2024-06-27 22:40:16,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:16,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2024-06-27 22:40:16,564 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 22:40:16,564 INFO L175 Difference]: Start difference. First operand has 89 places, 79 transitions, 615 flow. Second operand 8 states and 152 transitions. [2024-06-27 22:40:16,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 127 transitions, 1005 flow [2024-06-27 22:40:16,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 127 transitions, 968 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 22:40:16,572 INFO L231 Difference]: Finished difference. Result has 91 places, 79 transitions, 633 flow [2024-06-27 22:40:16,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=633, PETRI_PLACES=91, PETRI_TRANSITIONS=79} [2024-06-27 22:40:16,573 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 54 predicate places. [2024-06-27 22:40:16,573 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 79 transitions, 633 flow [2024-06-27 22:40:16,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:16,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:16,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:16,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:40:16,574 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:16,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:16,574 INFO L85 PathProgramCache]: Analyzing trace with hash -172677453, now seen corresponding path program 4 times [2024-06-27 22:40:16,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:16,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890712911] [2024-06-27 22:40:16,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:20,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:20,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890712911] [2024-06-27 22:40:20,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890712911] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:20,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:20,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:20,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696984635] [2024-06-27 22:40:20,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:20,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:20,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:20,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:20,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:20,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 79 transitions, 633 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:20,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:20,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:20,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:21,355 INFO L124 PetriNetUnfolderBase]: 695/1215 cut-off events. [2024-06-27 22:40:21,355 INFO L125 PetriNetUnfolderBase]: For 4808/4812 co-relation queries the response was YES. [2024-06-27 22:40:21,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5018 conditions, 1215 events. 695/1215 cut-off events. For 4808/4812 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6123 event pairs, 70 based on Foata normal form. 6/1219 useless extension candidates. Maximal degree in co-relation 4977. Up to 645 conditions per place. [2024-06-27 22:40:21,362 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 107 selfloop transitions, 42 changer transitions 0/154 dead transitions. [2024-06-27 22:40:21,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 154 transitions, 1213 flow [2024-06-27 22:40:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:40:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:40:21,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 207 transitions. [2024-06-27 22:40:21,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5376623376623376 [2024-06-27 22:40:21,364 INFO L175 Difference]: Start difference. First operand has 91 places, 79 transitions, 633 flow. Second operand 11 states and 207 transitions. [2024-06-27 22:40:21,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 154 transitions, 1213 flow [2024-06-27 22:40:21,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 154 transitions, 1163 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-06-27 22:40:21,374 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 692 flow [2024-06-27 22:40:21,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=692, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2024-06-27 22:40:21,374 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 58 predicate places. [2024-06-27 22:40:21,374 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 692 flow [2024-06-27 22:40:21,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:21,375 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:21,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:21,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:40:21,375 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:21,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash -126956539, now seen corresponding path program 5 times [2024-06-27 22:40:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:21,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421798318] [2024-06-27 22:40:21,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:24,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421798318] [2024-06-27 22:40:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421798318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:24,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968162585] [2024-06-27 22:40:24,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:24,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:24,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:24,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:24,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:24,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:24,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 692 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:24,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:24,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:24,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:25,099 INFO L124 PetriNetUnfolderBase]: 715/1262 cut-off events. [2024-06-27 22:40:25,099 INFO L125 PetriNetUnfolderBase]: For 5881/5896 co-relation queries the response was YES. [2024-06-27 22:40:25,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5427 conditions, 1262 events. 715/1262 cut-off events. For 5881/5896 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6500 event pairs, 94 based on Foata normal form. 11/1269 useless extension candidates. Maximal degree in co-relation 5385. Up to 748 conditions per place. [2024-06-27 22:40:25,117 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 77 selfloop transitions, 39 changer transitions 0/121 dead transitions. [2024-06-27 22:40:25,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 121 transitions, 1115 flow [2024-06-27 22:40:25,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:25,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-27 22:40:25,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-06-27 22:40:25,119 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 692 flow. Second operand 8 states and 142 transitions. [2024-06-27 22:40:25,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 121 transitions, 1115 flow [2024-06-27 22:40:25,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 121 transitions, 1018 flow, removed 6 selfloop flow, removed 9 redundant places. [2024-06-27 22:40:25,130 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 716 flow [2024-06-27 22:40:25,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=716, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2024-06-27 22:40:25,131 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 57 predicate places. [2024-06-27 22:40:25,131 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 716 flow [2024-06-27 22:40:25,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:25,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:25,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:25,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:40:25,131 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:25,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:25,131 INFO L85 PathProgramCache]: Analyzing trace with hash -99407476, now seen corresponding path program 1 times [2024-06-27 22:40:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:25,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606629089] [2024-06-27 22:40:25,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:25,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:28,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:28,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606629089] [2024-06-27 22:40:28,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606629089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:28,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:28,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:28,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299249623] [2024-06-27 22:40:28,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:28,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:28,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:28,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:28,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:28,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 716 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:28,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:28,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:28,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:29,277 INFO L124 PetriNetUnfolderBase]: 713/1266 cut-off events. [2024-06-27 22:40:29,277 INFO L125 PetriNetUnfolderBase]: For 5801/5816 co-relation queries the response was YES. [2024-06-27 22:40:29,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5445 conditions, 1266 events. 713/1266 cut-off events. For 5801/5816 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6604 event pairs, 94 based on Foata normal form. 11/1273 useless extension candidates. Maximal degree in co-relation 5402. Up to 958 conditions per place. [2024-06-27 22:40:29,285 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 77 selfloop transitions, 21 changer transitions 0/103 dead transitions. [2024-06-27 22:40:29,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 103 transitions, 968 flow [2024-06-27 22:40:29,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:40:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:40:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-27 22:40:29,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2024-06-27 22:40:29,286 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 716 flow. Second operand 6 states and 101 transitions. [2024-06-27 22:40:29,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 103 transitions, 968 flow [2024-06-27 22:40:29,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 103 transitions, 908 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-06-27 22:40:29,296 INFO L231 Difference]: Finished difference. Result has 95 places, 85 transitions, 712 flow [2024-06-27 22:40:29,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=712, PETRI_PLACES=95, PETRI_TRANSITIONS=85} [2024-06-27 22:40:29,297 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 58 predicate places. [2024-06-27 22:40:29,297 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 85 transitions, 712 flow [2024-06-27 22:40:29,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:29,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:29,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:29,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:40:29,298 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:29,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:29,299 INFO L85 PathProgramCache]: Analyzing trace with hash -99407693, now seen corresponding path program 6 times [2024-06-27 22:40:29,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:29,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543058242] [2024-06-27 22:40:29,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:29,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:32,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:32,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543058242] [2024-06-27 22:40:32,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543058242] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:32,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:32,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:32,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916019642] [2024-06-27 22:40:32,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:32,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:32,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:32,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:32,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:32,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:32,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 85 transitions, 712 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:32,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:32,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:32,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:33,217 INFO L124 PetriNetUnfolderBase]: 721/1275 cut-off events. [2024-06-27 22:40:33,217 INFO L125 PetriNetUnfolderBase]: For 6049/6064 co-relation queries the response was YES. [2024-06-27 22:40:33,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 1275 events. 721/1275 cut-off events. For 6049/6064 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6592 event pairs, 94 based on Foata normal form. 11/1282 useless extension candidates. Maximal degree in co-relation 5414. Up to 752 conditions per place. [2024-06-27 22:40:33,224 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 84 selfloop transitions, 47 changer transitions 0/136 dead transitions. [2024-06-27 22:40:33,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 136 transitions, 1171 flow [2024-06-27 22:40:33,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:40:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:40:33,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 176 transitions. [2024-06-27 22:40:33,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028571428571429 [2024-06-27 22:40:33,249 INFO L175 Difference]: Start difference. First operand has 95 places, 85 transitions, 712 flow. Second operand 10 states and 176 transitions. [2024-06-27 22:40:33,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 136 transitions, 1171 flow [2024-06-27 22:40:33,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 136 transitions, 1129 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 22:40:33,267 INFO L231 Difference]: Finished difference. Result has 100 places, 89 transitions, 809 flow [2024-06-27 22:40:33,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=809, PETRI_PLACES=100, PETRI_TRANSITIONS=89} [2024-06-27 22:40:33,267 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 63 predicate places. [2024-06-27 22:40:33,268 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 89 transitions, 809 flow [2024-06-27 22:40:33,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:33,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:33,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:33,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:40:33,268 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:33,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 315303444, now seen corresponding path program 1 times [2024-06-27 22:40:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:33,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255290752] [2024-06-27 22:40:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:37,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:37,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255290752] [2024-06-27 22:40:37,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255290752] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:37,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:37,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:37,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535235396] [2024-06-27 22:40:37,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:37,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:37,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:37,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:37,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:37,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:37,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 809 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:37,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:37,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:37,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:38,425 INFO L124 PetriNetUnfolderBase]: 743/1304 cut-off events. [2024-06-27 22:40:38,425 INFO L125 PetriNetUnfolderBase]: For 6687/6691 co-relation queries the response was YES. [2024-06-27 22:40:38,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5955 conditions, 1304 events. 743/1304 cut-off events. For 6687/6691 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6668 event pairs, 17 based on Foata normal form. 6/1308 useless extension candidates. Maximal degree in co-relation 5910. Up to 849 conditions per place. [2024-06-27 22:40:38,432 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 124 selfloop transitions, 30 changer transitions 0/159 dead transitions. [2024-06-27 22:40:38,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 159 transitions, 1373 flow [2024-06-27 22:40:38,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:40:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:40:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-06-27 22:40:38,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116883116883116 [2024-06-27 22:40:38,437 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 809 flow. Second operand 11 states and 197 transitions. [2024-06-27 22:40:38,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 159 transitions, 1373 flow [2024-06-27 22:40:38,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 159 transitions, 1269 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-27 22:40:38,451 INFO L231 Difference]: Finished difference. Result has 103 places, 90 transitions, 777 flow [2024-06-27 22:40:38,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=777, PETRI_PLACES=103, PETRI_TRANSITIONS=90} [2024-06-27 22:40:38,451 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-27 22:40:38,452 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 90 transitions, 777 flow [2024-06-27 22:40:38,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:38,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:38,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:38,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:40:38,452 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:38,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1847804722, now seen corresponding path program 2 times [2024-06-27 22:40:38,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:38,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315236206] [2024-06-27 22:40:38,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:38,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:43,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:43,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:43,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315236206] [2024-06-27 22:40:43,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315236206] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:43,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:43,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891183872] [2024-06-27 22:40:43,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:43,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:43,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:43,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:43,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:43,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 90 transitions, 777 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:43,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:43,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:43,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:44,347 INFO L124 PetriNetUnfolderBase]: 765/1358 cut-off events. [2024-06-27 22:40:44,347 INFO L125 PetriNetUnfolderBase]: For 6900/6904 co-relation queries the response was YES. [2024-06-27 22:40:44,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6000 conditions, 1358 events. 765/1358 cut-off events. For 6900/6904 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7085 event pairs, 53 based on Foata normal form. 6/1362 useless extension candidates. Maximal degree in co-relation 5954. Up to 1010 conditions per place. [2024-06-27 22:40:44,354 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 125 selfloop transitions, 28 changer transitions 0/158 dead transitions. [2024-06-27 22:40:44,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 158 transitions, 1299 flow [2024-06-27 22:40:44,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:40:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:40:44,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-06-27 22:40:44,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5116883116883116 [2024-06-27 22:40:44,365 INFO L175 Difference]: Start difference. First operand has 103 places, 90 transitions, 777 flow. Second operand 11 states and 197 transitions. [2024-06-27 22:40:44,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 158 transitions, 1299 flow [2024-06-27 22:40:44,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 158 transitions, 1238 flow, removed 5 selfloop flow, removed 8 redundant places. [2024-06-27 22:40:44,379 INFO L231 Difference]: Finished difference. Result has 106 places, 91 transitions, 788 flow [2024-06-27 22:40:44,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=788, PETRI_PLACES=106, PETRI_TRANSITIONS=91} [2024-06-27 22:40:44,379 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 69 predicate places. [2024-06-27 22:40:44,379 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 91 transitions, 788 flow [2024-06-27 22:40:44,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:44,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:44,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:44,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:40:44,380 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:44,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash -520856070, now seen corresponding path program 3 times [2024-06-27 22:40:44,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:44,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968144449] [2024-06-27 22:40:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:48,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968144449] [2024-06-27 22:40:48,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968144449] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:48,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:48,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528503843] [2024-06-27 22:40:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:48,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:48,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:48,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:48,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:48,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 91 transitions, 788 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:48,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:48,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:48,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:49,458 INFO L124 PetriNetUnfolderBase]: 811/1444 cut-off events. [2024-06-27 22:40:49,458 INFO L125 PetriNetUnfolderBase]: For 7879/7885 co-relation queries the response was YES. [2024-06-27 22:40:49,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6258 conditions, 1444 events. 811/1444 cut-off events. For 7879/7885 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7747 event pairs, 62 based on Foata normal form. 6/1447 useless extension candidates. Maximal degree in co-relation 6211. Up to 1132 conditions per place. [2024-06-27 22:40:49,466 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 107 selfloop transitions, 20 changer transitions 0/132 dead transitions. [2024-06-27 22:40:49,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 132 transitions, 1180 flow [2024-06-27 22:40:49,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:40:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:40:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 22:40:49,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2024-06-27 22:40:49,467 INFO L175 Difference]: Start difference. First operand has 106 places, 91 transitions, 788 flow. Second operand 7 states and 134 transitions. [2024-06-27 22:40:49,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 132 transitions, 1180 flow [2024-06-27 22:40:49,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 132 transitions, 1105 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-06-27 22:40:49,481 INFO L231 Difference]: Finished difference. Result has 103 places, 93 transitions, 781 flow [2024-06-27 22:40:49,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=781, PETRI_PLACES=103, PETRI_TRANSITIONS=93} [2024-06-27 22:40:49,482 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 66 predicate places. [2024-06-27 22:40:49,482 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 93 transitions, 781 flow [2024-06-27 22:40:49,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:49,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:49,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:49,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:40:49,483 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:49,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:49,484 INFO L85 PathProgramCache]: Analyzing trace with hash -520671372, now seen corresponding path program 1 times [2024-06-27 22:40:49,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:49,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290802110] [2024-06-27 22:40:49,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:49,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:53,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:53,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290802110] [2024-06-27 22:40:53,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290802110] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:53,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:53,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825012851] [2024-06-27 22:40:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:53,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:53,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:53,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:53,903 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:53,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 93 transitions, 781 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:53,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:53,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:53,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:54,867 INFO L124 PetriNetUnfolderBase]: 833/1482 cut-off events. [2024-06-27 22:40:54,867 INFO L125 PetriNetUnfolderBase]: For 8338/8344 co-relation queries the response was YES. [2024-06-27 22:40:54,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6247 conditions, 1482 events. 833/1482 cut-off events. For 8338/8344 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8003 event pairs, 70 based on Foata normal form. 6/1485 useless extension candidates. Maximal degree in co-relation 6200. Up to 1207 conditions per place. [2024-06-27 22:40:54,875 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 109 selfloop transitions, 18 changer transitions 0/132 dead transitions. [2024-06-27 22:40:54,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 132 transitions, 1175 flow [2024-06-27 22:40:54,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:40:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:40:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-06-27 22:40:54,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2024-06-27 22:40:54,876 INFO L175 Difference]: Start difference. First operand has 103 places, 93 transitions, 781 flow. Second operand 7 states and 129 transitions. [2024-06-27 22:40:54,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 132 transitions, 1175 flow [2024-06-27 22:40:54,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 132 transitions, 1133 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 22:40:54,892 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 789 flow [2024-06-27 22:40:54,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=789, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2024-06-27 22:40:54,893 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 68 predicate places. [2024-06-27 22:40:54,893 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 789 flow [2024-06-27 22:40:54,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:54,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:54,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:54,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:40:54,894 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:54,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1049751188, now seen corresponding path program 2 times [2024-06-27 22:40:54,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:54,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757264555] [2024-06-27 22:40:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:54,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757264555] [2024-06-27 22:40:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757264555] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:59,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:59,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:59,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784339868] [2024-06-27 22:40:59,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:59,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:59,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:59,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:59,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 789 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:59,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:59,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:59,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:59,901 INFO L124 PetriNetUnfolderBase]: 855/1520 cut-off events. [2024-06-27 22:40:59,901 INFO L125 PetriNetUnfolderBase]: For 8862/8866 co-relation queries the response was YES. [2024-06-27 22:40:59,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6392 conditions, 1520 events. 855/1520 cut-off events. For 8862/8866 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8193 event pairs, 97 based on Foata normal form. 6/1524 useless extension candidates. Maximal degree in co-relation 6344. Up to 1134 conditions per place. [2024-06-27 22:40:59,907 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 117 selfloop transitions, 25 changer transitions 0/147 dead transitions. [2024-06-27 22:40:59,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 147 transitions, 1263 flow [2024-06-27 22:40:59,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 22:40:59,908 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-06-27 22:40:59,908 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 789 flow. Second operand 8 states and 156 transitions. [2024-06-27 22:40:59,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 147 transitions, 1263 flow [2024-06-27 22:40:59,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 147 transitions, 1223 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-06-27 22:40:59,925 INFO L231 Difference]: Finished difference. Result has 108 places, 95 transitions, 815 flow [2024-06-27 22:40:59,925 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=815, PETRI_PLACES=108, PETRI_TRANSITIONS=95} [2024-06-27 22:40:59,925 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 71 predicate places. [2024-06-27 22:40:59,925 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 95 transitions, 815 flow [2024-06-27 22:40:59,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:40:59,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:59,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:59,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:40:59,926 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:59,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1049454518, now seen corresponding path program 3 times [2024-06-27 22:40:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:59,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129635687] [2024-06-27 22:40:59,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:59,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:03,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:03,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129635687] [2024-06-27 22:41:03,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129635687] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:03,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:03,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:41:03,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271379400] [2024-06-27 22:41:03,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:03,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:41:03,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:03,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:41:03,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:41:03,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:03,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 95 transitions, 815 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:03,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:03,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:03,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:04,758 INFO L124 PetriNetUnfolderBase]: 877/1564 cut-off events. [2024-06-27 22:41:04,758 INFO L125 PetriNetUnfolderBase]: For 9471/9475 co-relation queries the response was YES. [2024-06-27 22:41:04,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6650 conditions, 1564 events. 877/1564 cut-off events. For 9471/9475 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8529 event pairs, 87 based on Foata normal form. 6/1568 useless extension candidates. Maximal degree in co-relation 6601. Up to 1041 conditions per place. [2024-06-27 22:41:04,767 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 115 selfloop transitions, 29 changer transitions 0/149 dead transitions. [2024-06-27 22:41:04,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 149 transitions, 1337 flow [2024-06-27 22:41:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:41:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:41:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 163 transitions. [2024-06-27 22:41:04,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5174603174603175 [2024-06-27 22:41:04,768 INFO L175 Difference]: Start difference. First operand has 108 places, 95 transitions, 815 flow. Second operand 9 states and 163 transitions. [2024-06-27 22:41:04,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 149 transitions, 1337 flow [2024-06-27 22:41:04,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 149 transitions, 1281 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 22:41:04,785 INFO L231 Difference]: Finished difference. Result has 111 places, 96 transitions, 833 flow [2024-06-27 22:41:04,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=833, PETRI_PLACES=111, PETRI_TRANSITIONS=96} [2024-06-27 22:41:04,786 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 74 predicate places. [2024-06-27 22:41:04,786 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 96 transitions, 833 flow [2024-06-27 22:41:04,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:04,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:04,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:04,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:41:04,787 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:04,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:04,787 INFO L85 PathProgramCache]: Analyzing trace with hash 359311218, now seen corresponding path program 4 times [2024-06-27 22:41:04,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:04,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036681072] [2024-06-27 22:41:04,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:04,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:08,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-06-27 22:41:08,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:08,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036681072] [2024-06-27 22:41:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036681072] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:08,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:41:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446839527] [2024-06-27 22:41:08,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:08,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:41:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:41:08,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:41:08,143 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:08,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 96 transitions, 833 flow. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:08,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:08,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:08,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:09,106 INFO L124 PetriNetUnfolderBase]: 990/1771 cut-off events. [2024-06-27 22:41:09,107 INFO L125 PetriNetUnfolderBase]: For 13322/13337 co-relation queries the response was YES. [2024-06-27 22:41:09,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7296 conditions, 1771 events. 990/1771 cut-off events. For 13322/13337 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10090 event pairs, 127 based on Foata normal form. 23/1790 useless extension candidates. Maximal degree in co-relation 7246. Up to 804 conditions per place. [2024-06-27 22:41:09,116 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 95 selfloop transitions, 39 changer transitions 0/139 dead transitions. [2024-06-27 22:41:09,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 139 transitions, 1270 flow [2024-06-27 22:41:09,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:41:09,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:41:09,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 22:41:09,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-27 22:41:09,117 INFO L175 Difference]: Start difference. First operand has 111 places, 96 transitions, 833 flow. Second operand 8 states and 148 transitions. [2024-06-27 22:41:09,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 139 transitions, 1270 flow [2024-06-27 22:41:09,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 139 transitions, 1202 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:41:09,139 INFO L231 Difference]: Finished difference. Result has 114 places, 97 transitions, 898 flow [2024-06-27 22:41:09,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=105, 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=8, PETRI_FLOW=898, PETRI_PLACES=114, PETRI_TRANSITIONS=97} [2024-06-27 22:41:09,140 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 77 predicate places. [2024-06-27 22:41:09,140 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 97 transitions, 898 flow [2024-06-27 22:41:09,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:09,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:09,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:09,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:41:09,140 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:09,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:09,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1213337162, now seen corresponding path program 4 times [2024-06-27 22:41:09,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:09,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686680868] [2024-06-27 22:41:09,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:13,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:13,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686680868] [2024-06-27 22:41:13,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686680868] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:13,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:13,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:13,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651385849] [2024-06-27 22:41:13,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:13,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:13,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:13,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:13,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:13,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:13,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 97 transitions, 898 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:13,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:13,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:13,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:13,960 INFO L124 PetriNetUnfolderBase]: 987/1766 cut-off events. [2024-06-27 22:41:13,960 INFO L125 PetriNetUnfolderBase]: For 10808/10823 co-relation queries the response was YES. [2024-06-27 22:41:13,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7387 conditions, 1766 events. 987/1766 cut-off events. For 10808/10823 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 10021 event pairs, 118 based on Foata normal form. 12/1774 useless extension candidates. Maximal degree in co-relation 7335. Up to 1358 conditions per place. [2024-06-27 22:41:13,968 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 94 selfloop transitions, 24 changer transitions 0/123 dead transitions. [2024-06-27 22:41:13,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 123 transitions, 1220 flow [2024-06-27 22:41:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:41:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:41:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-27 22:41:13,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2024-06-27 22:41:13,969 INFO L175 Difference]: Start difference. First operand has 114 places, 97 transitions, 898 flow. Second operand 7 states and 118 transitions. [2024-06-27 22:41:13,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 123 transitions, 1220 flow [2024-06-27 22:41:13,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 123 transitions, 1137 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-06-27 22:41:13,992 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 871 flow [2024-06-27 22:41:13,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=871, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2024-06-27 22:41:13,992 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 76 predicate places. [2024-06-27 22:41:13,992 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 871 flow [2024-06-27 22:41:13,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:13,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:13,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:13,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:41:13,993 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:13,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash -976484012, now seen corresponding path program 1 times [2024-06-27 22:41:13,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:13,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790353798] [2024-06-27 22:41:13,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:14,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:14,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:14,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790353798] [2024-06-27 22:41:14,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790353798] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:14,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:41:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199413129] [2024-06-27 22:41:14,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:14,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:41:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:14,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:41:14,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:41:14,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:41:14,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 871 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:14,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:14,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:41:14,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:14,298 INFO L124 PetriNetUnfolderBase]: 578/1202 cut-off events. [2024-06-27 22:41:14,298 INFO L125 PetriNetUnfolderBase]: For 6244/6289 co-relation queries the response was YES. [2024-06-27 22:41:14,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4416 conditions, 1202 events. 578/1202 cut-off events. For 6244/6289 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7136 event pairs, 89 based on Foata normal form. 97/1255 useless extension candidates. Maximal degree in co-relation 4366. Up to 446 conditions per place. [2024-06-27 22:41:14,303 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 57 selfloop transitions, 26 changer transitions 0/111 dead transitions. [2024-06-27 22:41:14,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 111 transitions, 1103 flow [2024-06-27 22:41:14,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:41:14,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:41:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-27 22:41:14,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2024-06-27 22:41:14,304 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 871 flow. Second operand 4 states and 86 transitions. [2024-06-27 22:41:14,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 111 transitions, 1103 flow [2024-06-27 22:41:14,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 1042 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-06-27 22:41:14,314 INFO L231 Difference]: Finished difference. Result has 111 places, 94 transitions, 898 flow [2024-06-27 22:41:14,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=898, PETRI_PLACES=111, PETRI_TRANSITIONS=94} [2024-06-27 22:41:14,315 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 74 predicate places. [2024-06-27 22:41:14,315 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 94 transitions, 898 flow [2024-06-27 22:41:14,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:14,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:14,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:14,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:41:14,316 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:14,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1171524544, now seen corresponding path program 1 times [2024-06-27 22:41:14,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:14,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138653089] [2024-06-27 22:41:14,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:14,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:18,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-06-27 22:41:18,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:18,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138653089] [2024-06-27 22:41:18,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138653089] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:18,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:18,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:18,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344287371] [2024-06-27 22:41:18,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:18,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:18,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:18,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:18,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:18,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:18,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 94 transitions, 898 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:18,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:18,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:18,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:19,698 INFO L124 PetriNetUnfolderBase]: 911/1807 cut-off events. [2024-06-27 22:41:19,698 INFO L125 PetriNetUnfolderBase]: For 12489/12493 co-relation queries the response was YES. [2024-06-27 22:41:19,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7079 conditions, 1807 events. 911/1807 cut-off events. For 12489/12493 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 10840 event pairs, 260 based on Foata normal form. 12/1817 useless extension candidates. Maximal degree in co-relation 7028. Up to 697 conditions per place. [2024-06-27 22:41:19,706 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 98 selfloop transitions, 49 changer transitions 9/161 dead transitions. [2024-06-27 22:41:19,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 161 transitions, 1505 flow [2024-06-27 22:41:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:41:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:41:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 224 transitions. [2024-06-27 22:41:19,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45714285714285713 [2024-06-27 22:41:19,707 INFO L175 Difference]: Start difference. First operand has 111 places, 94 transitions, 898 flow. Second operand 14 states and 224 transitions. [2024-06-27 22:41:19,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 161 transitions, 1505 flow [2024-06-27 22:41:19,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 161 transitions, 1475 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:41:19,726 INFO L231 Difference]: Finished difference. Result has 123 places, 93 transitions, 968 flow [2024-06-27 22:41:19,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=871, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=968, PETRI_PLACES=123, PETRI_TRANSITIONS=93} [2024-06-27 22:41:19,726 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 86 predicate places. [2024-06-27 22:41:19,726 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 93 transitions, 968 flow [2024-06-27 22:41:19,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:19,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:19,727 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:19,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:41:19,727 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:19,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1447520964, now seen corresponding path program 2 times [2024-06-27 22:41:19,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:19,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065775014] [2024-06-27 22:41:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:19,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:23,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:23,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065775014] [2024-06-27 22:41:23,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065775014] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70533672] [2024-06-27 22:41:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:23,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:23,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:23,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:23,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:23,993 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:23,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 93 transitions, 968 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:23,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:23,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:23,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:25,269 INFO L124 PetriNetUnfolderBase]: 895/1787 cut-off events. [2024-06-27 22:41:25,270 INFO L125 PetriNetUnfolderBase]: For 12988/12992 co-relation queries the response was YES. [2024-06-27 22:41:25,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6846 conditions, 1787 events. 895/1787 cut-off events. For 12988/12992 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10586 event pairs, 428 based on Foata normal form. 14/1799 useless extension candidates. Maximal degree in co-relation 6793. Up to 1255 conditions per place. [2024-06-27 22:41:25,279 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 87 selfloop transitions, 44 changer transitions 0/136 dead transitions. [2024-06-27 22:41:25,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 136 transitions, 1368 flow [2024-06-27 22:41:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:41:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:41:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2024-06-27 22:41:25,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2024-06-27 22:41:25,280 INFO L175 Difference]: Start difference. First operand has 123 places, 93 transitions, 968 flow. Second operand 13 states and 196 transitions. [2024-06-27 22:41:25,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 136 transitions, 1368 flow [2024-06-27 22:41:25,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 136 transitions, 1212 flow, removed 4 selfloop flow, removed 14 redundant places. [2024-06-27 22:41:25,297 INFO L231 Difference]: Finished difference. Result has 122 places, 93 transitions, 909 flow [2024-06-27 22:41:25,298 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=909, PETRI_PLACES=122, PETRI_TRANSITIONS=93} [2024-06-27 22:41:25,298 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 85 predicate places. [2024-06-27 22:41:25,298 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 93 transitions, 909 flow [2024-06-27 22:41:25,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:25,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:25,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:25,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:41:25,298 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:25,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:25,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1447373094, now seen corresponding path program 3 times [2024-06-27 22:41:25,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:25,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835946541] [2024-06-27 22:41:25,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:25,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:30,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:30,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:30,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835946541] [2024-06-27 22:41:30,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835946541] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:30,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:30,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:30,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877860322] [2024-06-27 22:41:30,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:30,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:30,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:30,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:30,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:30,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:30,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 93 transitions, 909 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:30,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:30,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:30,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:31,387 INFO L124 PetriNetUnfolderBase]: 885/1756 cut-off events. [2024-06-27 22:41:31,387 INFO L125 PetriNetUnfolderBase]: For 9851/9855 co-relation queries the response was YES. [2024-06-27 22:41:31,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6253 conditions, 1756 events. 885/1756 cut-off events. For 9851/9855 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10361 event pairs, 346 based on Foata normal form. 12/1766 useless extension candidates. Maximal degree in co-relation 6202. Up to 1060 conditions per place. [2024-06-27 22:41:31,395 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 96 selfloop transitions, 46 changer transitions 0/147 dead transitions. [2024-06-27 22:41:31,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 147 transitions, 1373 flow [2024-06-27 22:41:31,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 22:41:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 22:41:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 224 transitions. [2024-06-27 22:41:31,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4266666666666667 [2024-06-27 22:41:31,397 INFO L175 Difference]: Start difference. First operand has 122 places, 93 transitions, 909 flow. Second operand 15 states and 224 transitions. [2024-06-27 22:41:31,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 147 transitions, 1373 flow [2024-06-27 22:41:31,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 147 transitions, 1287 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-27 22:41:31,415 INFO L231 Difference]: Finished difference. Result has 126 places, 93 transitions, 918 flow [2024-06-27 22:41:31,415 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=918, PETRI_PLACES=126, PETRI_TRANSITIONS=93} [2024-06-27 22:41:31,415 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 89 predicate places. [2024-06-27 22:41:31,415 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 93 transitions, 918 flow [2024-06-27 22:41:31,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:31,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:31,416 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:31,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:41:31,416 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:31,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash 886971186, now seen corresponding path program 1 times [2024-06-27 22:41:31,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:31,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803201432] [2024-06-27 22:41:31,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:31,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:31,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41: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-06-27 22:41:35,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:35,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803201432] [2024-06-27 22:41:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803201432] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:35,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:35,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791237965] [2024-06-27 22:41:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:35,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:35,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:36,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:36,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 93 transitions, 918 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:36,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:36,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:36,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:37,172 INFO L124 PetriNetUnfolderBase]: 1029/2071 cut-off events. [2024-06-27 22:41:37,173 INFO L125 PetriNetUnfolderBase]: For 10667/10673 co-relation queries the response was YES. [2024-06-27 22:41:37,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7165 conditions, 2071 events. 1029/2071 cut-off events. For 10667/10673 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 13065 event pairs, 513 based on Foata normal form. 10/2078 useless extension candidates. Maximal degree in co-relation 7112. Up to 1435 conditions per place. [2024-06-27 22:41:37,183 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 103 selfloop transitions, 28 changer transitions 0/136 dead transitions. [2024-06-27 22:41:37,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 1333 flow [2024-06-27 22:41:37,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:37,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:37,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2024-06-27 22:41:37,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44675324675324674 [2024-06-27 22:41:37,184 INFO L175 Difference]: Start difference. First operand has 126 places, 93 transitions, 918 flow. Second operand 11 states and 172 transitions. [2024-06-27 22:41:37,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 1333 flow [2024-06-27 22:41:37,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 136 transitions, 1240 flow, removed 0 selfloop flow, removed 13 redundant places. [2024-06-27 22:41:37,203 INFO L231 Difference]: Finished difference. Result has 124 places, 93 transitions, 886 flow [2024-06-27 22:41:37,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=827, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=886, PETRI_PLACES=124, PETRI_TRANSITIONS=93} [2024-06-27 22:41:37,204 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 87 predicate places. [2024-06-27 22:41:37,204 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 93 transitions, 886 flow [2024-06-27 22:41:37,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:37,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:37,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:37,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:41:37,204 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:37,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1560737202, now seen corresponding path program 4 times [2024-06-27 22:41:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:37,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867301198] [2024-06-27 22:41:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:41,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:41,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867301198] [2024-06-27 22:41:41,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867301198] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:41,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:41,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:41,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296811583] [2024-06-27 22:41:41,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:41,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:41,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:41,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:41,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:41,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:41,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 93 transitions, 886 flow. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:41,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:41,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:42,985 INFO L124 PetriNetUnfolderBase]: 1073/2184 cut-off events. [2024-06-27 22:41:42,986 INFO L125 PetriNetUnfolderBase]: For 11074/11078 co-relation queries the response was YES. [2024-06-27 22:41:42,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7272 conditions, 2184 events. 1073/2184 cut-off events. For 11074/11078 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 14047 event pairs, 608 based on Foata normal form. 14/2196 useless extension candidates. Maximal degree in co-relation 7218. Up to 1582 conditions per place. [2024-06-27 22:41:43,000 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 82 selfloop transitions, 46 changer transitions 0/133 dead transitions. [2024-06-27 22:41:43,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 133 transitions, 1277 flow [2024-06-27 22:41:43,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:41:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:41:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 185 transitions. [2024-06-27 22:41:43,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2024-06-27 22:41:43,002 INFO L175 Difference]: Start difference. First operand has 124 places, 93 transitions, 886 flow. Second operand 12 states and 185 transitions. [2024-06-27 22:41:43,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 133 transitions, 1277 flow [2024-06-27 22:41:43,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 133 transitions, 1222 flow, removed 0 selfloop flow, removed 9 redundant places. [2024-06-27 22:41:43,023 INFO L231 Difference]: Finished difference. Result has 127 places, 93 transitions, 927 flow [2024-06-27 22:41:43,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=927, PETRI_PLACES=127, PETRI_TRANSITIONS=93} [2024-06-27 22:41:43,023 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 90 predicate places. [2024-06-27 22:41:43,024 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 93 transitions, 927 flow [2024-06-27 22:41:43,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:43,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:43,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:43,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:41:43,024 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:43,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:43,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1817452914, now seen corresponding path program 2 times [2024-06-27 22:41:43,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:43,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498247864] [2024-06-27 22:41:43,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:43,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:48,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:48,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498247864] [2024-06-27 22:41:48,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498247864] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:48,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:48,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:48,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773105233] [2024-06-27 22:41:48,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:48,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:48,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:48,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 93 transitions, 927 flow. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:48,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:48,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:48,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:49,763 INFO L124 PetriNetUnfolderBase]: 1029/2098 cut-off events. [2024-06-27 22:41:49,763 INFO L125 PetriNetUnfolderBase]: For 9842/9846 co-relation queries the response was YES. [2024-06-27 22:41:49,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7045 conditions, 2098 events. 1029/2098 cut-off events. For 9842/9846 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 13426 event pairs, 531 based on Foata normal form. 10/2106 useless extension candidates. Maximal degree in co-relation 6990. Up to 1367 conditions per place. [2024-06-27 22:41:49,771 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 91 selfloop transitions, 47 changer transitions 0/143 dead transitions. [2024-06-27 22:41:49,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 1373 flow [2024-06-27 22:41:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:41:49,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:41:49,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 204 transitions. [2024-06-27 22:41:49,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44835164835164837 [2024-06-27 22:41:49,772 INFO L175 Difference]: Start difference. First operand has 127 places, 93 transitions, 927 flow. Second operand 13 states and 204 transitions. [2024-06-27 22:41:49,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 143 transitions, 1373 flow [2024-06-27 22:41:49,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 143 transitions, 1283 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-06-27 22:41:49,790 INFO L231 Difference]: Finished difference. Result has 130 places, 93 transitions, 934 flow [2024-06-27 22:41:49,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=934, PETRI_PLACES=130, PETRI_TRANSITIONS=93} [2024-06-27 22:41:49,790 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 93 predicate places. [2024-06-27 22:41:49,790 INFO L495 AbstractCegarLoop]: Abstraction has has 130 places, 93 transitions, 934 flow [2024-06-27 22:41:49,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:49,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:49,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:49,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:41:49,791 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:49,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:49,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1826649684, now seen corresponding path program 3 times [2024-06-27 22:41:49,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:49,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799687429] [2024-06-27 22:41:49,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:49,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:54,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:54,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799687429] [2024-06-27 22:41:54,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799687429] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:54,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:54,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:41:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264228863] [2024-06-27 22:41:54,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:54,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:41:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:41:54,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:41:54,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:54,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 93 transitions, 934 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:54,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:54,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:54,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:55,465 INFO L124 PetriNetUnfolderBase]: 1151/2358 cut-off events. [2024-06-27 22:41:55,465 INFO L125 PetriNetUnfolderBase]: For 10715/10719 co-relation queries the response was YES. [2024-06-27 22:41:55,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7803 conditions, 2358 events. 1151/2358 cut-off events. For 10715/10719 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 15443 event pairs, 626 based on Foata normal form. 10/2366 useless extension candidates. Maximal degree in co-relation 7747. Up to 929 conditions per place. [2024-06-27 22:41:55,477 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 94 selfloop transitions, 48 changer transitions 0/147 dead transitions. [2024-06-27 22:41:55,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 147 transitions, 1405 flow [2024-06-27 22:41:55,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:41:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:41:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2024-06-27 22:41:55,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-27 22:41:55,478 INFO L175 Difference]: Start difference. First operand has 130 places, 93 transitions, 934 flow. Second operand 12 states and 194 transitions. [2024-06-27 22:41:55,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 147 transitions, 1405 flow [2024-06-27 22:41:55,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 147 transitions, 1312 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-27 22:41:55,497 INFO L231 Difference]: Finished difference. Result has 131 places, 93 transitions, 940 flow [2024-06-27 22:41:55,497 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=940, PETRI_PLACES=131, PETRI_TRANSITIONS=93} [2024-06-27 22:41:55,498 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 94 predicate places. [2024-06-27 22:41:55,498 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 93 transitions, 940 flow [2024-06-27 22:41:55,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:55,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:55,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:55,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-06-27 22:41:55,498 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:41:55,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:55,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1740527118, now seen corresponding path program 4 times [2024-06-27 22:41:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050440223] [2024-06-27 22:41:55,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:59,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050440223] [2024-06-27 22:41:59,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050440223] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:59,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:59,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:41:59,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126339782] [2024-06-27 22:41:59,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:59,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:41:59,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:59,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:41:59,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:41:59,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:59,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 93 transitions, 940 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:41:59,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:59,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:59,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:00,920 INFO L124 PetriNetUnfolderBase]: 1144/2360 cut-off events. [2024-06-27 22:42:00,920 INFO L125 PetriNetUnfolderBase]: For 8709/8724 co-relation queries the response was YES. [2024-06-27 22:42:00,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7645 conditions, 2360 events. 1144/2360 cut-off events. For 8709/8724 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 15631 event pairs, 558 based on Foata normal form. 16/2372 useless extension candidates. Maximal degree in co-relation 7588. Up to 1437 conditions per place. [2024-06-27 22:42:00,932 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 80 selfloop transitions, 42 changer transitions 0/127 dead transitions. [2024-06-27 22:42:00,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 127 transitions, 1242 flow [2024-06-27 22:42:00,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:42:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:42:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 157 transitions. [2024-06-27 22:42:00,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44857142857142857 [2024-06-27 22:42:00,934 INFO L175 Difference]: Start difference. First operand has 131 places, 93 transitions, 940 flow. Second operand 10 states and 157 transitions. [2024-06-27 22:42:00,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 127 transitions, 1242 flow [2024-06-27 22:42:00,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 127 transitions, 1030 flow, removed 5 selfloop flow, removed 31 redundant places. [2024-06-27 22:42:00,944 INFO L231 Difference]: Finished difference. Result has 108 places, 92 transitions, 756 flow [2024-06-27 22:42:00,944 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=756, PETRI_PLACES=108, PETRI_TRANSITIONS=92} [2024-06-27 22:42:00,944 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 71 predicate places. [2024-06-27 22:42:00,944 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 92 transitions, 756 flow [2024-06-27 22:42:00,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:00,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:00,945 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-06-27 22:42:00,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-06-27 22:42:00,945 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:42:00,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:00,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1786518610, now seen corresponding path program 1 times [2024-06-27 22:42:00,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:00,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338092283] [2024-06-27 22:42:00,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:00,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:42:01,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-06-27 22:42:01,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:42:01,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338092283] [2024-06-27 22:42:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338092283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:42:01,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:42:01,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:42:01,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927108139] [2024-06-27 22:42:01,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:42:01,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:42:01,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:42:01,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:42:01,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:42:01,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:42:01,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 92 transitions, 756 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:01,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:42:01,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:42:01,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:42:01,326 INFO L124 PetriNetUnfolderBase]: 679/1491 cut-off events. [2024-06-27 22:42:01,326 INFO L125 PetriNetUnfolderBase]: For 2437/2449 co-relation queries the response was YES. [2024-06-27 22:42:01,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 1491 events. 679/1491 cut-off events. For 2437/2449 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 9172 event pairs, 95 based on Foata normal form. 103/1544 useless extension candidates. Maximal degree in co-relation 4372. Up to 460 conditions per place. [2024-06-27 22:42:01,330 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 50 selfloop transitions, 28 changer transitions 0/106 dead transitions. [2024-06-27 22:42:01,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 106 transitions, 953 flow [2024-06-27 22:42:01,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:42:01,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:42:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-27 22:42:01,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 22:42:01,331 INFO L175 Difference]: Start difference. First operand has 108 places, 92 transitions, 756 flow. Second operand 5 states and 95 transitions. [2024-06-27 22:42:01,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 106 transitions, 953 flow [2024-06-27 22:42:01,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 106 transitions, 863 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-27 22:42:01,336 INFO L231 Difference]: Finished difference. Result has 106 places, 93 transitions, 760 flow [2024-06-27 22:42:01,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=760, PETRI_PLACES=106, PETRI_TRANSITIONS=93} [2024-06-27 22:42:01,337 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 69 predicate places. [2024-06-27 22:42:01,337 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 93 transitions, 760 flow [2024-06-27 22:42:01,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 22:42:01,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:42:01,337 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-06-27 22:42:01,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-06-27 22:42:01,337 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:42:01,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:42:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1087060542, now seen corresponding path program 1 times [2024-06-27 22:42:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:42:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205271295] [2024-06-27 22:42:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:42:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:42:01,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:42:01,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:42:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:42:01,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:42:01,415 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:42:01,416 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 22:42:01,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-27 22:42:01,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-27 22:42:01,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 22:42:01,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-27 22:42:01,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-06-27 22:42:01,422 INFO L445 BasicCegarLoop]: Path program histogram: [6, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:42:01,426 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:42:01,426 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:42:01,464 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:42:01,468 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:42:01,470 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:42:01,470 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:42:01,483 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-27 22:42:01,496 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:42:01,496 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:42:01,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:42:01 BasicIcfg [2024-06-27 22:42:01,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:42:01,503 INFO L158 Benchmark]: Toolchain (without parser) took 176190.60ms. Allocated memory was 138.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 78.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 98.8MB. Max. memory is 16.1GB. [2024-06-27 22:42:01,504 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 107.0MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:42:01,504 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 107.0MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:42:01,505 INFO L158 Benchmark]: CACSL2BoogieTranslator took 578.34ms. Allocated memory is still 138.4MB. Free memory was 77.9MB in the beginning and 83.2MB in the end (delta: -5.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-06-27 22:42:01,505 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.99ms. Allocated memory is still 138.4MB. Free memory was 83.2MB in the beginning and 76.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 22:42:01,505 INFO L158 Benchmark]: Boogie Preprocessor took 54.64ms. Allocated memory is still 138.4MB. Free memory was 76.9MB in the beginning and 72.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:42:01,505 INFO L158 Benchmark]: RCFGBuilder took 944.72ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 72.7MB in the beginning and 141.8MB in the end (delta: -69.1MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2024-06-27 22:42:01,506 INFO L158 Benchmark]: TraceAbstraction took 174528.19ms. Allocated memory was 182.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 140.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. [2024-06-27 22:42:01,507 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 107.0MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.11ms. Allocated memory is still 107.0MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 578.34ms. Allocated memory is still 138.4MB. Free memory was 77.9MB in the beginning and 83.2MB in the end (delta: -5.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.99ms. Allocated memory is still 138.4MB. Free memory was 83.2MB in the beginning and 76.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.64ms. Allocated memory is still 138.4MB. Free memory was 76.9MB in the beginning and 72.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 944.72ms. Allocated memory was 138.4MB in the beginning and 182.5MB in the end (delta: 44.0MB). Free memory was 72.7MB in the beginning and 141.8MB in the end (delta: -69.1MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * TraceAbstraction took 174528.19ms. Allocated memory was 182.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 140.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 115.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=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={3:0}] [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=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={3:0}] [L814] 0 pthread_t t1930; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=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={3:0}] [L815] 0 //@ assert (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) weak$$choice1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) weak$$choice2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$w_buff1_used) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$flush_delayed) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$flush_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$mem_tmp) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$mem_tmp) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd2) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd2) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$read_delayed) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff0_used) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff0_used) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff1_used) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff1_used) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) x) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) weak$$choice1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$flush_delayed) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$flush_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$mem_tmp) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$mem_tmp) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd2) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd2) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff0_used) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff0_used) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff1_used) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff1_used) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$flush_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) __unbuffered_p0_EAX$read_delayed) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((2LL - (long long) __unbuffered_p0_EAX$read_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EAX) - (long long) x) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EAX) - (long long) y$mem_tmp) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EAX) - (long long) weak$$choice0) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EAX) - (long long) weak$$choice2) >= 0LL)) && (((2LL - (long long) x) - (long long) y$mem_tmp) >= 0LL)) && (((2LL - (long long) weak$$choice0) - (long long) y$mem_tmp) >= 0LL)) && (((2LL - (long long) weak$$choice2) - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL))); [L815] 0 y [L815] 0 y VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, weak$$choice0=0, weak$$choice1=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={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=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={3:0}] [L772] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L815] 0 y [L815] 0 y [L816] 0 //@ assert (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) weak$$choice1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) + (long long) weak$$choice2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) + (long long) y$w_buff1_used) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$flush_delayed) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$flush_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$mem_tmp) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$mem_tmp) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd2) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff0_thd2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd2) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$r_buff1_thd2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$read_delayed) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff0_used) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff0_used) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff1_used) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p0_EAX$w_buff1_used) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) main$tmp_guard1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) x) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) y$flush_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) weak$$choice0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) weak$$choice1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL + (long long) weak$$choice2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$flush_delayed) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$flush_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$mem_tmp) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$mem_tmp) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd2) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff0_thd2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd2) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$r_buff1_thd2) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff0) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff0) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff0_used) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff0_used) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff1) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff1) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff1_used) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((1LL - (long long) __unbuffered_p0_EAX$w_buff1_used) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p1_EAX) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$flush_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$read_delayed) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$w_buff0) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$w_buff0_used) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$w_buff1) >= 0LL)) && (((1LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) __unbuffered_p0_EAX$read_delayed) - (long long) __unbuffered_p1_EAX) >= 0LL)) && (((2LL - (long long) __unbuffered_p0_EAX$read_delayed) - (long long) y$mem_tmp) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EAX) - (long long) x) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EAX) - (long long) y$mem_tmp) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EAX) - (long long) weak$$choice0) >= 0LL)) && (((2LL - (long long) __unbuffered_p1_EAX) - (long long) weak$$choice2) >= 0LL)) && (((2LL - (long long) x) - (long long) y$mem_tmp) >= 0LL)) && (((2LL - (long long) weak$$choice0) - (long long) y$mem_tmp) >= 0LL)) && (((2LL - (long long) weak$$choice2) - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL))); [L816] 0 y [L816] 0 y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L784] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L787] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 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) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 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 [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 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}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L816] 0 y [L816] 0 y [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x=1, 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={3:0}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-1, t1930=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, 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={3:0}] [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, 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={3:0}] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, 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={3:0}] - UnprovableResult [Line: 815]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 815]: 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: 813]: 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, 51 locations, 5 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: 174.4s, OverallIterations: 39, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 34.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2194 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2115 mSDsluCounter, 279 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 639 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8557 IncrementalHoareTripleChecker+Invalid, 9196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 639 mSolverCounterUnsat, 135 mSDtfsCounter, 8557 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 355 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 350 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 34.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=968occurred in iteration=30, InterpolantAutomatonStates: 323, 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, 1.3s SatisfiabilityAnalysisTime, 137.6s InterpolantComputationTime, 585 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 521 ConstructedInterpolants, 0 QuantifiedInterpolants, 64603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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-06-27 22:42:01,649 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