./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix039.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/mix039.oepc.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/mix039.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 23:47:09,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 23:47:09,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 23:47:09,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 23:47:09,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 23:47:09,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 23:47:09,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 23:47:09,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 23:47:09,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 23:47:09,225 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 23:47:09,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 23:47:09,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 23:47:09,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 23:47:09,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 23:47:09,226 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 23:47:09,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 23:47:09,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 23:47:09,227 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 23:47:09,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 23:47:09,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 23:47:09,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 23:47:09,228 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 23:47:09,228 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 23:47:09,228 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 23:47:09,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 23:47:09,229 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 23:47:09,229 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 23:47:09,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 23:47:09,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 23:47:09,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 23:47:09,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 23:47:09,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 23:47:09,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:47:09,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 23:47:09,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 23:47:09,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 23:47:09,230 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 23:47:09,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 23:47:09,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 23:47:09,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 23:47:09,231 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 23:47:09,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 23:47:09,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 23:47:09,232 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-27 23:47:09,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 23:47:09,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 23:47:09,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 23:47:09,439 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 23:47:09,441 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 23:47:09,442 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/mix039.oepc.yml/witness.yml [2024-06-27 23:47:09,555 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 23:47:09,563 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 23:47:09,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2024-06-27 23:47:10,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 23:47:10,812 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 23:47:10,812 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix039.oepc.i [2024-06-27 23:47:10,824 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0093894c/bcd52782796a4f4eab8ca067121af08a/FLAG8bbf529e4 [2024-06-27 23:47:10,839 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0093894c/bcd52782796a4f4eab8ca067121af08a [2024-06-27 23:47:10,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 23:47:10,840 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 23:47:10,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 23:47:10,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 23:47:10,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 23:47:10,846 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:47:09" (1/2) ... [2024-06-27 23:47:10,847 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2981959 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:47:10, skipping insertion in model container [2024-06-27 23:47:10,847 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:47:09" (1/2) ... [2024-06-27 23:47:10,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@701797b7 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 11:47:10, skipping insertion in model container [2024-06-27 23:47:10,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:47:10" (2/2) ... [2024-06-27 23:47:10,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2981959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:10, skipping insertion in model container [2024-06-27 23:47:10,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 11:47:10" (2/2) ... [2024-06-27 23:47:10,851 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 23:47:10,878 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 23:47:10,878 INFO L97 edCorrectnessWitness]: Location invariant before [L879-L879] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:47:10,879 INFO L97 edCorrectnessWitness]: Location invariant before [L874-L874] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:47:10,879 INFO L97 edCorrectnessWitness]: Location invariant before [L878-L878] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:47:10,879 INFO L97 edCorrectnessWitness]: Location invariant before [L876-L876] ! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p0_EAX) + (long long )x >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )__unbuffered_p3_EAX) + (long long )a >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b >= 0LL) && (0LL - (long long )__unbuffered_p3_EBX) + (long long )b$mem_tmp >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$flush_delayed) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$r_buff0_thd1 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff0_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd0) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff1 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd2) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd3) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$r_buff1_thd4) + (long long )b$w_buff0_used >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0 >= 0LL) && (0LL - (long long )b$read_delayed) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff0_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$r_buff1_thd1) + (long long )b$w_buff0_used >= 0LL) && (1LL - (long long )b$w_buff0) + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_cnt + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p2_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EAX + (long long )b$w_buff0_used >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0 >= 0LL) && (long long )__unbuffered_p3_EBX + (long long )b$w_buff0_used >= 0LL) && (long long )a + (long long )b$r_buff0_thd1 >= 0LL) && (long long )a + (long long )b$w_buff0 >= 0LL) && (long long )a + (long long )b$w_buff0_used >= 0LL) && (long long )b + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b + (long long )b$w_buff0 >= 0LL) && (long long )b + (long long )b$w_buff0_used >= 0LL) && (long long )b$flush_delayed + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$flush_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$mem_tmp + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0 >= 0LL) && (long long )b$mem_tmp + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$r_buff0_thd1 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff0_thd1 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )x >= 0LL) && (long long )b$r_buff0_thd1 + (long long )y >= 0LL) && (long long )b$r_buff0_thd1 + (long long )z >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice0 >= 0LL) && (long long )b$r_buff0_thd1 + (long long )weak$$choice2 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd1 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd2 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd3 + (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff1_thd4 + (long long )b$w_buff0_used >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0 >= 0LL) && (long long )b$read_delayed + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0 + (long long )x >= 0LL) && (long long )b$w_buff0 + (long long )y >= 0LL) && (long long )b$w_buff0 + (long long )z >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0 + (long long )weak$$choice2 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0_used + (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used + (long long )main$tmp_guard1 >= 0LL) && (long long )b$w_buff0_used + (long long )x >= 0LL) && (long long )b$w_buff0_used + (long long )y >= 0LL) && (long long )b$w_buff0_used + (long long )z >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice0 >= 0LL) && (long long )b$w_buff0_used + (long long )weak$$choice2 >= 0LL) && (1LL + (long long )b$w_buff0_used) - (long long )b$w_buff1 >= 0LL) && (long long )__unbuffered_p3_EBX - (long long )b$mem_tmp >= 0LL) && (long long )b - (long long )b$mem_tmp >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff0_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd2 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd3 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$r_buff1_thd4 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$read_delayed >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff0_used >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff0_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1 >= 0LL) && (long long )b$r_buff1_thd1 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff0_used >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1 >= 0LL) && (long long )b$w_buff0 - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff0_used - (long long )b$w_buff1_used >= 0LL) && (long long )b$w_buff1 - (long long )b$w_buff1_used >= 0LL) [2024-06-27 23:47:10,880 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 23:47:10,880 INFO L106 edCorrectnessWitness]: ghost_update [L872-L872] multithreaded = 1; [2024-06-27 23:47:10,920 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 23:47:11,199 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:47:11,219 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 23:47:11,398 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 23:47:11,426 INFO L206 MainTranslator]: Completed translation [2024-06-27 23:47:11,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11 WrapperNode [2024-06-27 23:47:11,426 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 23:47:11,427 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 23:47:11,427 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 23:47:11,427 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 23:47:11,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,499 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2024-06-27 23:47:11,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 23:47:11,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 23:47:11,501 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 23:47:11,501 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 23:47:11,510 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,557 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 23:47:11,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,592 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 23:47:11,593 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 23:47:11,593 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 23:47:11,594 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 23:47:11,594 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (1/1) ... [2024-06-27 23:47:11,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 23:47:11,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 23:47:11,617 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 23:47:11,636 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 23:47:11,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 23:47:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 23:47:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-27 23:47:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-27 23:47:11,649 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-27 23:47:11,649 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-27 23:47:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-06-27 23:47:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-06-27 23:47:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2024-06-27 23:47:11,650 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2024-06-27 23:47:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 23:47:11,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 23:47:11,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 23:47:11,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 23:47:11,652 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 23:47:11,862 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 23:47:11,863 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 23:47:12,439 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 23:47:12,439 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 23:47:12,634 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 23:47:12,635 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-27 23:47:12,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:47:12 BoogieIcfgContainer [2024-06-27 23:47:12,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 23:47:12,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 23:47:12,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 23:47:12,640 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 23:47:12,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 11:47:09" (1/4) ... [2024-06-27 23:47:12,641 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb749ab and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 11:47:12, skipping insertion in model container [2024-06-27 23:47:12,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 11:47:10" (2/4) ... [2024-06-27 23:47:12,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb749ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:47:12, skipping insertion in model container [2024-06-27 23:47:12,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 11:47:11" (3/4) ... [2024-06-27 23:47:12,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bb749ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 11:47:12, skipping insertion in model container [2024-06-27 23:47:12,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 11:47:12" (4/4) ... [2024-06-27 23:47:12,645 INFO L112 eAbstractionObserver]: Analyzing ICFG mix039.oepc.i [2024-06-27 23:47:12,658 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 23:47:12,658 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-06-27 23:47:12,658 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 23:47:12,719 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 23:47:12,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:47:12,788 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2024-06-27 23:47:12,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:47:12,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 49 events. 0/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-27 23:47:12,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 53 transitions, 122 flow [2024-06-27 23:47:12,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 43 transitions, 98 flow [2024-06-27 23:47:12,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 23:47:12,811 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;@2452a643, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 23:47:12,812 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-06-27 23:47:12,843 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 23:47:12,844 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 23:47:12,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 23:47:12,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:12,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 23:47:12,845 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:12,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:12,850 INFO L85 PathProgramCache]: Analyzing trace with hash 407834173, now seen corresponding path program 1 times [2024-06-27 23:47:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:12,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868446258] [2024-06-27 23:47:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:14,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:47:14,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868446258] [2024-06-27 23:47:14,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868446258] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:14,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:14,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 23:47:14,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664618147] [2024-06-27 23:47:14,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:14,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 23:47:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:14,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 23:47:14,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 23:47:14,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:47:14,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:14,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:14,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:47:14,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:16,594 INFO L124 PetriNetUnfolderBase]: 10978/15306 cut-off events. [2024-06-27 23:47:16,594 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-06-27 23:47:16,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30549 conditions, 15306 events. 10978/15306 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 84523 event pairs, 8484 based on Foata normal form. 1/14972 useless extension candidates. Maximal degree in co-relation 30536. Up to 14854 conditions per place. [2024-06-27 23:47:16,677 INFO L140 encePairwiseOnDemand]: 44/53 looper letters, 44 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-27 23:47:16,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 57 transitions, 233 flow [2024-06-27 23:47:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 23:47:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 23:47:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-06-27 23:47:16,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6163522012578616 [2024-06-27 23:47:16,688 INFO L175 Difference]: Start difference. First operand has 56 places, 43 transitions, 98 flow. Second operand 3 states and 98 transitions. [2024-06-27 23:47:16,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 57 transitions, 233 flow [2024-06-27 23:47:16,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 226 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 23:47:16,696 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 133 flow [2024-06-27 23:47:16,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2024-06-27 23:47:16,701 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, -1 predicate places. [2024-06-27 23:47:16,701 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 133 flow [2024-06-27 23:47:16,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:16,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:16,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:16,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 23:47:16,702 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:16,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:16,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1086673948, now seen corresponding path program 1 times [2024-06-27 23:47:16,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:16,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835196362] [2024-06-27 23:47:16,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:16,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:18,121 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 23:47:18,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:18,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835196362] [2024-06-27 23:47:18,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835196362] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:18,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:18,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 23:47:18,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272483274] [2024-06-27 23:47:18,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:18,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 23:47:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:18,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 23:47:18,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 23:47:18,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 53 [2024-06-27 23:47:18,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:18,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:18,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 53 [2024-06-27 23:47:18,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:20,106 INFO L124 PetriNetUnfolderBase]: 10968/15292 cut-off events. [2024-06-27 23:47:20,106 INFO L125 PetriNetUnfolderBase]: For 2797/2797 co-relation queries the response was YES. [2024-06-27 23:47:20,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34380 conditions, 15292 events. 10968/15292 cut-off events. For 2797/2797 co-relation queries the response was YES. Maximal size of possible extension queue 527. Compared 84396 event pairs, 7575 based on Foata normal form. 4/15143 useless extension candidates. Maximal degree in co-relation 34368. Up to 14819 conditions per place. [2024-06-27 23:47:20,167 INFO L140 encePairwiseOnDemand]: 43/53 looper letters, 54 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2024-06-27 23:47:20,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 71 transitions, 325 flow [2024-06-27 23:47:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 23:47:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 23:47:20,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-06-27 23:47:20,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5990566037735849 [2024-06-27 23:47:20,169 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 133 flow. Second operand 4 states and 127 transitions. [2024-06-27 23:47:20,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 71 transitions, 325 flow [2024-06-27 23:47:20,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 71 transitions, 320 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 23:47:20,171 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 181 flow [2024-06-27 23:47:20,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2024-06-27 23:47:20,172 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2024-06-27 23:47:20,172 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 181 flow [2024-06-27 23:47:20,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:20,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:20,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:20,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 23:47:20,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:20,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:20,174 INFO L85 PathProgramCache]: Analyzing trace with hash 616670715, now seen corresponding path program 1 times [2024-06-27 23:47:20,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:20,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418239367] [2024-06-27 23:47:20,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:20,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:21,794 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 23:47:21,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:21,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418239367] [2024-06-27 23:47:21,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418239367] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:21,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:21,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:47:21,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616981755] [2024-06-27 23:47:21,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:21,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:47:21,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:21,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:47:21,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:47:21,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:47:21,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 181 flow. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:21,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:21,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:47:21,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:24,123 INFO L124 PetriNetUnfolderBase]: 13301/18473 cut-off events. [2024-06-27 23:47:24,124 INFO L125 PetriNetUnfolderBase]: For 9253/9253 co-relation queries the response was YES. [2024-06-27 23:47:24,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45792 conditions, 18473 events. 13301/18473 cut-off events. For 9253/9253 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 102464 event pairs, 7801 based on Foata normal form. 4/18294 useless extension candidates. Maximal degree in co-relation 45778. Up to 17880 conditions per place. [2024-06-27 23:47:24,213 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 75 selfloop transitions, 17 changer transitions 0/99 dead transitions. [2024-06-27 23:47:24,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 99 transitions, 512 flow [2024-06-27 23:47:24,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:47:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:47:24,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2024-06-27 23:47:24,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5660377358490566 [2024-06-27 23:47:24,215 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 181 flow. Second operand 6 states and 180 transitions. [2024-06-27 23:47:24,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 99 transitions, 512 flow [2024-06-27 23:47:24,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 99 transitions, 484 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 23:47:24,219 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 258 flow [2024-06-27 23:47:24,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-06-27 23:47:24,221 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 7 predicate places. [2024-06-27 23:47:24,221 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 258 flow [2024-06-27 23:47:24,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:24,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:24,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:24,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 23:47:24,222 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:24,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash 216202615, now seen corresponding path program 1 times [2024-06-27 23:47:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489616066] [2024-06-27 23:47:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:26,210 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 23:47:26,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:26,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489616066] [2024-06-27 23:47:26,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489616066] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:26,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:26,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:47:26,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976162638] [2024-06-27 23:47:26,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:26,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:47:26,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:26,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:47:26,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:47:26,341 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 53 [2024-06-27 23:47:26,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:26,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:26,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 53 [2024-06-27 23:47:26,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:28,691 INFO L124 PetriNetUnfolderBase]: 13285/18453 cut-off events. [2024-06-27 23:47:28,692 INFO L125 PetriNetUnfolderBase]: For 18739/18739 co-relation queries the response was YES. [2024-06-27 23:47:28,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50882 conditions, 18453 events. 13285/18453 cut-off events. For 18739/18739 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 102075 event pairs, 6762 based on Foata normal form. 8/18278 useless extension candidates. Maximal degree in co-relation 50866. Up to 17814 conditions per place. [2024-06-27 23:47:28,786 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 82 selfloop transitions, 20 changer transitions 0/109 dead transitions. [2024-06-27 23:47:28,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 602 flow [2024-06-27 23:47:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:47:28,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:47:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 204 transitions. [2024-06-27 23:47:28,788 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5498652291105122 [2024-06-27 23:47:28,788 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 258 flow. Second operand 7 states and 204 transitions. [2024-06-27 23:47:28,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 602 flow [2024-06-27 23:47:28,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 563 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-27 23:47:28,794 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 291 flow [2024-06-27 23:47:28,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=291, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-06-27 23:47:28,795 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 10 predicate places. [2024-06-27 23:47:28,795 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 291 flow [2024-06-27 23:47:28,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:28,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:28,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:28,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 23:47:28,796 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:28,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:28,796 INFO L85 PathProgramCache]: Analyzing trace with hash 675725916, now seen corresponding path program 1 times [2024-06-27 23:47:28,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:28,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562197631] [2024-06-27 23:47:28,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:28,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:28,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:30,632 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 23:47:30,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:30,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562197631] [2024-06-27 23:47:30,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562197631] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:30,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:30,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 23:47:30,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403902538] [2024-06-27 23:47:30,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:30,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 23:47:30,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:30,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 23:47:30,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 23:47:30,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:47:30,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 291 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:30,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:30,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:47:30,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:32,856 INFO L124 PetriNetUnfolderBase]: 13276/18469 cut-off events. [2024-06-27 23:47:32,856 INFO L125 PetriNetUnfolderBase]: For 29272/29272 co-relation queries the response was YES. [2024-06-27 23:47:32,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54459 conditions, 18469 events. 13276/18469 cut-off events. For 29272/29272 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 102505 event pairs, 7377 based on Foata normal form. 3/18289 useless extension candidates. Maximal degree in co-relation 54441. Up to 17892 conditions per place. [2024-06-27 23:47:32,932 INFO L140 encePairwiseOnDemand]: 42/53 looper letters, 65 selfloop transitions, 12 changer transitions 0/83 dead transitions. [2024-06-27 23:47:32,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 83 transitions, 524 flow [2024-06-27 23:47:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:47:32,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:47:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 137 transitions. [2024-06-27 23:47:32,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4308176100628931 [2024-06-27 23:47:32,934 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 291 flow. Second operand 6 states and 137 transitions. [2024-06-27 23:47:32,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 83 transitions, 524 flow [2024-06-27 23:47:32,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 468 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-27 23:47:32,939 INFO L231 Difference]: Finished difference. Result has 68 places, 67 transitions, 320 flow [2024-06-27 23:47:32,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2024-06-27 23:47:32,940 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 12 predicate places. [2024-06-27 23:47:32,940 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 320 flow [2024-06-27 23:47:32,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:32,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:32,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:32,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 23:47:32,941 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:32,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:32,941 INFO L85 PathProgramCache]: Analyzing trace with hash -527331636, now seen corresponding path program 1 times [2024-06-27 23:47:32,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:32,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27097916] [2024-06-27 23:47:32,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:32,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:34,930 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 23:47:34,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:34,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27097916] [2024-06-27 23:47:34,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27097916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:34,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:34,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:47:34,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954143624] [2024-06-27 23:47:34,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:34,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:47:34,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:34,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:47:34,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:47:35,022 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:47:35,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:35,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:35,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:47:35,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:37,199 INFO L124 PetriNetUnfolderBase]: 13342/18684 cut-off events. [2024-06-27 23:47:37,199 INFO L125 PetriNetUnfolderBase]: For 42649/42649 co-relation queries the response was YES. [2024-06-27 23:47:37,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59025 conditions, 18684 events. 13342/18684 cut-off events. For 42649/42649 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 104715 event pairs, 6995 based on Foata normal form. 14/18663 useless extension candidates. Maximal degree in co-relation 59004. Up to 17768 conditions per place. [2024-06-27 23:47:37,350 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 83 selfloop transitions, 24 changer transitions 0/113 dead transitions. [2024-06-27 23:47:37,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 113 transitions, 742 flow [2024-06-27 23:47:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:47:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:47:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-27 23:47:37,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46630727762803237 [2024-06-27 23:47:37,352 INFO L175 Difference]: Start difference. First operand has 68 places, 67 transitions, 320 flow. Second operand 7 states and 173 transitions. [2024-06-27 23:47:37,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 113 transitions, 742 flow [2024-06-27 23:47:37,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 113 transitions, 707 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-27 23:47:37,362 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 469 flow [2024-06-27 23:47:37,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=469, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-06-27 23:47:37,364 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 18 predicate places. [2024-06-27 23:47:37,364 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 469 flow [2024-06-27 23:47:37,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:37,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:37,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:37,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 23:47:37,365 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:37,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1497309741, now seen corresponding path program 1 times [2024-06-27 23:47:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:37,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548451231] [2024-06-27 23:47:37,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:37,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:39,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:47:39,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:39,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548451231] [2024-06-27 23:47:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548451231] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:47:39,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141686327] [2024-06-27 23:47:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:39,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:47:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:39,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:47:39,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:47:39,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:47:39,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:39,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:39,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:47:39,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:41,781 INFO L124 PetriNetUnfolderBase]: 13418/18826 cut-off events. [2024-06-27 23:47:41,781 INFO L125 PetriNetUnfolderBase]: For 63100/63110 co-relation queries the response was YES. [2024-06-27 23:47:41,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66538 conditions, 18826 events. 13418/18826 cut-off events. For 63100/63110 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 105322 event pairs, 7055 based on Foata normal form. 11/18804 useless extension candidates. Maximal degree in co-relation 66514. Up to 18034 conditions per place. [2024-06-27 23:47:41,880 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 91 selfloop transitions, 23 changer transitions 0/120 dead transitions. [2024-06-27 23:47:41,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 120 transitions, 899 flow [2024-06-27 23:47:41,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:47:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:47:41,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 154 transitions. [2024-06-27 23:47:41,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48427672955974843 [2024-06-27 23:47:41,882 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 469 flow. Second operand 6 states and 154 transitions. [2024-06-27 23:47:41,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 120 transitions, 899 flow [2024-06-27 23:47:41,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 120 transitions, 870 flow, removed 12 selfloop flow, removed 2 redundant places. [2024-06-27 23:47:41,897 INFO L231 Difference]: Finished difference. Result has 79 places, 93 transitions, 619 flow [2024-06-27 23:47:41,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=619, PETRI_PLACES=79, PETRI_TRANSITIONS=93} [2024-06-27 23:47:41,897 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 23 predicate places. [2024-06-27 23:47:41,897 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 93 transitions, 619 flow [2024-06-27 23:47:41,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:41,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:41,898 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:41,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 23:47:41,898 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:41,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1519860381, now seen corresponding path program 2 times [2024-06-27 23:47:41,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:41,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768995640] [2024-06-27 23:47:41,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:41,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:43,333 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 23:47:43,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:43,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768995640] [2024-06-27 23:47:43,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768995640] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:43,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:43,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:47:43,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926402218] [2024-06-27 23:47:43,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:43,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:47:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:43,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:47:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:47:43,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:47:43,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 93 transitions, 619 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:43,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:43,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:47:43,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:45,654 INFO L124 PetriNetUnfolderBase]: 13409/18812 cut-off events. [2024-06-27 23:47:45,655 INFO L125 PetriNetUnfolderBase]: For 81461/81461 co-relation queries the response was YES. [2024-06-27 23:47:45,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70747 conditions, 18812 events. 13409/18812 cut-off events. For 81461/81461 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 105399 event pairs, 7048 based on Foata normal form. 3/18783 useless extension candidates. Maximal degree in co-relation 70720. Up to 18057 conditions per place. [2024-06-27 23:47:45,773 INFO L140 encePairwiseOnDemand]: 41/53 looper letters, 94 selfloop transitions, 16 changer transitions 0/116 dead transitions. [2024-06-27 23:47:45,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 116 transitions, 899 flow [2024-06-27 23:47:45,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 23:47:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 23:47:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-06-27 23:47:45,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46540880503144655 [2024-06-27 23:47:45,775 INFO L175 Difference]: Start difference. First operand has 79 places, 93 transitions, 619 flow. Second operand 6 states and 148 transitions. [2024-06-27 23:47:45,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 116 transitions, 899 flow [2024-06-27 23:47:45,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 116 transitions, 832 flow, removed 27 selfloop flow, removed 2 redundant places. [2024-06-27 23:47:45,813 INFO L231 Difference]: Finished difference. Result has 83 places, 93 transitions, 595 flow [2024-06-27 23:47:45,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=595, PETRI_PLACES=83, PETRI_TRANSITIONS=93} [2024-06-27 23:47:45,814 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 27 predicate places. [2024-06-27 23:47:45,814 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 93 transitions, 595 flow [2024-06-27 23:47:45,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:45,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:45,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:45,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 23:47:45,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:45,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash 344406399, now seen corresponding path program 3 times [2024-06-27 23:47:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514822690] [2024-06-27 23:47:45,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:45,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:47,542 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 23:47:47,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:47,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514822690] [2024-06-27 23:47:47,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514822690] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:47,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:47,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 23:47:47,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199028584] [2024-06-27 23:47:47,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:47,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 23:47:47,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 23:47:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 23:47:47,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:47:47,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 93 transitions, 595 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:47,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:47,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:47:47,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:50,074 INFO L124 PetriNetUnfolderBase]: 13472/18902 cut-off events. [2024-06-27 23:47:50,075 INFO L125 PetriNetUnfolderBase]: For 92159/92169 co-relation queries the response was YES. [2024-06-27 23:47:50,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72547 conditions, 18902 events. 13472/18902 cut-off events. For 92159/92169 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 105971 event pairs, 7048 based on Foata normal form. 11/18880 useless extension candidates. Maximal degree in co-relation 72518. Up to 18056 conditions per place. [2024-06-27 23:47:50,234 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 93 selfloop transitions, 49 changer transitions 0/148 dead transitions. [2024-06-27 23:47:50,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 148 transitions, 1135 flow [2024-06-27 23:47:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:47:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:47:50,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 177 transitions. [2024-06-27 23:47:50,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477088948787062 [2024-06-27 23:47:50,235 INFO L175 Difference]: Start difference. First operand has 83 places, 93 transitions, 595 flow. Second operand 7 states and 177 transitions. [2024-06-27 23:47:50,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 148 transitions, 1135 flow [2024-06-27 23:47:50,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 148 transitions, 1092 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-06-27 23:47:50,278 INFO L231 Difference]: Finished difference. Result has 88 places, 117 transitions, 891 flow [2024-06-27 23:47:50,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=891, PETRI_PLACES=88, PETRI_TRANSITIONS=117} [2024-06-27 23:47:50,279 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 32 predicate places. [2024-06-27 23:47:50,279 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 117 transitions, 891 flow [2024-06-27 23:47:50,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:50,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:50,279 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:50,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 23:47:50,280 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:50,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash -137011663, now seen corresponding path program 1 times [2024-06-27 23:47:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:50,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997486355] [2024-06-27 23:47:50,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:50,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:51,942 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 23:47:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:51,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997486355] [2024-06-27 23:47:51,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997486355] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:51,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:51,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:47:51,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180699642] [2024-06-27 23:47:51,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:51,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:47:51,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:51,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:47:51,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:47:52,120 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:47:52,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 117 transitions, 891 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:52,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:52,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:47:52,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:54,720 INFO L124 PetriNetUnfolderBase]: 15209/20704 cut-off events. [2024-06-27 23:47:54,721 INFO L125 PetriNetUnfolderBase]: For 131544/131544 co-relation queries the response was YES. [2024-06-27 23:47:54,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85806 conditions, 20704 events. 15209/20704 cut-off events. For 131544/131544 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 109791 event pairs, 7878 based on Foata normal form. 3/20704 useless extension candidates. Maximal degree in co-relation 85774. Up to 20405 conditions per place. [2024-06-27 23:47:54,886 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 129 selfloop transitions, 24 changer transitions 0/158 dead transitions. [2024-06-27 23:47:54,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 158 transitions, 1375 flow [2024-06-27 23:47:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:47:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:47:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2024-06-27 23:47:54,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4501347708894879 [2024-06-27 23:47:54,889 INFO L175 Difference]: Start difference. First operand has 88 places, 117 transitions, 891 flow. Second operand 7 states and 167 transitions. [2024-06-27 23:47:54,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 158 transitions, 1375 flow [2024-06-27 23:47:54,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 158 transitions, 1292 flow, removed 16 selfloop flow, removed 3 redundant places. [2024-06-27 23:47:54,984 INFO L231 Difference]: Finished difference. Result has 93 places, 125 transitions, 957 flow [2024-06-27 23:47:54,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=957, PETRI_PLACES=93, PETRI_TRANSITIONS=125} [2024-06-27 23:47:54,986 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 37 predicate places. [2024-06-27 23:47:54,986 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 125 transitions, 957 flow [2024-06-27 23:47:54,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:54,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:54,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:54,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 23:47:54,987 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:54,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash -757944127, now seen corresponding path program 2 times [2024-06-27 23:47:54,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:54,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239794536] [2024-06-27 23:47:54,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:54,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:47:56,612 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 23:47:56,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:47:56,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239794536] [2024-06-27 23:47:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239794536] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:47:56,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:47:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:47:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948917931] [2024-06-27 23:47:56,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:47:56,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:47:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:47:56,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:47:56,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:47:56,704 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:47:56,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 125 transitions, 957 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:56,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:47:56,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:47:56,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:47:59,205 INFO L124 PetriNetUnfolderBase]: 15262/20780 cut-off events. [2024-06-27 23:47:59,206 INFO L125 PetriNetUnfolderBase]: For 160419/160429 co-relation queries the response was YES. [2024-06-27 23:47:59,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90943 conditions, 20780 events. 15262/20780 cut-off events. For 160419/160429 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 110488 event pairs, 7892 based on Foata normal form. 11/20787 useless extension candidates. Maximal degree in co-relation 90909. Up to 20360 conditions per place. [2024-06-27 23:47:59,406 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 113 selfloop transitions, 51 changer transitions 0/169 dead transitions. [2024-06-27 23:47:59,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 169 transitions, 1577 flow [2024-06-27 23:47:59,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:47:59,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:47:59,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 173 transitions. [2024-06-27 23:47:59,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46630727762803237 [2024-06-27 23:47:59,409 INFO L175 Difference]: Start difference. First operand has 93 places, 125 transitions, 957 flow. Second operand 7 states and 173 transitions. [2024-06-27 23:47:59,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 169 transitions, 1577 flow [2024-06-27 23:47:59,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 169 transitions, 1489 flow, removed 21 selfloop flow, removed 4 redundant places. [2024-06-27 23:47:59,492 INFO L231 Difference]: Finished difference. Result has 96 places, 133 transitions, 1108 flow [2024-06-27 23:47:59,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=869, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1108, PETRI_PLACES=96, PETRI_TRANSITIONS=133} [2024-06-27 23:47:59,493 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 40 predicate places. [2024-06-27 23:47:59,493 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 133 transitions, 1108 flow [2024-06-27 23:47:59,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:47:59,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:47:59,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:47:59,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 23:47:59,494 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:47:59,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:47:59,494 INFO L85 PathProgramCache]: Analyzing trace with hash -757943941, now seen corresponding path program 1 times [2024-06-27 23:47:59,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:47:59,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134486331] [2024-06-27 23:47:59,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:47:59,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:47:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:48:01,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:48:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:48:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134486331] [2024-06-27 23:48:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134486331] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:48:01,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:48:01,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:48:01,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163594306] [2024-06-27 23:48:01,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:48:01,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:48:01,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:48:01,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:48:01,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:48:01,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:48:01,372 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 133 transitions, 1108 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:01,372 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:48:01,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:48:01,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:48:04,005 INFO L124 PetriNetUnfolderBase]: 13759/19294 cut-off events. [2024-06-27 23:48:04,005 INFO L125 PetriNetUnfolderBase]: For 173446/173450 co-relation queries the response was YES. [2024-06-27 23:48:04,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87973 conditions, 19294 events. 13759/19294 cut-off events. For 173446/173450 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 107784 event pairs, 6459 based on Foata normal form. 6/19258 useless extension candidates. Maximal degree in co-relation 87938. Up to 18212 conditions per place. [2024-06-27 23:48:04,132 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 144 selfloop transitions, 50 changer transitions 0/200 dead transitions. [2024-06-27 23:48:04,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 200 transitions, 2046 flow [2024-06-27 23:48:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:48:04,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:48:04,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 188 transitions. [2024-06-27 23:48:04,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5067385444743935 [2024-06-27 23:48:04,142 INFO L175 Difference]: Start difference. First operand has 96 places, 133 transitions, 1108 flow. Second operand 7 states and 188 transitions. [2024-06-27 23:48:04,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 200 transitions, 2046 flow [2024-06-27 23:48:04,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 200 transitions, 1960 flow, removed 27 selfloop flow, removed 3 redundant places. [2024-06-27 23:48:04,225 INFO L231 Difference]: Finished difference. Result has 103 places, 156 transitions, 1428 flow [2024-06-27 23:48:04,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1428, PETRI_PLACES=103, PETRI_TRANSITIONS=156} [2024-06-27 23:48:04,227 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 47 predicate places. [2024-06-27 23:48:04,227 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 156 transitions, 1428 flow [2024-06-27 23:48:04,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:04,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:48:04,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:48:04,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 23:48:04,228 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:48:04,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:48:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -128729847, now seen corresponding path program 2 times [2024-06-27 23:48:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:48:04,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414605277] [2024-06-27 23:48:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:48:04,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:48:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:48:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 23:48:05,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:48:05,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414605277] [2024-06-27 23:48:05,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414605277] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:48:05,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:48:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:48:05,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397922697] [2024-06-27 23:48:05,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:48:05,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:48:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:48:05,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:48:05,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:48:05,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:48:05,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 156 transitions, 1428 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:05,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:48:05,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:48:05,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:48:08,670 INFO L124 PetriNetUnfolderBase]: 15579/21215 cut-off events. [2024-06-27 23:48:08,670 INFO L125 PetriNetUnfolderBase]: For 242630/242630 co-relation queries the response was YES. [2024-06-27 23:48:08,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106176 conditions, 21215 events. 15579/21215 cut-off events. For 242630/242630 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 112897 event pairs, 7485 based on Foata normal form. 14/21222 useless extension candidates. Maximal degree in co-relation 106135. Up to 20797 conditions per place. [2024-06-27 23:48:08,846 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 171 selfloop transitions, 31 changer transitions 0/207 dead transitions. [2024-06-27 23:48:08,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 207 transitions, 2193 flow [2024-06-27 23:48:08,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:48:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:48:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 176 transitions. [2024-06-27 23:48:08,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4743935309973046 [2024-06-27 23:48:08,848 INFO L175 Difference]: Start difference. First operand has 103 places, 156 transitions, 1428 flow. Second operand 7 states and 176 transitions. [2024-06-27 23:48:08,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 207 transitions, 2193 flow [2024-06-27 23:48:08,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 207 transitions, 2132 flow, removed 29 selfloop flow, removed 1 redundant places. [2024-06-27 23:48:08,967 INFO L231 Difference]: Finished difference. Result has 112 places, 169 transitions, 1636 flow [2024-06-27 23:48:08,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1369, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1636, PETRI_PLACES=112, PETRI_TRANSITIONS=169} [2024-06-27 23:48:08,968 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 56 predicate places. [2024-06-27 23:48:08,968 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 169 transitions, 1636 flow [2024-06-27 23:48:08,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:08,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:48:08,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:48:08,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-27 23:48:08,969 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:48:08,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:48:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash 40240013, now seen corresponding path program 3 times [2024-06-27 23:48:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:48:08,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823364353] [2024-06-27 23:48:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:48:08,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:48:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:48:10,465 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 23:48:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:48:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823364353] [2024-06-27 23:48:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823364353] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:48:10,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:48:10,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:48:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473043632] [2024-06-27 23:48:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:48:10,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:48:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:48:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:48:10,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:48:10,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:48:10,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 169 transitions, 1636 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:10,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:48:10,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:48:10,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:48:13,752 INFO L124 PetriNetUnfolderBase]: 15768/21469 cut-off events. [2024-06-27 23:48:13,752 INFO L125 PetriNetUnfolderBase]: For 280939/280939 co-relation queries the response was YES. [2024-06-27 23:48:13,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113796 conditions, 21469 events. 15768/21469 cut-off events. For 280939/280939 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 114328 event pairs, 7496 based on Foata normal form. 14/21476 useless extension candidates. Maximal degree in co-relation 113748. Up to 20818 conditions per place. [2024-06-27 23:48:13,950 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 176 selfloop transitions, 47 changer transitions 0/228 dead transitions. [2024-06-27 23:48:13,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 228 transitions, 2605 flow [2024-06-27 23:48:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:48:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:48:13,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 181 transitions. [2024-06-27 23:48:13,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48787061994609165 [2024-06-27 23:48:13,951 INFO L175 Difference]: Start difference. First operand has 112 places, 169 transitions, 1636 flow. Second operand 7 states and 181 transitions. [2024-06-27 23:48:13,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 228 transitions, 2605 flow [2024-06-27 23:48:14,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 228 transitions, 2485 flow, removed 38 selfloop flow, removed 3 redundant places. [2024-06-27 23:48:14,105 INFO L231 Difference]: Finished difference. Result has 117 places, 183 transitions, 1883 flow [2024-06-27 23:48:14,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1883, PETRI_PLACES=117, PETRI_TRANSITIONS=183} [2024-06-27 23:48:14,106 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 61 predicate places. [2024-06-27 23:48:14,106 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 183 transitions, 1883 flow [2024-06-27 23:48:14,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:14,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:48:14,107 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:48:14,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-27 23:48:14,107 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:48:14,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:48:14,107 INFO L85 PathProgramCache]: Analyzing trace with hash -821607933, now seen corresponding path program 3 times [2024-06-27 23:48:14,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:48:14,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440666802] [2024-06-27 23:48:14,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:48:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:48:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:48:15,815 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 23:48:15,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:48:15,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440666802] [2024-06-27 23:48:15,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440666802] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:48:15,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:48:15,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:48:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342425421] [2024-06-27 23:48:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:48:15,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:48:15,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:48:15,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:48:15,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:48:15,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2024-06-27 23:48:15,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 183 transitions, 1883 flow. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:15,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:48:15,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2024-06-27 23:48:15,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:48:19,310 INFO L124 PetriNetUnfolderBase]: 15759/21460 cut-off events. [2024-06-27 23:48:19,310 INFO L125 PetriNetUnfolderBase]: For 329193/329193 co-relation queries the response was YES. [2024-06-27 23:48:19,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120429 conditions, 21460 events. 15759/21460 cut-off events. For 329193/329193 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 114367 event pairs, 7539 based on Foata normal form. 3/21458 useless extension candidates. Maximal degree in co-relation 120379. Up to 21141 conditions per place. [2024-06-27 23:48:19,514 INFO L140 encePairwiseOnDemand]: 40/53 looper letters, 185 selfloop transitions, 24 changer transitions 0/214 dead transitions. [2024-06-27 23:48:19,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 214 transitions, 2403 flow [2024-06-27 23:48:19,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 23:48:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 23:48:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 165 transitions. [2024-06-27 23:48:19,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.444743935309973 [2024-06-27 23:48:19,516 INFO L175 Difference]: Start difference. First operand has 117 places, 183 transitions, 1883 flow. Second operand 7 states and 165 transitions. [2024-06-27 23:48:19,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 214 transitions, 2403 flow [2024-06-27 23:48:19,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 214 transitions, 2240 flow, removed 69 selfloop flow, removed 3 redundant places. [2024-06-27 23:48:19,845 INFO L231 Difference]: Finished difference. Result has 121 places, 183 transitions, 1780 flow [2024-06-27 23:48:19,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1720, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1780, PETRI_PLACES=121, PETRI_TRANSITIONS=183} [2024-06-27 23:48:19,845 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 65 predicate places. [2024-06-27 23:48:19,846 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 183 transitions, 1780 flow [2024-06-27 23:48:19,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:19,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:48:19,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:48:19,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 23:48:19,846 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:48:19,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:48:19,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1303068751, now seen corresponding path program 4 times [2024-06-27 23:48:19,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:48:19,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771821557] [2024-06-27 23:48:19,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:48:19,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:48:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:48:21,601 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 23:48:21,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:48:21,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771821557] [2024-06-27 23:48:21,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771821557] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:48:21,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:48:21,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:48:21,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422243549] [2024-06-27 23:48:21,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:48:21,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:48:21,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:48:21,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:48:21,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:48:21,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:48:21,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 183 transitions, 1780 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:21,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:48:21,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:48:21,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:48:25,128 INFO L124 PetriNetUnfolderBase]: 14222/19940 cut-off events. [2024-06-27 23:48:25,128 INFO L125 PetriNetUnfolderBase]: For 308595/308603 co-relation queries the response was YES. [2024-06-27 23:48:25,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111552 conditions, 19940 events. 14222/19940 cut-off events. For 308595/308603 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 111438 event pairs, 6575 based on Foata normal form. 7/19916 useless extension candidates. Maximal degree in co-relation 111500. Up to 19012 conditions per place. [2024-06-27 23:48:25,307 INFO L140 encePairwiseOnDemand]: 39/53 looper letters, 203 selfloop transitions, 64 changer transitions 0/273 dead transitions. [2024-06-27 23:48:25,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 273 transitions, 3009 flow [2024-06-27 23:48:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 23:48:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 23:48:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 237 transitions. [2024-06-27 23:48:25,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968553459119497 [2024-06-27 23:48:25,309 INFO L175 Difference]: Start difference. First operand has 121 places, 183 transitions, 1780 flow. Second operand 9 states and 237 transitions. [2024-06-27 23:48:25,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 273 transitions, 3009 flow [2024-06-27 23:48:25,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 273 transitions, 2929 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-06-27 23:48:25,464 INFO L231 Difference]: Finished difference. Result has 126 places, 216 transitions, 2258 flow [2024-06-27 23:48:25,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=1704, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2258, PETRI_PLACES=126, PETRI_TRANSITIONS=216} [2024-06-27 23:48:25,465 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 70 predicate places. [2024-06-27 23:48:25,465 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 216 transitions, 2258 flow [2024-06-27 23:48:25,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:25,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:48:25,466 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:48:25,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 23:48:25,466 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:48:25,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:48:25,466 INFO L85 PathProgramCache]: Analyzing trace with hash 2064374799, now seen corresponding path program 5 times [2024-06-27 23:48:25,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:48:25,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777050779] [2024-06-27 23:48:25,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:48:25,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:48:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:48:27,622 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 23:48:27,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:48:27,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777050779] [2024-06-27 23:48:27,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777050779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:48:27,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:48:27,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:48:27,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50090281] [2024-06-27 23:48:27,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:48:27,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:48:27,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:48:27,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:48:27,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:48:27,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:48:27,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 216 transitions, 2258 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:27,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:48:27,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:48:27,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:48:31,353 INFO L124 PetriNetUnfolderBase]: 14308/20058 cut-off events. [2024-06-27 23:48:31,354 INFO L125 PetriNetUnfolderBase]: For 353844/353858 co-relation queries the response was YES. [2024-06-27 23:48:31,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117301 conditions, 20058 events. 14308/20058 cut-off events. For 353844/353858 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 112021 event pairs, 6575 based on Foata normal form. 15/20042 useless extension candidates. Maximal degree in co-relation 117247. Up to 19136 conditions per place. [2024-06-27 23:48:31,567 INFO L140 encePairwiseOnDemand]: 38/53 looper letters, 205 selfloop transitions, 77 changer transitions 0/288 dead transitions. [2024-06-27 23:48:31,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 288 transitions, 3316 flow [2024-06-27 23:48:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:48:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:48:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 200 transitions. [2024-06-27 23:48:31,577 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2024-06-27 23:48:31,577 INFO L175 Difference]: Start difference. First operand has 126 places, 216 transitions, 2258 flow. Second operand 8 states and 200 transitions. [2024-06-27 23:48:31,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 288 transitions, 3316 flow [2024-06-27 23:48:31,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 288 transitions, 3010 flow, removed 126 selfloop flow, removed 3 redundant places. [2024-06-27 23:48:31,841 INFO L231 Difference]: Finished difference. Result has 132 places, 249 transitions, 2542 flow [2024-06-27 23:48:31,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2031, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2542, PETRI_PLACES=132, PETRI_TRANSITIONS=249} [2024-06-27 23:48:31,842 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 76 predicate places. [2024-06-27 23:48:31,842 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 249 transitions, 2542 flow [2024-06-27 23:48:31,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:31,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:48:31,843 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:48:31,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 23:48:31,843 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:48:31,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:48:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2085944475, now seen corresponding path program 4 times [2024-06-27 23:48:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:48:31,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143915146] [2024-06-27 23:48:31,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:48:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:48:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:48:34,182 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 23:48:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:48:34,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143915146] [2024-06-27 23:48:34,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143915146] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:48:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:48:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:48:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360245128] [2024-06-27 23:48:34,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:48:34,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:48:34,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:48:34,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:48:34,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:48:34,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:48:34,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 249 transitions, 2542 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:34,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:48:34,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:48:34,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 23:48:38,070 INFO L124 PetriNetUnfolderBase]: 14626/20465 cut-off events. [2024-06-27 23:48:38,071 INFO L125 PetriNetUnfolderBase]: For 378506/378539 co-relation queries the response was YES. [2024-06-27 23:48:38,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121154 conditions, 20465 events. 14626/20465 cut-off events. For 378506/378539 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 114182 event pairs, 6477 based on Foata normal form. 29/20455 useless extension candidates. Maximal degree in co-relation 121096. Up to 19132 conditions per place. [2024-06-27 23:48:38,240 INFO L140 encePairwiseOnDemand]: 37/53 looper letters, 233 selfloop transitions, 109 changer transitions 0/348 dead transitions. [2024-06-27 23:48:38,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 348 transitions, 4260 flow [2024-06-27 23:48:38,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 23:48:38,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 23:48:38,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 217 transitions. [2024-06-27 23:48:38,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117924528301887 [2024-06-27 23:48:38,242 INFO L175 Difference]: Start difference. First operand has 132 places, 249 transitions, 2542 flow. Second operand 8 states and 217 transitions. [2024-06-27 23:48:38,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 348 transitions, 4260 flow [2024-06-27 23:48:38,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 348 transitions, 4188 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 23:48:38,467 INFO L231 Difference]: Finished difference. Result has 140 places, 294 transitions, 3354 flow [2024-06-27 23:48:38,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=2470, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3354, PETRI_PLACES=140, PETRI_TRANSITIONS=294} [2024-06-27 23:48:38,468 INFO L281 CegarLoopForPetriNet]: 56 programPoint places, 84 predicate places. [2024-06-27 23:48:38,468 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 294 transitions, 3354 flow [2024-06-27 23:48:38,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:38,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 23:48:38,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 23:48:38,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-06-27 23:48:38,469 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 5 more)] === [2024-06-27 23:48:38,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 23:48:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 2064494769, now seen corresponding path program 6 times [2024-06-27 23:48:38,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 23:48:38,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499767970] [2024-06-27 23:48:38,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 23:48:38,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 23:48:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 23:48:40,848 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 23:48:40,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 23:48:40,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499767970] [2024-06-27 23:48:40,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499767970] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 23:48:40,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 23:48:40,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 23:48:40,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93268152] [2024-06-27 23:48:40,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 23:48:40,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 23:48:40,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 23:48:40,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 23:48:40,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-27 23:48:40,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 53 [2024-06-27 23:48:40,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 294 transitions, 3354 flow. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 23:48:40,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 23:48:40,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 53 [2024-06-27 23:48:40,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand