./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.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_power.oepc-thin000_power.oepc.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_power.oepc-thin000_power.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/safe006_power.oepc-thin000_power.oepc.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:38:37,554 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 22:38:37,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 22:38:37,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 22:38:37,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 22:38:37,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 22:38:37,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 22:38:37,606 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 22:38:37,607 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 22:38:37,607 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 22:38:37,607 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 22:38:37,607 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 22:38:37,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 22:38:37,608 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 22:38:37,608 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 22:38:37,609 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 22:38:37,609 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 22:38:37,609 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 22:38:37,609 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 22:38:37,610 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 22:38:37,610 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 22:38:37,610 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 22:38:37,611 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 22:38:37,611 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 22:38:37,611 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 22:38:37,611 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 22:38:37,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 22:38:37,612 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 22:38:37,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 22:38:37,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 22:38:37,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 22:38:37,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 22:38:37,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:38:37,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 22:38:37,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 22:38:37,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 22:38:37,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 22:38:37,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 22:38:37,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 22:38:37,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 22:38:37,615 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 22:38:37,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 22:38:37,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 22:38:37,627 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:38:37,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 22:38:37,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 22:38:37,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 22:38:37,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 22:38:37,849 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 22:38:37,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-06-27 22:38:38,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 22:38:39,155 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 22:38:39,155 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_power.oepc-thin000_power.oepc.i [2024-06-27 22:38:39,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05674011c/63b5775e812b4f088ea620548a1ee776/FLAG132b2d54f [2024-06-27 22:38:39,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05674011c/63b5775e812b4f088ea620548a1ee776 [2024-06-27 22:38:39,186 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 22:38:39,187 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 22:38:39,187 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_power.oepc-thin000_power.oepc.yml/witness.yml [2024-06-27 22:38:39,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 22:38:39,246 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 22:38:39,247 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 22:38:39,247 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 22:38:39,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 22:38:39,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:38:39" (1/2) ... [2024-06-27 22:38:39,252 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caff4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:38:39, skipping insertion in model container [2024-06-27 22:38:39,252 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 10:38:39" (1/2) ... [2024-06-27 22:38:39,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@53f0a3c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 10:38:39, skipping insertion in model container [2024-06-27 22:38:39,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:38:39" (2/2) ... [2024-06-27 22:38:39,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caff4a5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39, skipping insertion in model container [2024-06-27 22:38:39,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:38:39" (2/2) ... [2024-06-27 22:38:39,256 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 22:38:39,276 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 22:38:39,278 INFO L97 edCorrectnessWitness]: Location invariant before [L817-L817] ! 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$$choice1 >= 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$$choice1) - (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:38:39,278 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$$choice1 >= 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$$choice1) - (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:38:39,278 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 22:38:39,279 INFO L106 edCorrectnessWitness]: ghost_update [L814-L814] multithreaded = 1; [2024-06-27 22:38:39,321 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 22:38:39,475 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_power.oepc-thin000_power.oepc.i[1014,1027] [2024-06-27 22:38:39,584 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:38:39,594 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-06-27 22:38:39,683 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_power.oepc-thin000_power.oepc.i[1014,1027] Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 22:38:39,798 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 22:38:39,824 INFO L206 MainTranslator]: Completed translation [2024-06-27 22:38:39,824 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39 WrapperNode [2024-06-27 22:38:39,825 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 22:38:39,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 22:38:39,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 22:38:39,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 22:38:39,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,900 INFO L138 Inliner]: procedures = 174, calls = 52, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-06-27 22:38:39,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 22:38:39,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 22:38:39,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 22:38:39,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 22:38:39,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,963 INFO L175 MemorySlicer]: Split 21 memory accesses to 2 slices as follows [19, 2]. 90 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2]. The 5 writes are split as follows [5, 0]. [2024-06-27 22:38:39,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,994 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:39,997 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:40,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 22:38:40,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 22:38:40,006 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 22:38:40,006 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 22:38:40,007 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (1/1) ... [2024-06-27 22:38:40,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 22:38:40,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:38:40,063 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:38:40,112 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:38:40,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 22:38:40,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 22:38:40,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 22:38:40,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 22:38:40,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 22:38:40,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 22:38:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 22:38:40,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 22:38:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 22:38:40,130 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 22:38:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 22:38:40,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 22:38:40,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 22:38:40,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 22:38:40,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 22:38:40,133 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:38:40,272 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 22:38:40,274 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 22:38:40,690 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 22:38:40,690 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 22:38:40,965 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 22:38:40,966 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 22:38:40,966 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:38:40 BoogieIcfgContainer [2024-06-27 22:38:40,966 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 22:38:40,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 22:38:40,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 22:38:40,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 22:38:40,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 10:38:39" (1/4) ... [2024-06-27 22:38:40,972 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2de127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 10:38:40, skipping insertion in model container [2024-06-27 22:38:40,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 10:38:39" (2/4) ... [2024-06-27 22:38:40,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2de127 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:38:40, skipping insertion in model container [2024-06-27 22:38:40,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 10:38:39" (3/4) ... [2024-06-27 22:38:40,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2de127 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 10:38:40, skipping insertion in model container [2024-06-27 22:38:40,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 10:38:40" (4/4) ... [2024-06-27 22:38:40,975 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_power.oepc-thin000_power.oepc.i [2024-06-27 22:38:40,992 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 22:38:40,992 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 22:38:40,992 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 22:38:41,050 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 22:38:41,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:38:41,126 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2024-06-27 22:38:41,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:38:41,129 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 42 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:38:41,129 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 78 flow [2024-06-27 22:38:41,131 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 30 transitions, 66 flow [2024-06-27 22:38:41,140 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 22:38:41,147 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;@324a050d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 22:38:41,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 22:38:41,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 22:38:41,151 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 22:38:41,152 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 22:38:41,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:41,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 22:38:41,153 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:38:41,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:41,158 INFO L85 PathProgramCache]: Analyzing trace with hash 558881429, now seen corresponding path program 1 times [2024-06-27 22:38:41,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:41,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363730123] [2024-06-27 22:38:41,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:41,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:43,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:43,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:43,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363730123] [2024-06-27 22:38:43,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363730123] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:43,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:43,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 22:38:43,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248652007] [2024-06-27 22:38:43,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:43,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 22:38:43,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:43,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 22:38:43,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 22:38:43,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:38:43,474 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:38:43,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:43,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:38:43,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:43,753 INFO L124 PetriNetUnfolderBase]: 353/667 cut-off events. [2024-06-27 22:38:43,754 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-06-27 22:38:43,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1285 conditions, 667 events. 353/667 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3102 event pairs, 175 based on Foata normal form. 0/635 useless extension candidates. Maximal degree in co-relation 1274. Up to 592 conditions per place. [2024-06-27 22:38:43,759 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 31 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2024-06-27 22:38:43,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 163 flow [2024-06-27 22:38:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 22:38:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 22:38:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2024-06-27 22:38:43,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.638095238095238 [2024-06-27 22:38:43,769 INFO L175 Difference]: Start difference. First operand has 37 places, 30 transitions, 66 flow. Second operand 3 states and 67 transitions. [2024-06-27 22:38:43,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 163 flow [2024-06-27 22:38:43,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 42 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:38:43,772 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2024-06-27 22:38:43,773 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=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2024-06-27 22:38:43,776 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2024-06-27 22:38:43,776 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2024-06-27 22:38:43,776 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:38:43,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:43,776 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:43,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 22:38:43,777 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:38:43,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 214183156, now seen corresponding path program 1 times [2024-06-27 22:38:43,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:43,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13017924] [2024-06-27 22:38:43,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:43,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:46,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:46,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13017924] [2024-06-27 22:38:46,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13017924] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:46,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:46,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 22:38:46,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257073222] [2024-06-27 22:38:46,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:46,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:38:46,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:46,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:38:46,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:38:46,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-06-27 22:38:46,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 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:38:46,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:46,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-06-27 22:38:46,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:47,071 INFO L124 PetriNetUnfolderBase]: 350/625 cut-off events. [2024-06-27 22:38:47,071 INFO L125 PetriNetUnfolderBase]: For 107/111 co-relation queries the response was YES. [2024-06-27 22:38:47,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1398 conditions, 625 events. 350/625 cut-off events. For 107/111 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2809 event pairs, 100 based on Foata normal form. 4/626 useless extension candidates. Maximal degree in co-relation 1386. Up to 562 conditions per place. [2024-06-27 22:38:47,075 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 7 changer transitions 0/58 dead transitions. [2024-06-27 22:38:47,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 58 transitions, 256 flow [2024-06-27 22:38:47,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:38:47,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:38:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2024-06-27 22:38:47,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2024-06-27 22:38:47,077 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 91 transitions. [2024-06-27 22:38:47,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 58 transitions, 256 flow [2024-06-27 22:38:47,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 58 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 22:38:47,078 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 135 flow [2024-06-27 22:38:47,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-06-27 22:38:47,079 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2024-06-27 22:38:47,079 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 135 flow [2024-06-27 22:38:47,080 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:38:47,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:47,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:47,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 22:38:47,080 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:38:47,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1950255386, now seen corresponding path program 1 times [2024-06-27 22:38:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:47,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420328464] [2024-06-27 22:38:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:49,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:49,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:49,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420328464] [2024-06-27 22:38:49,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420328464] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:50,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:50,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:38:50,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215303397] [2024-06-27 22:38:50,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:50,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:38:50,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:50,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:38:50,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:38:50,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:38:50,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 135 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:38:50,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:50,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:38:50,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:50,640 INFO L124 PetriNetUnfolderBase]: 419/734 cut-off events. [2024-06-27 22:38:50,640 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2024-06-27 22:38:50,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1855 conditions, 734 events. 419/734 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3344 event pairs, 73 based on Foata normal form. 2/734 useless extension candidates. Maximal degree in co-relation 1840. Up to 649 conditions per place. [2024-06-27 22:38:50,644 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 63 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2024-06-27 22:38:50,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 77 transitions, 384 flow [2024-06-27 22:38:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:38:50,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:38:50,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2024-06-27 22:38:50,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2024-06-27 22:38:50,647 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 135 flow. Second operand 5 states and 110 transitions. [2024-06-27 22:38:50,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 77 transitions, 384 flow [2024-06-27 22:38:50,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:38:50,650 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 205 flow [2024-06-27 22:38:50,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-06-27 22:38:50,651 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2024-06-27 22:38:50,651 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 205 flow [2024-06-27 22:38:50,652 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:38:50,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:50,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:50,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 22:38:50,652 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:38:50,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:50,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1589640027, now seen corresponding path program 1 times [2024-06-27 22:38:50,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:50,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978178501] [2024-06-27 22:38:50,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:50,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:53,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:53,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978178501] [2024-06-27 22:38:53,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978178501] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:53,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:53,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:38:53,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199002115] [2024-06-27 22:38:53,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:53,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:38:53,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:53,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:38:53,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:38:53,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 35 [2024-06-27 22:38:53,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 205 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:38:53,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:53,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 35 [2024-06-27 22:38:53,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:54,485 INFO L124 PetriNetUnfolderBase]: 415/726 cut-off events. [2024-06-27 22:38:54,486 INFO L125 PetriNetUnfolderBase]: For 615/615 co-relation queries the response was YES. [2024-06-27 22:38:54,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2056 conditions, 726 events. 415/726 cut-off events. For 615/615 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3264 event pairs, 24 based on Foata normal form. 4/728 useless extension candidates. Maximal degree in co-relation 2036. Up to 595 conditions per place. [2024-06-27 22:38:54,489 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 69 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2024-06-27 22:38:54,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 84 transitions, 449 flow [2024-06-27 22:38:54,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:38:54,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:38:54,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-27 22:38:54,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-27 22:38:54,491 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 205 flow. Second operand 6 states and 126 transitions. [2024-06-27 22:38:54,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 84 transitions, 449 flow [2024-06-27 22:38:54,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 84 transitions, 449 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 22:38:54,494 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 219 flow [2024-06-27 22:38:54,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2024-06-27 22:38:54,495 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 17 predicate places. [2024-06-27 22:38:54,496 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 219 flow [2024-06-27 22:38:54,496 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:38:54,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:54,496 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:54,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 22:38:54,496 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:38:54,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:54,497 INFO L85 PathProgramCache]: Analyzing trace with hash -448716938, now seen corresponding path program 1 times [2024-06-27 22:38:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:54,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546737984] [2024-06-27 22:38:54,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:38:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:38:57,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:38:57,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546737984] [2024-06-27 22:38:57,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546737984] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:38:57,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:38:57,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:38:57,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38974040] [2024-06-27 22:38:57,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:38:57,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 22:38:57,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:38:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 22:38:57,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 22:38:57,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:38:57,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 219 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:38:57,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:38:57,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:38:57,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:38:57,881 INFO L124 PetriNetUnfolderBase]: 418/775 cut-off events. [2024-06-27 22:38:57,882 INFO L125 PetriNetUnfolderBase]: For 917/917 co-relation queries the response was YES. [2024-06-27 22:38:57,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 775 events. 418/775 cut-off events. For 917/917 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3633 event pairs, 119 based on Foata normal form. 1/774 useless extension candidates. Maximal degree in co-relation 2206. Up to 641 conditions per place. [2024-06-27 22:38:57,886 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 48 selfloop transitions, 15 changer transitions 0/68 dead transitions. [2024-06-27 22:38:57,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 68 transitions, 429 flow [2024-06-27 22:38:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:38:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:38:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2024-06-27 22:38:57,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2024-06-27 22:38:57,890 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 219 flow. Second operand 5 states and 92 transitions. [2024-06-27 22:38:57,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 68 transitions, 429 flow [2024-06-27 22:38:57,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 404 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 22:38:57,894 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 291 flow [2024-06-27 22:38:57,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=291, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2024-06-27 22:38:57,900 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 19 predicate places. [2024-06-27 22:38:57,901 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 291 flow [2024-06-27 22:38:57,901 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:38:57,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:38:57,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:38:57,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 22:38:57,902 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:38:57,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:38:57,903 INFO L85 PathProgramCache]: Analyzing trace with hash -395242463, now seen corresponding path program 1 times [2024-06-27 22:38:57,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:38:57,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728746338] [2024-06-27 22:38:57,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:38:57,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:38:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:01,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:01,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728746338] [2024-06-27 22:39:01,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728746338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:01,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:01,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:01,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245678295] [2024-06-27 22:39:01,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:01,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:01,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:01,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:01,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:01,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:01,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 291 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:01,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:01,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:01,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:01,955 INFO L124 PetriNetUnfolderBase]: 416/776 cut-off events. [2024-06-27 22:39:01,955 INFO L125 PetriNetUnfolderBase]: For 1077/1077 co-relation queries the response was YES. [2024-06-27 22:39:01,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 776 events. 416/776 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3654 event pairs, 118 based on Foata normal form. 1/775 useless extension candidates. Maximal degree in co-relation 2359. Up to 639 conditions per place. [2024-06-27 22:39:01,959 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 49 selfloop transitions, 13 changer transitions 0/67 dead transitions. [2024-06-27 22:39:01,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 67 transitions, 459 flow [2024-06-27 22:39:01,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:39:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:39:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-27 22:39:01,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2024-06-27 22:39:01,960 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 291 flow. Second operand 5 states and 90 transitions. [2024-06-27 22:39:01,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 67 transitions, 459 flow [2024-06-27 22:39:01,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 67 transitions, 457 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-06-27 22:39:01,963 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 324 flow [2024-06-27 22:39:01,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2024-06-27 22:39:01,964 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 24 predicate places. [2024-06-27 22:39:01,964 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 324 flow [2024-06-27 22:39:01,964 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:01,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:01,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:01,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 22:39:01,965 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:01,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:01,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1897711077, now seen corresponding path program 1 times [2024-06-27 22:39:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373871513] [2024-06-27 22:39:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:06,599 INFO 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:06,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:06,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373871513] [2024-06-27 22:39:06,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373871513] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:06,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:06,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:06,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407592837] [2024-06-27 22:39:06,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:06,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:06,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:06,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:06,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:06,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:06,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 324 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:06,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:06,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:06,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:07,862 INFO L124 PetriNetUnfolderBase]: 461/822 cut-off events. [2024-06-27 22:39:07,863 INFO L125 PetriNetUnfolderBase]: For 1475/1475 co-relation queries the response was YES. [2024-06-27 22:39:07,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 822 events. 461/822 cut-off events. For 1475/1475 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3946 event pairs, 68 based on Foata normal form. 1/821 useless extension candidates. Maximal degree in co-relation 2696. Up to 637 conditions per place. [2024-06-27 22:39:07,868 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 98 selfloop transitions, 30 changer transitions 0/133 dead transitions. [2024-06-27 22:39:07,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 133 transitions, 896 flow [2024-06-27 22:39:07,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:39:07,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:39:07,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 209 transitions. [2024-06-27 22:39:07,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976190476190476 [2024-06-27 22:39:07,869 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 324 flow. Second operand 12 states and 209 transitions. [2024-06-27 22:39:07,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 133 transitions, 896 flow [2024-06-27 22:39:07,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 133 transitions, 870 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 22:39:07,874 INFO L231 Difference]: Finished difference. Result has 73 places, 70 transitions, 546 flow [2024-06-27 22:39:07,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=546, PETRI_PLACES=73, PETRI_TRANSITIONS=70} [2024-06-27 22:39:07,875 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 36 predicate places. [2024-06-27 22:39:07,875 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 70 transitions, 546 flow [2024-06-27 22:39:07,875 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:07,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:07,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:07,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 22:39:07,876 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:07,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:07,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1075814561, now seen corresponding path program 2 times [2024-06-27 22:39:07,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:07,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947002856] [2024-06-27 22:39:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:07,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:07,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:13,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:13,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947002856] [2024-06-27 22:39:13,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947002856] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:13,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:13,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:13,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892879628] [2024-06-27 22:39:13,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:13,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:13,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:13,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:13,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:13,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:13,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 70 transitions, 546 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:13,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:13,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:13,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:13,692 INFO L124 PetriNetUnfolderBase]: 535/966 cut-off events. [2024-06-27 22:39:13,695 INFO L125 PetriNetUnfolderBase]: For 2725/2728 co-relation queries the response was YES. [2024-06-27 22:39:13,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3671 conditions, 966 events. 535/966 cut-off events. For 2725/2728 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4849 event pairs, 81 based on Foata normal form. 3/966 useless extension candidates. Maximal degree in co-relation 3634. Up to 736 conditions per place. [2024-06-27 22:39:13,701 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 76 selfloop transitions, 35 changer transitions 0/116 dead transitions. [2024-06-27 22:39:13,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 116 transitions, 1011 flow [2024-06-27 22:39:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 22:39:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 22:39:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2024-06-27 22:39:13,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 22:39:13,703 INFO L175 Difference]: Start difference. First operand has 73 places, 70 transitions, 546 flow. Second operand 6 states and 114 transitions. [2024-06-27 22:39:13,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 116 transitions, 1011 flow [2024-06-27 22:39:13,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 116 transitions, 939 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-27 22:39:13,710 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 708 flow [2024-06-27 22:39:13,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=708, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2024-06-27 22:39:13,711 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 39 predicate places. [2024-06-27 22:39:13,712 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 708 flow [2024-06-27 22:39:13,712 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:13,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:13,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:13,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 22:39:13,712 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:13,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1075814375, now seen corresponding path program 1 times [2024-06-27 22:39:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:13,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599197953] [2024-06-27 22:39:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:13,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:19,050 INFO 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:19,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:19,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599197953] [2024-06-27 22:39:19,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599197953] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:19,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:19,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817030348] [2024-06-27 22:39:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:19,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:19,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:19,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:19,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:19,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:19,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 708 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:19,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:19,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:19,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:20,289 INFO L124 PetriNetUnfolderBase]: 572/1029 cut-off events. [2024-06-27 22:39:20,290 INFO L125 PetriNetUnfolderBase]: For 3252/3255 co-relation queries the response was YES. [2024-06-27 22:39:20,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4018 conditions, 1029 events. 572/1029 cut-off events. For 3252/3255 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5190 event pairs, 84 based on Foata normal form. 3/1029 useless extension candidates. Maximal degree in co-relation 3979. Up to 795 conditions per place. [2024-06-27 22:39:20,300 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 89 selfloop transitions, 32 changer transitions 0/126 dead transitions. [2024-06-27 22:39:20,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 126 transitions, 1116 flow [2024-06-27 22:39:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:39:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:39:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 130 transitions. [2024-06-27 22:39:20,302 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5306122448979592 [2024-06-27 22:39:20,302 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 708 flow. Second operand 7 states and 130 transitions. [2024-06-27 22:39:20,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 126 transitions, 1116 flow [2024-06-27 22:39:20,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 126 transitions, 1070 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 22:39:20,312 INFO L231 Difference]: Finished difference. Result has 82 places, 90 transitions, 774 flow [2024-06-27 22:39:20,313 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=774, PETRI_PLACES=82, PETRI_TRANSITIONS=90} [2024-06-27 22:39:20,314 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 45 predicate places. [2024-06-27 22:39:20,314 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 90 transitions, 774 flow [2024-06-27 22:39:20,314 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:20,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:20,314 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:20,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 22:39:20,315 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:20,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:20,315 INFO L85 PathProgramCache]: Analyzing trace with hash 632377715, now seen corresponding path program 2 times [2024-06-27 22:39:20,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:20,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7349153] [2024-06-27 22:39:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:20,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:23,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:23,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7349153] [2024-06-27 22:39:23,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7349153] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:23,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:23,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:23,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612678456] [2024-06-27 22:39:23,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:23,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:23,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:23,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:23,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:23,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 90 transitions, 774 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:23,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:23,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:23,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:24,719 INFO L124 PetriNetUnfolderBase]: 602/1065 cut-off events. [2024-06-27 22:39:24,720 INFO L125 PetriNetUnfolderBase]: For 4041/4041 co-relation queries the response was YES. [2024-06-27 22:39:24,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 1065 events. 602/1065 cut-off events. For 4041/4041 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5329 event pairs, 76 based on Foata normal form. 2/1065 useless extension candidates. Maximal degree in co-relation 4352. Up to 726 conditions per place. [2024-06-27 22:39:24,728 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 97 selfloop transitions, 36 changer transitions 0/138 dead transitions. [2024-06-27 22:39:24,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 138 transitions, 1254 flow [2024-06-27 22:39:24,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:39:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:39:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 148 transitions. [2024-06-27 22:39:24,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2024-06-27 22:39:24,730 INFO L175 Difference]: Start difference. First operand has 82 places, 90 transitions, 774 flow. Second operand 8 states and 148 transitions. [2024-06-27 22:39:24,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 138 transitions, 1254 flow [2024-06-27 22:39:24,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 138 transitions, 1202 flow, removed 8 selfloop flow, removed 3 redundant places. [2024-06-27 22:39:24,741 INFO L231 Difference]: Finished difference. Result has 87 places, 94 transitions, 828 flow [2024-06-27 22:39:24,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=828, PETRI_PLACES=87, PETRI_TRANSITIONS=94} [2024-06-27 22:39:24,742 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 50 predicate places. [2024-06-27 22:39:24,742 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 94 transitions, 828 flow [2024-06-27 22:39:24,742 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:24,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:24,743 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:24,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 22:39:24,743 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:24,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1653450923, now seen corresponding path program 3 times [2024-06-27 22:39:24,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:24,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237642514] [2024-06-27 22:39:24,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:24,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:24,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:27,327 INFO 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:27,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237642514] [2024-06-27 22:39:27,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237642514] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:27,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:27,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121859701] [2024-06-27 22:39:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:27,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:27,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:27,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:27,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 94 transitions, 828 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:27,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:27,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:27,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:28,257 INFO L124 PetriNetUnfolderBase]: 605/1081 cut-off events. [2024-06-27 22:39:28,258 INFO L125 PetriNetUnfolderBase]: For 4715/4724 co-relation queries the response was YES. [2024-06-27 22:39:28,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4670 conditions, 1081 events. 605/1081 cut-off events. For 4715/4724 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5459 event pairs, 89 based on Foata normal form. 7/1084 useless extension candidates. Maximal degree in co-relation 4625. Up to 769 conditions per place. [2024-06-27 22:39:28,265 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 81 selfloop transitions, 36 changer transitions 0/122 dead transitions. [2024-06-27 22:39:28,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 122 transitions, 1196 flow [2024-06-27 22:39:28,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:39:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:39:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2024-06-27 22:39:28,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2024-06-27 22:39:28,267 INFO L175 Difference]: Start difference. First operand has 87 places, 94 transitions, 828 flow. Second operand 7 states and 120 transitions. [2024-06-27 22:39:28,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 122 transitions, 1196 flow [2024-06-27 22:39:28,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 122 transitions, 1106 flow, removed 10 selfloop flow, removed 6 redundant places. [2024-06-27 22:39:28,277 INFO L231 Difference]: Finished difference. Result has 88 places, 97 transitions, 862 flow [2024-06-27 22:39:28,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=862, PETRI_PLACES=88, PETRI_TRANSITIONS=97} [2024-06-27 22:39:28,278 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 51 predicate places. [2024-06-27 22:39:28,278 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 97 transitions, 862 flow [2024-06-27 22:39:28,279 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:28,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:28,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:39:28,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 22:39:28,279 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:28,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:28,280 INFO L85 PathProgramCache]: Analyzing trace with hash 20508473, now seen corresponding path program 3 times [2024-06-27 22:39:28,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:28,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343398306] [2024-06-27 22:39:28,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:28,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:30,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343398306] [2024-06-27 22:39:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343398306] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:30,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 22:39:30,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705865459] [2024-06-27 22:39:30,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:30,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 22:39:30,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:30,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 22:39:30,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 22:39:31,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:31,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 97 transitions, 862 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:31,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:31,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:31,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:31,768 INFO L124 PetriNetUnfolderBase]: 646/1167 cut-off events. [2024-06-27 22:39:31,768 INFO L125 PetriNetUnfolderBase]: For 5231/5240 co-relation queries the response was YES. [2024-06-27 22:39:31,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5008 conditions, 1167 events. 646/1167 cut-off events. For 5231/5240 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6072 event pairs, 89 based on Foata normal form. 11/1174 useless extension candidates. Maximal degree in co-relation 4964. Up to 667 conditions per place. [2024-06-27 22:39:31,777 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 83 selfloop transitions, 41 changer transitions 0/129 dead transitions. [2024-06-27 22:39:31,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 129 transitions, 1259 flow [2024-06-27 22:39:31,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:39:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:39:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 124 transitions. [2024-06-27 22:39:31,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2024-06-27 22:39:31,778 INFO L175 Difference]: Start difference. First operand has 88 places, 97 transitions, 862 flow. Second operand 7 states and 124 transitions. [2024-06-27 22:39:31,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 129 transitions, 1259 flow [2024-06-27 22:39:31,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 129 transitions, 1199 flow, removed 18 selfloop flow, removed 3 redundant places. [2024-06-27 22:39:31,790 INFO L231 Difference]: Finished difference. Result has 93 places, 101 transitions, 975 flow [2024-06-27 22:39:31,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=975, PETRI_PLACES=93, PETRI_TRANSITIONS=101} [2024-06-27 22:39:31,790 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 56 predicate places. [2024-06-27 22:39:31,790 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 101 transitions, 975 flow [2024-06-27 22:39:31,791 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,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:31,791 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,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 22:39:31,793 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:31,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:31,794 INFO L85 PathProgramCache]: Analyzing trace with hash 632386643, now seen corresponding path program 1 times [2024-06-27 22:39:31,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:31,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088748611] [2024-06-27 22:39:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:31,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:39:35,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:35,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088748611] [2024-06-27 22:39:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088748611] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:35,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:35,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:39:35,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212917466] [2024-06-27 22:39:35,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:35,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:39:35,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:35,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:39:35,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:39:35,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:35,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 101 transitions, 975 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:35,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:35,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:35,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:36,388 INFO L124 PetriNetUnfolderBase]: 643/1197 cut-off events. [2024-06-27 22:39:36,388 INFO L125 PetriNetUnfolderBase]: For 6538/6538 co-relation queries the response was YES. [2024-06-27 22:39:36,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 1197 events. 643/1197 cut-off events. For 6538/6538 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6205 event pairs, 153 based on Foata normal form. 2/1197 useless extension candidates. Maximal degree in co-relation 5214. Up to 958 conditions per place. [2024-06-27 22:39:36,396 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 103 selfloop transitions, 18 changer transitions 0/126 dead transitions. [2024-06-27 22:39:36,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 126 transitions, 1313 flow [2024-06-27 22:39:36,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:39:36,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:39:36,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2024-06-27 22:39:36,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46530612244897956 [2024-06-27 22:39:36,397 INFO L175 Difference]: Start difference. First operand has 93 places, 101 transitions, 975 flow. Second operand 7 states and 114 transitions. [2024-06-27 22:39:36,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 126 transitions, 1313 flow [2024-06-27 22:39:36,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 126 transitions, 1251 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 22:39:36,409 INFO L231 Difference]: Finished difference. Result has 95 places, 101 transitions, 953 flow [2024-06-27 22:39:36,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=953, PETRI_PLACES=95, PETRI_TRANSITIONS=101} [2024-06-27 22:39:36,410 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 58 predicate places. [2024-06-27 22:39:36,410 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 953 flow [2024-06-27 22:39:36,410 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:36,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:36,411 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:36,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 22:39:36,411 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:36,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash 2090269205, now seen corresponding path program 1 times [2024-06-27 22:39:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:36,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514682138] [2024-06-27 22:39:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:41,057 INFO 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:41,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:41,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514682138] [2024-06-27 22:39:41,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514682138] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:41,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:41,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:39:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807493037] [2024-06-27 22:39:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:41,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:39:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:41,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:39:41,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:39:41,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:41,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 953 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:41,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:41,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:41,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:42,652 INFO L124 PetriNetUnfolderBase]: 693/1248 cut-off events. [2024-06-27 22:39:42,653 INFO L125 PetriNetUnfolderBase]: For 6190/6194 co-relation queries the response was YES. [2024-06-27 22:39:42,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5528 conditions, 1248 events. 693/1248 cut-off events. For 6190/6194 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6523 event pairs, 88 based on Foata normal form. 6/1252 useless extension candidates. Maximal degree in co-relation 5481. Up to 718 conditions per place. [2024-06-27 22:39:42,667 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 136 selfloop transitions, 49 changer transitions 0/190 dead transitions. [2024-06-27 22:39:42,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 190 transitions, 1670 flow [2024-06-27 22:39:42,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:39:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:39:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 240 transitions. [2024-06-27 22:39:42,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274725274725275 [2024-06-27 22:39:42,669 INFO L175 Difference]: Start difference. First operand has 95 places, 101 transitions, 953 flow. Second operand 13 states and 240 transitions. [2024-06-27 22:39:42,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 190 transitions, 1670 flow [2024-06-27 22:39:42,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 190 transitions, 1623 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-06-27 22:39:42,685 INFO L231 Difference]: Finished difference. Result has 104 places, 108 transitions, 1110 flow [2024-06-27 22:39:42,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1110, PETRI_PLACES=104, PETRI_TRANSITIONS=108} [2024-06-27 22:39:42,686 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 67 predicate places. [2024-06-27 22:39:42,686 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 108 transitions, 1110 flow [2024-06-27 22:39:42,686 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:42,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:42,686 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:42,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 22:39:42,687 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:39:42,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:42,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1153585943, now seen corresponding path program 2 times [2024-06-27 22:39:42,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:42,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022619269] [2024-06-27 22:39:42,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:46,845 INFO 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:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:46,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022619269] [2024-06-27 22:39:46,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022619269] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:46,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:46,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:39:46,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755598724] [2024-06-27 22:39:46,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:46,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:39:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:46,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:39:46,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:39:46,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:46,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 108 transitions, 1110 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:46,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:46,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:46,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:48,365 INFO L124 PetriNetUnfolderBase]: 734/1331 cut-off events. [2024-06-27 22:39:48,365 INFO L125 PetriNetUnfolderBase]: For 8095/8099 co-relation queries the response was YES. [2024-06-27 22:39:48,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6214 conditions, 1331 events. 734/1331 cut-off events. For 8095/8099 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7104 event pairs, 80 based on Foata normal form. 7/1336 useless extension candidates. Maximal degree in co-relation 6166. Up to 652 conditions per place. [2024-06-27 22:39:48,373 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 120 selfloop transitions, 77 changer transitions 0/202 dead transitions. [2024-06-27 22:39:48,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 202 transitions, 1917 flow [2024-06-27 22:39:48,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:39:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:39:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 236 transitions. [2024-06-27 22:39:48,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5619047619047619 [2024-06-27 22:39:48,375 INFO L175 Difference]: Start difference. First operand has 104 places, 108 transitions, 1110 flow. Second operand 12 states and 236 transitions. [2024-06-27 22:39:48,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 202 transitions, 1917 flow [2024-06-27 22:39:48,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 202 transitions, 1830 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-06-27 22:39:48,397 INFO L231 Difference]: Finished difference. Result has 110 places, 122 transitions, 1360 flow [2024-06-27 22:39:48,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1360, PETRI_PLACES=110, PETRI_TRANSITIONS=122} [2024-06-27 22:39:48,398 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 73 predicate places. [2024-06-27 22:39:48,398 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 122 transitions, 1360 flow [2024-06-27 22:39:48,398 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:48,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:48,398 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:39:48,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 22:39:48,399 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:39:48,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:48,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1111205628, now seen corresponding path program 1 times [2024-06-27 22:39:48,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:48,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876605893] [2024-06-27 22:39:48,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:48,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:39:54,060 INFO 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,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:39:54,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876605893] [2024-06-27 22:39:54,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876605893] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:39:54,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:39:54,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:39:54,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914177743] [2024-06-27 22:39:54,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:39:54,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:39:54,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:39:54,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:39:54,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:39:54,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:39:54,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 122 transitions, 1360 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:54,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:39:54,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:39:54,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:39:55,300 INFO L124 PetriNetUnfolderBase]: 763/1371 cut-off events. [2024-06-27 22:39:55,300 INFO L125 PetriNetUnfolderBase]: For 10216/10220 co-relation queries the response was YES. [2024-06-27 22:39:55,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6951 conditions, 1371 events. 763/1371 cut-off events. For 10216/10220 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7259 event pairs, 41 based on Foata normal form. 6/1375 useless extension candidates. Maximal degree in co-relation 6899. Up to 862 conditions per place. [2024-06-27 22:39:55,319 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 143 selfloop transitions, 46 changer transitions 0/194 dead transitions. [2024-06-27 22:39:55,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 194 transitions, 2048 flow [2024-06-27 22:39:55,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:39:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:39:55,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 214 transitions. [2024-06-27 22:39:55,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095238095238095 [2024-06-27 22:39:55,321 INFO L175 Difference]: Start difference. First operand has 110 places, 122 transitions, 1360 flow. Second operand 12 states and 214 transitions. [2024-06-27 22:39:55,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 194 transitions, 2048 flow [2024-06-27 22:39:55,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 194 transitions, 1929 flow, removed 47 selfloop flow, removed 3 redundant places. [2024-06-27 22:39:55,344 INFO L231 Difference]: Finished difference. Result has 119 places, 124 transitions, 1359 flow [2024-06-27 22:39:55,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1241, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1359, PETRI_PLACES=119, PETRI_TRANSITIONS=124} [2024-06-27 22:39:55,345 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 82 predicate places. [2024-06-27 22:39:55,345 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 124 transitions, 1359 flow [2024-06-27 22:39:55,345 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:55,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:39:55,346 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:39:55,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:39:55,346 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:39:55,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:39:55,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1660784346, now seen corresponding path program 2 times [2024-06-27 22:39:55,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:39:55,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064737965] [2024-06-27 22:39:55,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:39:55,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:39:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:00,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:00,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064737965] [2024-06-27 22:40:00,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064737965] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:00,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:00,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:00,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503047611] [2024-06-27 22:40:00,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:00,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:00,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:00,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:00,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:00,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:00,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 124 transitions, 1359 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:00,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:00,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:00,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:01,518 INFO L124 PetriNetUnfolderBase]: 785/1415 cut-off events. [2024-06-27 22:40:01,518 INFO L125 PetriNetUnfolderBase]: For 10306/10310 co-relation queries the response was YES. [2024-06-27 22:40:01,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7136 conditions, 1415 events. 785/1415 cut-off events. For 10306/10310 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7611 event pairs, 85 based on Foata normal form. 6/1419 useless extension candidates. Maximal degree in co-relation 7082. Up to 1029 conditions per place. [2024-06-27 22:40:01,527 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 145 selfloop transitions, 44 changer transitions 0/194 dead transitions. [2024-06-27 22:40:01,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 194 transitions, 1989 flow [2024-06-27 22:40:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:40:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:40:01,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 225 transitions. [2024-06-27 22:40:01,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945054945054945 [2024-06-27 22:40:01,531 INFO L175 Difference]: Start difference. First operand has 119 places, 124 transitions, 1359 flow. Second operand 13 states and 225 transitions. [2024-06-27 22:40:01,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 194 transitions, 1989 flow [2024-06-27 22:40:01,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 194 transitions, 1912 flow, removed 7 selfloop flow, removed 8 redundant places. [2024-06-27 22:40:01,552 INFO L231 Difference]: Finished difference. Result has 124 places, 125 transitions, 1389 flow [2024-06-27 22:40:01,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1286, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1389, PETRI_PLACES=124, PETRI_TRANSITIONS=125} [2024-06-27 22:40:01,553 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 87 predicate places. [2024-06-27 22:40:01,553 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 125 transitions, 1389 flow [2024-06-27 22:40:01,553 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:01,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:01,553 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:01,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:40:01,554 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:01,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:01,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1776075516, now seen corresponding path program 3 times [2024-06-27 22:40:01,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:01,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785925322] [2024-06-27 22:40:01,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:01,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:07,792 INFO 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:07,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:07,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785925322] [2024-06-27 22:40:07,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785925322] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835530972] [2024-06-27 22:40:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:07,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:07,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:07,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:07,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:07,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 125 transitions, 1389 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:07,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:07,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:07,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:08,704 INFO L124 PetriNetUnfolderBase]: 831/1501 cut-off events. [2024-06-27 22:40:08,704 INFO L125 PetriNetUnfolderBase]: For 11243/11249 co-relation queries the response was YES. [2024-06-27 22:40:08,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7523 conditions, 1501 events. 831/1501 cut-off events. For 11243/11249 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8340 event pairs, 80 based on Foata normal form. 6/1504 useless extension candidates. Maximal degree in co-relation 7467. Up to 1135 conditions per place. [2024-06-27 22:40:08,730 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 125 selfloop transitions, 38 changer transitions 0/168 dead transitions. [2024-06-27 22:40:08,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 168 transitions, 1921 flow [2024-06-27 22:40:08,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:40:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:40:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 134 transitions. [2024-06-27 22:40:08,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5469387755102041 [2024-06-27 22:40:08,745 INFO L175 Difference]: Start difference. First operand has 124 places, 125 transitions, 1389 flow. Second operand 7 states and 134 transitions. [2024-06-27 22:40:08,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 168 transitions, 1921 flow [2024-06-27 22:40:08,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 168 transitions, 1828 flow, removed 1 selfloop flow, removed 11 redundant places. [2024-06-27 22:40:08,770 INFO L231 Difference]: Finished difference. Result has 120 places, 127 transitions, 1408 flow [2024-06-27 22:40:08,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1408, PETRI_PLACES=120, PETRI_TRANSITIONS=127} [2024-06-27 22:40:08,770 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 83 predicate places. [2024-06-27 22:40:08,771 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 127 transitions, 1408 flow [2024-06-27 22:40:08,771 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:08,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:08,771 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:08,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 22:40:08,771 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:08,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1816123968, now seen corresponding path program 1 times [2024-06-27 22:40:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:08,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533734794] [2024-06-27 22:40:08,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:08,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:14,882 INFO 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:14,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:14,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533734794] [2024-06-27 22:40:14,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533734794] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:14,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:14,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:14,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847507238] [2024-06-27 22:40:14,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:14,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:14,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:14,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:14,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:14,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:14,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 127 transitions, 1408 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:14,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:14,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:14,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:15,791 INFO L124 PetriNetUnfolderBase]: 858/1548 cut-off events. [2024-06-27 22:40:15,791 INFO L125 PetriNetUnfolderBase]: For 11987/11993 co-relation queries the response was YES. [2024-06-27 22:40:15,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7722 conditions, 1548 events. 858/1548 cut-off events. For 11987/11993 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8568 event pairs, 90 based on Foata normal form. 6/1551 useless extension candidates. Maximal degree in co-relation 7664. Up to 1225 conditions per place. [2024-06-27 22:40:15,801 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 125 selfloop transitions, 39 changer transitions 0/169 dead transitions. [2024-06-27 22:40:15,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 169 transitions, 1954 flow [2024-06-27 22:40:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:15,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2024-06-27 22:40:15,802 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2024-06-27 22:40:15,802 INFO L175 Difference]: Start difference. First operand has 120 places, 127 transitions, 1408 flow. Second operand 8 states and 142 transitions. [2024-06-27 22:40:15,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 169 transitions, 1954 flow [2024-06-27 22:40:15,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 169 transitions, 1857 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-06-27 22:40:15,824 INFO L231 Difference]: Finished difference. Result has 123 places, 132 transitions, 1488 flow [2024-06-27 22:40:15,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1488, PETRI_PLACES=123, PETRI_TRANSITIONS=132} [2024-06-27 22:40:15,825 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 86 predicate places. [2024-06-27 22:40:15,826 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 132 transitions, 1488 flow [2024-06-27 22:40:15,826 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:15,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:15,826 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:15,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-27 22:40:15,827 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:15,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:15,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2124629874, now seen corresponding path program 2 times [2024-06-27 22:40:15,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:15,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548368243] [2024-06-27 22:40:15,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:20,690 INFO 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,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548368243] [2024-06-27 22:40:20,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548368243] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:20,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:20,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121657681] [2024-06-27 22:40:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:20,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:20,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:20,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:20,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:20,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:20,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 132 transitions, 1488 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:20,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:20,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:20,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:21,626 INFO L124 PetriNetUnfolderBase]: 880/1583 cut-off events. [2024-06-27 22:40:21,626 INFO L125 PetriNetUnfolderBase]: For 13263/13267 co-relation queries the response was YES. [2024-06-27 22:40:21,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7900 conditions, 1583 events. 880/1583 cut-off events. For 13263/13267 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8794 event pairs, 99 based on Foata normal form. 6/1587 useless extension candidates. Maximal degree in co-relation 7841. Up to 1127 conditions per place. [2024-06-27 22:40:21,636 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 135 selfloop transitions, 44 changer transitions 0/184 dead transitions. [2024-06-27 22:40:21,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 184 transitions, 2132 flow [2024-06-27 22:40:21,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 156 transitions. [2024-06-27 22:40:21,638 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2024-06-27 22:40:21,638 INFO L175 Difference]: Start difference. First operand has 123 places, 132 transitions, 1488 flow. Second operand 8 states and 156 transitions. [2024-06-27 22:40:21,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 184 transitions, 2132 flow [2024-06-27 22:40:21,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 184 transitions, 2035 flow, removed 19 selfloop flow, removed 4 redundant places. [2024-06-27 22:40:21,665 INFO L231 Difference]: Finished difference. Result has 127 places, 133 transitions, 1494 flow [2024-06-27 22:40:21,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1494, PETRI_PLACES=127, PETRI_TRANSITIONS=133} [2024-06-27 22:40:21,666 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 90 predicate places. [2024-06-27 22:40:21,666 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 133 transitions, 1494 flow [2024-06-27 22:40:21,666 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:21,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:21,667 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:21,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-06-27 22:40:21,667 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:21,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 2133200754, now seen corresponding path program 3 times [2024-06-27 22:40:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869251546] [2024-06-27 22:40:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:26,647 INFO 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:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:26,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869251546] [2024-06-27 22:40:26,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869251546] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:26,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:26,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:26,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074612280] [2024-06-27 22:40:26,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:26,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:26,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:26,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:26,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:26,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 133 transitions, 1494 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:26,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:26,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:26,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:27,616 INFO L124 PetriNetUnfolderBase]: 930/1686 cut-off events. [2024-06-27 22:40:27,616 INFO L125 PetriNetUnfolderBase]: For 14283/14287 co-relation queries the response was YES. [2024-06-27 22:40:27,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8389 conditions, 1686 events. 930/1686 cut-off events. For 14283/14287 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9507 event pairs, 91 based on Foata normal form. 6/1690 useless extension candidates. Maximal degree in co-relation 8330. Up to 1081 conditions per place. [2024-06-27 22:40:27,626 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 136 selfloop transitions, 52 changer transitions 0/193 dead transitions. [2024-06-27 22:40:27,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 193 transitions, 2237 flow [2024-06-27 22:40:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 22:40:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 22:40:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 169 transitions. [2024-06-27 22:40:27,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5365079365079365 [2024-06-27 22:40:27,628 INFO L175 Difference]: Start difference. First operand has 127 places, 133 transitions, 1494 flow. Second operand 9 states and 169 transitions. [2024-06-27 22:40:27,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 193 transitions, 2237 flow [2024-06-27 22:40:27,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 193 transitions, 2143 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-06-27 22:40:27,659 INFO L231 Difference]: Finished difference. Result has 131 places, 140 transitions, 1627 flow [2024-06-27 22:40:27,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1405, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1627, PETRI_PLACES=131, PETRI_TRANSITIONS=140} [2024-06-27 22:40:27,659 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 94 predicate places. [2024-06-27 22:40:27,659 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 140 transitions, 1627 flow [2024-06-27 22:40:27,660 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:27,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:27,660 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:27,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-06-27 22:40:27,660 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:27,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:27,661 INFO L85 PathProgramCache]: Analyzing trace with hash 171412314, now seen corresponding path program 4 times [2024-06-27 22:40:27,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:27,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200256852] [2024-06-27 22:40:27,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:30,781 INFO 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:30,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200256852] [2024-06-27 22:40:30,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200256852] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:30,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:30,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 22:40:30,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463267228] [2024-06-27 22:40:30,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:30,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-27 22:40:30,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:30,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-27 22:40:30,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-06-27 22:40:30,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:30,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 140 transitions, 1627 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:30,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:30,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:30,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:31,923 INFO L124 PetriNetUnfolderBase]: 1045/1919 cut-off events. [2024-06-27 22:40:31,924 INFO L125 PetriNetUnfolderBase]: For 20001/20016 co-relation queries the response was YES. [2024-06-27 22:40:31,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9485 conditions, 1919 events. 1045/1919 cut-off events. For 20001/20016 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 11358 event pairs, 149 based on Foata normal form. 22/1937 useless extension candidates. Maximal degree in co-relation 9424. Up to 932 conditions per place. [2024-06-27 22:40:31,961 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 126 selfloop transitions, 52 changer transitions 0/183 dead transitions. [2024-06-27 22:40:31,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 183 transitions, 2244 flow [2024-06-27 22:40:31,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 22:40:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 22:40:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2024-06-27 22:40:31,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2024-06-27 22:40:31,962 INFO L175 Difference]: Start difference. First operand has 131 places, 140 transitions, 1627 flow. Second operand 8 states and 147 transitions. [2024-06-27 22:40:31,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 183 transitions, 2244 flow [2024-06-27 22:40:32,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 183 transitions, 2129 flow, removed 27 selfloop flow, removed 4 redundant places. [2024-06-27 22:40:32,029 INFO L231 Difference]: Finished difference. Result has 135 places, 141 transitions, 1644 flow [2024-06-27 22:40:32,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1644, PETRI_PLACES=135, PETRI_TRANSITIONS=141} [2024-06-27 22:40:32,030 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 98 predicate places. [2024-06-27 22:40:32,030 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 141 transitions, 1644 flow [2024-06-27 22:40:32,030 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:32,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:32,030 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:32,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-06-27 22:40:32,030 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:32,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:32,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1765980686, now seen corresponding path program 4 times [2024-06-27 22:40:32,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:32,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411669171] [2024-06-27 22:40:32,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:32,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:32,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:40:36,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:36,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411669171] [2024-06-27 22:40:36,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411669171] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:36,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:36,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:36,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570664491] [2024-06-27 22:40:36,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:36,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:36,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:36,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:36,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:36,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:36,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 141 transitions, 1644 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:36,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:36,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:36,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:37,380 INFO L124 PetriNetUnfolderBase]: 1049/1932 cut-off events. [2024-06-27 22:40:37,380 INFO L125 PetriNetUnfolderBase]: For 17445/17460 co-relation queries the response was YES. [2024-06-27 22:40:37,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9597 conditions, 1932 events. 1049/1932 cut-off events. For 17445/17460 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11472 event pairs, 145 based on Foata normal form. 12/1940 useless extension candidates. Maximal degree in co-relation 9533. Up to 1419 conditions per place. [2024-06-27 22:40:37,392 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 123 selfloop transitions, 40 changer transitions 0/168 dead transitions. [2024-06-27 22:40:37,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 168 transitions, 2117 flow [2024-06-27 22:40:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 22:40:37,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 22:40:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2024-06-27 22:40:37,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2024-06-27 22:40:37,413 INFO L175 Difference]: Start difference. First operand has 135 places, 141 transitions, 1644 flow. Second operand 7 states and 118 transitions. [2024-06-27 22:40:37,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 168 transitions, 2117 flow [2024-06-27 22:40:37,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 168 transitions, 1998 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-27 22:40:37,449 INFO L231 Difference]: Finished difference. Result has 136 places, 142 transitions, 1639 flow [2024-06-27 22:40:37,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1533, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1639, PETRI_PLACES=136, PETRI_TRANSITIONS=142} [2024-06-27 22:40:37,450 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 99 predicate places. [2024-06-27 22:40:37,450 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 142 transitions, 1639 flow [2024-06-27 22:40:37,451 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:37,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:37,451 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:37,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-06-27 22:40:37,451 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:40:37,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:37,451 INFO L85 PathProgramCache]: Analyzing trace with hash -301723717, now seen corresponding path program 1 times [2024-06-27 22:40:37,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:37,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136877713] [2024-06-27 22:40:37,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:37,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:37,541 INFO 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,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:37,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136877713] [2024-06-27 22:40:37,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136877713] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:37,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:37,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 22:40:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263014400] [2024-06-27 22:40:37,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:37,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 22:40:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 22:40:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 22:40:37,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:40:37,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 142 transitions, 1639 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:40:37,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:37,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:40:37,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:37,809 INFO L124 PetriNetUnfolderBase]: 567/1191 cut-off events. [2024-06-27 22:40:37,810 INFO L125 PetriNetUnfolderBase]: For 9667/9706 co-relation queries the response was YES. [2024-06-27 22:40:37,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5232 conditions, 1191 events. 567/1191 cut-off events. For 9667/9706 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7062 event pairs, 94 based on Foata normal form. 94/1249 useless extension candidates. Maximal degree in co-relation 5168. Up to 446 conditions per place. [2024-06-27 22:40:37,817 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 63 selfloop transitions, 22 changer transitions 0/118 dead transitions. [2024-06-27 22:40:37,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 118 transitions, 1353 flow [2024-06-27 22:40:37,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 22:40:37,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 22:40:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2024-06-27 22:40:37,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2024-06-27 22:40:37,818 INFO L175 Difference]: Start difference. First operand has 136 places, 142 transitions, 1639 flow. Second operand 4 states and 86 transitions. [2024-06-27 22:40:37,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 118 transitions, 1353 flow [2024-06-27 22:40:37,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 118 transitions, 1190 flow, removed 21 selfloop flow, removed 17 redundant places. [2024-06-27 22:40:37,838 INFO L231 Difference]: Finished difference. Result has 120 places, 101 transitions, 1008 flow [2024-06-27 22:40:37,838 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1008, PETRI_PLACES=120, PETRI_TRANSITIONS=101} [2024-06-27 22:40:37,838 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 83 predicate places. [2024-06-27 22:40:37,839 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 101 transitions, 1008 flow [2024-06-27 22:40:37,839 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:40:37,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:37,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:37,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-06-27 22:40:37,839 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:37,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:37,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1110835196, now seen corresponding path program 1 times [2024-06-27 22:40:37,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:37,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983350869] [2024-06-27 22:40:37,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:37,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:37,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:42,640 INFO 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:42,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:42,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983350869] [2024-06-27 22:40:42,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983350869] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:42,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:42,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:42,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651387966] [2024-06-27 22:40:42,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:42,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:42,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:42,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:42,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:42,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 101 transitions, 1008 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:42,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:42,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:42,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:44,152 INFO L124 PetriNetUnfolderBase]: 890/1770 cut-off events. [2024-06-27 22:40:44,153 INFO L125 PetriNetUnfolderBase]: For 13403/13407 co-relation queries the response was YES. [2024-06-27 22:40:44,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7647 conditions, 1770 events. 890/1770 cut-off events. For 13403/13407 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 10577 event pairs, 252 based on Foata normal form. 12/1780 useless extension candidates. Maximal degree in co-relation 7591. Up to 669 conditions per place. [2024-06-27 22:40:44,162 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 113 selfloop transitions, 41 changer transitions 9/168 dead transitions. [2024-06-27 22:40:44,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 168 transitions, 1665 flow [2024-06-27 22:40:44,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:40:44,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:40:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 216 transitions. [2024-06-27 22:40:44,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4747252747252747 [2024-06-27 22:40:44,164 INFO L175 Difference]: Start difference. First operand has 120 places, 101 transitions, 1008 flow. Second operand 13 states and 216 transitions. [2024-06-27 22:40:44,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 168 transitions, 1665 flow [2024-06-27 22:40:44,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 168 transitions, 1639 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 22:40:44,189 INFO L231 Difference]: Finished difference. Result has 131 places, 100 transitions, 1066 flow [2024-06-27 22:40:44,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1066, PETRI_PLACES=131, PETRI_TRANSITIONS=100} [2024-06-27 22:40:44,190 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 94 predicate places. [2024-06-27 22:40:44,190 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 100 transitions, 1066 flow [2024-06-27 22:40:44,190 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:44,191 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:44,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:44,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-06-27 22:40:44,191 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:44,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash -55143910, now seen corresponding path program 2 times [2024-06-27 22:40:44,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142415489] [2024-06-27 22:40:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:40:54,292 INFO 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:54,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:40:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142415489] [2024-06-27 22:40:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142415489] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:40:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:40:54,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:40:54,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304414607] [2024-06-27 22:40:54,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:40:54,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:40:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:40:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:40:54,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:40:54,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:40:54,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 100 transitions, 1066 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:54,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:40:54,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:40:54,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:40:55,970 INFO L124 PetriNetUnfolderBase]: 880/1757 cut-off events. [2024-06-27 22:40:55,971 INFO L125 PetriNetUnfolderBase]: For 13902/13906 co-relation queries the response was YES. [2024-06-27 22:40:55,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7426 conditions, 1757 events. 880/1757 cut-off events. For 13902/13906 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 10352 event pairs, 407 based on Foata normal form. 14/1769 useless extension candidates. Maximal degree in co-relation 7369. Up to 1250 conditions per place. [2024-06-27 22:40:55,983 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 101 selfloop transitions, 37 changer transitions 0/143 dead transitions. [2024-06-27 22:40:55,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 143 transitions, 1498 flow [2024-06-27 22:40:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:40:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:40:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 196 transitions. [2024-06-27 22:40:55,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2024-06-27 22:40:55,985 INFO L175 Difference]: Start difference. First operand has 131 places, 100 transitions, 1066 flow. Second operand 13 states and 196 transitions. [2024-06-27 22:40:55,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 143 transitions, 1498 flow [2024-06-27 22:40:56,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 143 transitions, 1366 flow, removed 4 selfloop flow, removed 13 redundant places. [2024-06-27 22:40:56,005 INFO L231 Difference]: Finished difference. Result has 131 places, 100 transitions, 1017 flow [2024-06-27 22:40:56,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=939, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1017, PETRI_PLACES=131, PETRI_TRANSITIONS=100} [2024-06-27 22:40:56,023 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 94 predicate places. [2024-06-27 22:40:56,023 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 100 transitions, 1017 flow [2024-06-27 22:40:56,023 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:56,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:40:56,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:40:56,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-06-27 22:40:56,024 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:40:56,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:40:56,024 INFO L85 PathProgramCache]: Analyzing trace with hash -141983590, now seen corresponding path program 3 times [2024-06-27 22:40:56,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:40:56,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434514441] [2024-06-27 22:40:56,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:40:56,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:40:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:03,092 INFO 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,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:03,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434514441] [2024-06-27 22:41:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434514441] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:03,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:03,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:03,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450201312] [2024-06-27 22:41:03,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:03,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:03,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:03,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:03,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:03,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:03,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 100 transitions, 1017 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:03,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:03,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:03,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:04,594 INFO L124 PetriNetUnfolderBase]: 870/1723 cut-off events. [2024-06-27 22:41:04,594 INFO L125 PetriNetUnfolderBase]: For 11193/11197 co-relation queries the response was YES. [2024-06-27 22:41:04,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6857 conditions, 1723 events. 870/1723 cut-off events. For 11193/11197 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10107 event pairs, 338 based on Foata normal form. 12/1733 useless extension candidates. Maximal degree in co-relation 6801. Up to 1055 conditions per place. [2024-06-27 22:41:04,604 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 111 selfloop transitions, 38 changer transitions 0/154 dead transitions. [2024-06-27 22:41:04,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 154 transitions, 1525 flow [2024-06-27 22:41:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:41:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:41:04,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 216 transitions. [2024-06-27 22:41:04,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44081632653061226 [2024-06-27 22:41:04,605 INFO L175 Difference]: Start difference. First operand has 131 places, 100 transitions, 1017 flow. Second operand 14 states and 216 transitions. [2024-06-27 22:41:04,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 154 transitions, 1525 flow [2024-06-27 22:41:04,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 154 transitions, 1453 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-06-27 22:41:04,625 INFO L231 Difference]: Finished difference. Result has 134 places, 100 transitions, 1024 flow [2024-06-27 22:41:04,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=945, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1024, PETRI_PLACES=134, PETRI_TRANSITIONS=100} [2024-06-27 22:41:04,626 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 97 predicate places. [2024-06-27 22:41:04,626 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 100 transitions, 1024 flow [2024-06-27 22:41:04,626 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:04,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:04,627 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:04,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-06-27 22:41:04,627 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:04,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:04,627 INFO L85 PathProgramCache]: Analyzing trace with hash -770507354, now seen corresponding path program 1 times [2024-06-27 22:41:04,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068566783] [2024-06-27 22:41:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:04,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:04,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:11,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:11,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068566783] [2024-06-27 22:41:11,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068566783] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:11,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:11,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:11,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580576824] [2024-06-27 22:41:11,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:11,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:11,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:11,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:11,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:11,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 100 transitions, 1024 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:11,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:11,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:11,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:12,172 INFO L124 PetriNetUnfolderBase]: 1031/2097 cut-off events. [2024-06-27 22:41:12,172 INFO L125 PetriNetUnfolderBase]: For 13034/13040 co-relation queries the response was YES. [2024-06-27 22:41:12,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8090 conditions, 2097 events. 1031/2097 cut-off events. For 13034/13040 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 13280 event pairs, 520 based on Foata normal form. 10/2104 useless extension candidates. Maximal degree in co-relation 8033. Up to 1456 conditions per place. [2024-06-27 22:41:12,185 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 114 selfloop transitions, 26 changer transitions 0/145 dead transitions. [2024-06-27 22:41:12,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 145 transitions, 1520 flow [2024-06-27 22:41:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:41:12,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:41:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 164 transitions. [2024-06-27 22:41:12,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685714285714286 [2024-06-27 22:41:12,186 INFO L175 Difference]: Start difference. First operand has 134 places, 100 transitions, 1024 flow. Second operand 10 states and 164 transitions. [2024-06-27 22:41:12,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 145 transitions, 1520 flow [2024-06-27 22:41:12,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 145 transitions, 1437 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-06-27 22:41:12,209 INFO L231 Difference]: Finished difference. Result has 134 places, 104 transitions, 1064 flow [2024-06-27 22:41:12,210 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1064, PETRI_PLACES=134, PETRI_TRANSITIONS=104} [2024-06-27 22:41:12,210 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 97 predicate places. [2024-06-27 22:41:12,210 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 104 transitions, 1064 flow [2024-06-27 22:41:12,210 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:12,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:12,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:12,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-06-27 22:41:12,211 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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:12,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1438802312, now seen corresponding path program 4 times [2024-06-27 22:41:12,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:12,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002862806] [2024-06-27 22:41:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002862806] [2024-06-27 22:41:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002862806] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:16,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:16,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764345914] [2024-06-27 22:41:16,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:16,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:16,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:16,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 104 transitions, 1064 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:16,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:16,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:16,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:17,908 INFO L124 PetriNetUnfolderBase]: 1078/2175 cut-off events. [2024-06-27 22:41:17,909 INFO L125 PetriNetUnfolderBase]: For 14559/14563 co-relation queries the response was YES. [2024-06-27 22:41:17,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8351 conditions, 2175 events. 1078/2175 cut-off events. For 14559/14563 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 13852 event pairs, 564 based on Foata normal form. 14/2187 useless extension candidates. Maximal degree in co-relation 8290. Up to 1662 conditions per place. [2024-06-27 22:41:17,923 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 88 selfloop transitions, 47 changer transitions 0/140 dead transitions. [2024-06-27 22:41:17,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 140 transitions, 1459 flow [2024-06-27 22:41:17,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 22:41:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 22:41:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2024-06-27 22:41:17,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-27 22:41:17,925 INFO L175 Difference]: Start difference. First operand has 134 places, 104 transitions, 1064 flow. Second operand 11 states and 175 transitions. [2024-06-27 22:41:17,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 140 transitions, 1459 flow [2024-06-27 22:41:17,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 140 transitions, 1421 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 22:41:17,950 INFO L231 Difference]: Finished difference. Result has 139 places, 106 transitions, 1162 flow [2024-06-27 22:41:17,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1162, PETRI_PLACES=139, PETRI_TRANSITIONS=106} [2024-06-27 22:41:17,952 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 102 predicate places. [2024-06-27 22:41:17,952 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 106 transitions, 1162 flow [2024-06-27 22:41:17,952 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:17,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:17,953 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:17,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-06-27 22:41:17,953 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:17,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:17,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1704714794, now seen corresponding path program 2 times [2024-06-27 22:41:17,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:17,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512126258] [2024-06-27 22:41:17,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:17,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:23,819 INFO 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,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:23,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512126258] [2024-06-27 22:41:23,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512126258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:23,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:23,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:41:23,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964690114] [2024-06-27 22:41:23,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:23,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:41:23,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:23,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:41:23,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:41:23,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:23,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 106 transitions, 1162 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:23,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:23,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:23,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:25,314 INFO L124 PetriNetUnfolderBase]: 1200/2433 cut-off events. [2024-06-27 22:41:25,315 INFO L125 PetriNetUnfolderBase]: For 16148/16152 co-relation queries the response was YES. [2024-06-27 22:41:25,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9536 conditions, 2433 events. 1200/2433 cut-off events. For 16148/16152 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15908 event pairs, 612 based on Foata normal form. 10/2441 useless extension candidates. Maximal degree in co-relation 9475. Up to 929 conditions per place. [2024-06-27 22:41:25,329 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 101 selfloop transitions, 51 changer transitions 0/157 dead transitions. [2024-06-27 22:41:25,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 157 transitions, 1661 flow [2024-06-27 22:41:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 22:41:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 22:41:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 194 transitions. [2024-06-27 22:41:25,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46190476190476193 [2024-06-27 22:41:25,331 INFO L175 Difference]: Start difference. First operand has 139 places, 106 transitions, 1162 flow. Second operand 12 states and 194 transitions. [2024-06-27 22:41:25,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 157 transitions, 1661 flow [2024-06-27 22:41:25,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 157 transitions, 1547 flow, removed 13 selfloop flow, removed 9 redundant places. [2024-06-27 22:41:25,359 INFO L231 Difference]: Finished difference. Result has 142 places, 106 transitions, 1155 flow [2024-06-27 22:41:25,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1155, PETRI_PLACES=142, PETRI_TRANSITIONS=106} [2024-06-27 22:41:25,359 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 105 predicate places. [2024-06-27 22:41:25,360 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 106 transitions, 1155 flow [2024-06-27 22:41:25,360 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:25,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:25,360 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,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-06-27 22:41:25,360 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:25,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:25,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1439017514, now seen corresponding path program 3 times [2024-06-27 22:41:25,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:25,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455329930] [2024-06-27 22:41:25,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:25,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:30,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:30,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:30,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455329930] [2024-06-27 22:41:30,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455329930] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:30,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:30,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-27 22:41:30,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720585014] [2024-06-27 22:41:30,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:30,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 22:41:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:30,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 22:41:30,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-06-27 22:41:30,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:30,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 106 transitions, 1155 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:30,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:30,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:30,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:32,605 INFO L124 PetriNetUnfolderBase]: 1289/2657 cut-off events. [2024-06-27 22:41:32,605 INFO L125 PetriNetUnfolderBase]: For 18450/18450 co-relation queries the response was YES. [2024-06-27 22:41:32,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10172 conditions, 2657 events. 1289/2657 cut-off events. For 18450/18450 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 18084 event pairs, 822 based on Foata normal form. 6/2661 useless extension candidates. Maximal degree in co-relation 10109. Up to 1837 conditions per place. [2024-06-27 22:41:32,620 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 117 selfloop transitions, 33 changer transitions 0/155 dead transitions. [2024-06-27 22:41:32,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 155 transitions, 1705 flow [2024-06-27 22:41:32,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-06-27 22:41:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-06-27 22:41:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 210 transitions. [2024-06-27 22:41:32,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2024-06-27 22:41:32,622 INFO L175 Difference]: Start difference. First operand has 142 places, 106 transitions, 1155 flow. Second operand 14 states and 210 transitions. [2024-06-27 22:41:32,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 155 transitions, 1705 flow [2024-06-27 22:41:32,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 155 transitions, 1601 flow, removed 5 selfloop flow, removed 9 redundant places. [2024-06-27 22:41:32,653 INFO L231 Difference]: Finished difference. Result has 147 places, 106 transitions, 1121 flow [2024-06-27 22:41:32,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1051, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1121, PETRI_PLACES=147, PETRI_TRANSITIONS=106} [2024-06-27 22:41:32,653 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 110 predicate places. [2024-06-27 22:41:32,653 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 106 transitions, 1121 flow [2024-06-27 22:41:32,654 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:32,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:32,654 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:32,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-06-27 22:41:32,654 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:32,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1024540936, now seen corresponding path program 4 times [2024-06-27 22:41:32,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:32,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272224155] [2024-06-27 22:41:32,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:32,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:37,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:37,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:37,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272224155] [2024-06-27 22:41:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272224155] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:37,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:37,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:41:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596039078] [2024-06-27 22:41:37,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:37,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:41:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:41:37,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:41:37,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:37,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 106 transitions, 1121 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:37,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:37,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:37,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:38,830 INFO L124 PetriNetUnfolderBase]: 1260/2578 cut-off events. [2024-06-27 22:41:38,831 INFO L125 PetriNetUnfolderBase]: For 16422/16437 co-relation queries the response was YES. [2024-06-27 22:41:38,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9733 conditions, 2578 events. 1260/2578 cut-off events. For 16422/16437 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 17313 event pairs, 606 based on Foata normal form. 16/2590 useless extension candidates. Maximal degree in co-relation 9669. Up to 1753 conditions per place. [2024-06-27 22:41:38,846 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 91 selfloop transitions, 42 changer transitions 0/138 dead transitions. [2024-06-27 22:41:38,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 138 transitions, 1538 flow [2024-06-27 22:41:38,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 22:41:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 22:41:38,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2024-06-27 22:41:38,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44285714285714284 [2024-06-27 22:41:38,848 INFO L175 Difference]: Start difference. First operand has 147 places, 106 transitions, 1121 flow. Second operand 10 states and 155 transitions. [2024-06-27 22:41:38,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 138 transitions, 1538 flow [2024-06-27 22:41:38,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 138 transitions, 1453 flow, removed 2 selfloop flow, removed 13 redundant places. [2024-06-27 22:41:38,881 INFO L231 Difference]: Finished difference. Result has 145 places, 109 transitions, 1193 flow [2024-06-27 22:41:38,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1193, PETRI_PLACES=145, PETRI_TRANSITIONS=109} [2024-06-27 22:41:38,882 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 108 predicate places. [2024-06-27 22:41:38,882 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 109 transitions, 1193 flow [2024-06-27 22:41:38,882 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:38,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:38,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:38,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-06-27 22:41:38,883 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:38,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:38,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1653199789, now seen corresponding path program 1 times [2024-06-27 22:41:38,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:38,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176802214] [2024-06-27 22:41:38,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:38,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:44,411 INFO 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:44,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:44,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176802214] [2024-06-27 22:41:44,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176802214] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:44,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:44,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 22:41:44,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884043769] [2024-06-27 22:41:44,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:44,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 22:41:44,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:44,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 22:41:44,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-06-27 22:41:44,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-06-27 22:41:44,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 109 transitions, 1193 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:44,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:44,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-06-27 22:41:44,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:46,222 INFO L124 PetriNetUnfolderBase]: 1253/2568 cut-off events. [2024-06-27 22:41:46,223 INFO L125 PetriNetUnfolderBase]: For 15054/15058 co-relation queries the response was YES. [2024-06-27 22:41:46,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9575 conditions, 2568 events. 1253/2568 cut-off events. For 15054/15058 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 17257 event pairs, 731 based on Foata normal form. 10/2576 useless extension candidates. Maximal degree in co-relation 9510. Up to 1859 conditions per place. [2024-06-27 22:41:46,238 INFO L140 encePairwiseOnDemand]: 26/35 looper letters, 95 selfloop transitions, 50 changer transitions 0/150 dead transitions. [2024-06-27 22:41:46,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 150 transitions, 1566 flow [2024-06-27 22:41:46,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 22:41:46,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 22:41:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 200 transitions. [2024-06-27 22:41:46,240 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43956043956043955 [2024-06-27 22:41:46,240 INFO L175 Difference]: Start difference. First operand has 145 places, 109 transitions, 1193 flow. Second operand 13 states and 200 transitions. [2024-06-27 22:41:46,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 150 transitions, 1566 flow [2024-06-27 22:41:46,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 150 transitions, 1386 flow, removed 16 selfloop flow, removed 24 redundant places. [2024-06-27 22:41:46,263 INFO L231 Difference]: Finished difference. Result has 132 places, 108 transitions, 1059 flow [2024-06-27 22:41:46,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1059, PETRI_PLACES=132, PETRI_TRANSITIONS=108} [2024-06-27 22:41:46,263 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 95 predicate places. [2024-06-27 22:41:46,263 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 108 transitions, 1059 flow [2024-06-27 22:41:46,263 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:46,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:46,264 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:41:46,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-06-27 22:41:46,264 INFO L420 AbstractCegarLoop]: === Iteration 34 === 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:46,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:46,265 INFO L85 PathProgramCache]: Analyzing trace with hash -815043185, now seen corresponding path program 1 times [2024-06-27 22:41:46,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:46,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101987439] [2024-06-27 22:41:46,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:46,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:41:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:41:46,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:41:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101987439] [2024-06-27 22:41:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101987439] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 22:41:46,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 22:41:46,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 22:41:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191909131] [2024-06-27 22:41:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 22:41:46,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 22:41:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:41:46,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 22:41:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 22:41:46,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-06-27 22:41:46,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 108 transitions, 1059 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:41:46,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:41:46,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-06-27 22:41:46,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:41:46,674 INFO L124 PetriNetUnfolderBase]: 760/1646 cut-off events. [2024-06-27 22:41:46,674 INFO L125 PetriNetUnfolderBase]: For 4876/4887 co-relation queries the response was YES. [2024-06-27 22:41:46,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5477 conditions, 1646 events. 760/1646 cut-off events. For 4876/4887 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10354 event pairs, 105 based on Foata normal form. 118/1714 useless extension candidates. Maximal degree in co-relation 5432. Up to 507 conditions per place. [2024-06-27 22:41:46,682 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 56 selfloop transitions, 27 changer transitions 0/112 dead transitions. [2024-06-27 22:41:46,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 112 transitions, 1188 flow [2024-06-27 22:41:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 22:41:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 22:41:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2024-06-27 22:41:46,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2024-06-27 22:41:46,683 INFO L175 Difference]: Start difference. First operand has 132 places, 108 transitions, 1059 flow. Second operand 5 states and 95 transitions. [2024-06-27 22:41:46,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 112 transitions, 1188 flow [2024-06-27 22:41:46,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 112 transitions, 984 flow, removed 21 selfloop flow, removed 20 redundant places. [2024-06-27 22:41:46,693 INFO L231 Difference]: Finished difference. Result has 117 places, 99 transitions, 864 flow [2024-06-27 22:41:46,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=864, PETRI_PLACES=117, PETRI_TRANSITIONS=99} [2024-06-27 22:41:46,694 INFO L281 CegarLoopForPetriNet]: 37 programPoint places, 80 predicate places. [2024-06-27 22:41:46,694 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 99 transitions, 864 flow [2024-06-27 22:41:46,694 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:41:46,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:41:46,694 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:41:46,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-06-27 22:41:46,695 INFO L420 AbstractCegarLoop]: === Iteration 35 === 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:46,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:41:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1341139129, now seen corresponding path program 1 times [2024-06-27 22:41:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:41:46,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787212578] [2024-06-27 22:41:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:41:46,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:41:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:41:46,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:41:46,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:41:46,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:41:46,800 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:41:46,801 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 22:41:46,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-27 22:41:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-27 22:41:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 22:41:46,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-27 22:41:46,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-06-27 22:41:46,803 INFO L445 BasicCegarLoop]: Path program histogram: [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:41:46,807 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:41:46,807 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:41:46,849 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:41:46,850 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:41:46,852 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:41:46,859 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: Invalid location (Location is no CACSLLocation) [2024-06-27 22:41:46,867 WARN L945 BoogieBacktranslator]: Unfinished Backtranslation: The program execution was not completely translated back. [2024-06-27 22:41:46,888 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:41:46,888 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:41:46,889 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:41:46 BasicIcfg [2024-06-27 22:41:46,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:41:46,889 INFO L158 Benchmark]: Toolchain (without parser) took 187643.27ms. Allocated memory was 159.4MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 84.0MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 418.3MB. Max. memory is 16.1GB. [2024-06-27 22:41:46,889 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:41:46,890 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:41:46,890 INFO L158 Benchmark]: CACSL2BoogieTranslator took 577.70ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 113.2MB in the end (delta: -29.4MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-06-27 22:41:46,890 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.49ms. Allocated memory is still 159.4MB. Free memory was 113.2MB in the beginning and 106.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-27 22:41:46,890 INFO L158 Benchmark]: Boogie Preprocessor took 104.00ms. Allocated memory is still 159.4MB. Free memory was 106.9MB in the beginning and 102.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 22:41:46,891 INFO L158 Benchmark]: RCFGBuilder took 960.44ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 102.1MB in the beginning and 160.2MB in the end (delta: -58.0MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2024-06-27 22:41:46,891 INFO L158 Benchmark]: TraceAbstraction took 185919.89ms. Allocated memory was 232.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 159.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 419.5MB. Max. memory is 16.1GB. [2024-06-27 22:41:46,892 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 159.4MB. Free memory is still 87.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 577.70ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 113.2MB in the end (delta: -29.4MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.49ms. Allocated memory is still 159.4MB. Free memory was 113.2MB in the beginning and 106.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.00ms. Allocated memory is still 159.4MB. Free memory was 106.9MB in the beginning and 102.1MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 960.44ms. Allocated memory was 159.4MB in the beginning and 232.8MB in the end (delta: 73.4MB). Free memory was 102.1MB in the beginning and 160.2MB in the end (delta: -58.0MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * TraceAbstraction took 185919.89ms. Allocated memory was 232.8MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 159.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 419.5MB. 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; [L813] 0 pthread_t t1921; [L814] 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, t1921=-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] FCALL, FORK 0 pthread_create(&t1921, ((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, t1921=-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 pthread_t t1922; 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, t1921=-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}] [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$$choice1) >= 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$$choice1) - (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}, __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, t1921=-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] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] EXPR 1 \read(y) [L759] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L759] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L760] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L761] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L762] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L763] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L764] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L765] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L766] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L767] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L768] EXPR 1 \read(y) [L768] 1 __unbuffered_p0_EAX = y [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] EXPR 1 \read(y) [L769] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L769] 1 y = y$flush_delayed ? y$mem_tmp : y [L770] 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}] [L773] 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}] [L816] FCALL, FORK 0 pthread_create(&t1922, ((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, t1921=-1, t1922=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 //@ 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$$choice1) >= 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$$choice1) - (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))); [L817] 0 y [L817] 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, t1921=-1, t1922=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}] [L778] 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}] [L785] 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}] [L788] 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}] [L791] 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) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] EXPR 2 \read(y) [L791] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L791] 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) [L791] 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) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 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 [L794] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L795] 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}] [L798] 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}] [L817] 0 y [L817] 0 y [L818] 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, t1921=-1, t1922=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}] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 \read(y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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, t1921=-1, t1922=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}] [L829] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L830] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L830] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L831] 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, t1921=-1, t1922=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}] [L833] 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: 816]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 817]: 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 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: 814]: 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: 185.7s, OverallIterations: 35, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 36.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1802 SdHoareTripleChecker+Valid, 12.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1746 mSDsluCounter, 252 SdHoareTripleChecker+Invalid, 11.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 641 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8556 IncrementalHoareTripleChecker+Invalid, 9197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 641 mSolverCounterUnsat, 110 mSDtfsCounter, 8556 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 324 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 32.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1644occurred in iteration=22, InterpolantAutomatonStates: 298, 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.4s SatisfiabilityAnalysisTime, 147.2s InterpolantComputationTime, 528 NumberOfCodeBlocks, 528 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 468 ConstructedInterpolants, 0 QuantifiedInterpolants, 57035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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:41:47,046 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