./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/rfi005.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi005.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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/rfi005.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi005.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-cde23df-m [2024-06-14 15:41:03,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 15:41:03,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 15:41:03,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 15:41:03,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 15:41:03,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 15:41:03,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 15:41:03,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 15:41:03,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 15:41:03,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 15:41:03,716 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 15:41:03,716 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 15:41:03,717 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 15:41:03,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 15:41:03,719 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 15:41:03,719 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 15:41:03,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 15:41:03,720 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 15:41:03,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 15:41:03,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 15:41:03,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 15:41:03,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 15:41:03,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 15:41:03,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 15:41:03,722 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 15:41:03,722 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 15:41:03,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 15:41:03,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 15:41:03,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 15:41:03,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 15:41:03,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 15:41:03,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 15:41:03,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:41:03,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 15:41:03,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 15:41:03,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 15:41:03,732 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 15:41:03,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 15:41:03,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 15:41:03,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 15:41:03,733 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 15:41:03,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 15:41:03,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 15:41:03,734 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-14 15:41:03,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 15:41:04,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 15:41:04,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 15:41:04,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 15:41:04,011 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 15:41:04,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi005.i [2024-06-14 15:41:05,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 15:41:05,575 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 15:41:05,576 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi005.i [2024-06-14 15:41:05,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e921ed5a/e182ac4fe2ee48f58ae698ba4fd3ab06/FLAG85099ff24 [2024-06-14 15:41:05,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e921ed5a/e182ac4fe2ee48f58ae698ba4fd3ab06 [2024-06-14 15:41:05,608 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 15:41:05,608 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 15:41:05,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/rfi005.yml/witness.yml [2024-06-14 15:41:05,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 15:41:05,795 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 15:41:05,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 15:41:05,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 15:41:05,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 15:41:05,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:41:05" (1/2) ... [2024-06-14 15:41:05,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfd749c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:41:05, skipping insertion in model container [2024-06-14 15:41:05,805 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 03:41:05" (1/2) ... [2024-06-14 15:41:05,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4fb33dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 03:41:05, skipping insertion in model container [2024-06-14 15:41:05,807 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:41:05" (2/2) ... [2024-06-14 15:41:05,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dfd749c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:05, skipping insertion in model container [2024-06-14 15:41:05,808 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:41:05" (2/2) ... [2024-06-14 15:41:05,808 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 15:41:05,881 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 15:41:05,883 INFO L97 edCorrectnessWitness]: Location invariant before [L837-L837] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2)) && ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (0 <= y$w_buff1 && ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (0 <= y$w_buff0 && ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2))) [2024-06-14 15:41:05,883 INFO L97 edCorrectnessWitness]: Location invariant before [L838-L838] ((((((((((((((((! multithreaded || y$read_delayed_var == 0) && (! multithreaded || ((0 <= __unbuffered_p1_EBX && __unbuffered_p1_EBX <= 1) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)))) && (! multithreaded || (0 <= y && ((y == 0 || y == 1) || y == 2)))) && (! multithreaded || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EBX) + (long long )x >= 0LL && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$r_buff1_thd1) + (long long )y$w_buff1 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff0 >= 0LL) && (0LL - (long long )y$read_delayed) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )y >= 0LL) && (1LL - (long long )x) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )x) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )x >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$flush_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$mem_tmp >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff0 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )y$w_buff1 >= 0LL) && (1LL - (long long )weak$$choice0) + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p0_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_cnt + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_cnt + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_cnt + (long long )x >= 0LL) && (long long )__unbuffered_cnt + (long long )y >= 0LL) && (long long )__unbuffered_cnt + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_cnt + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_cnt + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EAX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p0_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )__unbuffered_p1_EBX >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EAX + (long long )weak$$choice2 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )main$tmp_guard1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )x >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$flush_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$mem_tmp >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )y$w_buff1 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice0 >= 0LL) && (long long )__unbuffered_p1_EBX + (long long )weak$$choice2 >= 0LL) && (long long )main$tmp_guard1 + (long long )x >= 0LL) && (long long )main$tmp_guard1 + (long long )y >= 0LL) && (long long )main$tmp_guard1 + (long long )y$flush_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$mem_tmp >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff0 >= 0LL) && (long long )main$tmp_guard1 + (long long )y$w_buff1 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice0 >= 0LL) && (long long )main$tmp_guard1 + (long long )weak$$choice2 >= 0LL) && (long long )x + (long long )y >= 0LL) && (long long )x + (long long )y$flush_delayed >= 0LL) && (long long )x + (long long )y$mem_tmp >= 0LL) && (long long )x + (long long )y$r_buff0_thd0 >= 0LL) && (long long )x + (long long )y$r_buff0_thd1 >= 0LL) && (long long )x + (long long )y$r_buff1_thd0 >= 0LL) && (long long )x + (long long )y$r_buff1_thd1 >= 0LL) && (long long )x + (long long )y$read_delayed >= 0LL) && (long long )x + (long long )y$w_buff0 >= 0LL) && (long long )x + (long long )y$w_buff1 >= 0LL) && (long long )y + (long long )y$flush_delayed >= 0LL) && (long long )y + (long long )y$mem_tmp >= 0LL) && (long long )y + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y + (long long )y$read_delayed >= 0LL) && (long long )y + (long long )y$w_buff0 >= 0LL) && (long long )y + (long long )y$w_buff1 >= 0LL) && (long long )y$flush_delayed + (long long )y$mem_tmp >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed + (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$flush_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp + (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff0 >= 0LL) && (long long )y$mem_tmp + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff0_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd0 + (long long )y$w_buff1 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff0 >= 0LL) && (long long )y$r_buff1_thd1 + (long long )y$w_buff1 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff0 >= 0LL) && (long long )y$read_delayed + (long long )y$w_buff1 >= 0LL) && (long long )y$w_buff0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )x >= 0LL) && (long long )weak$$choice0 + (long long )y >= 0LL) && (long long )weak$$choice0 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice0 + (long long )y$w_buff1 >= 0LL) && (long long )weak$$choice0 + (long long )weak$$choice2 >= 0LL) && (long long )weak$$choice2 + (long long )x >= 0LL) && (long long )weak$$choice2 + (long long )y >= 0LL) && (long long )weak$$choice2 + (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$mem_tmp >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 + (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 + (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff0 >= 0LL) && (long long )weak$$choice2 + (long long )y$w_buff1 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p0_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p1_EBX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (1LL + (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )x >= 0LL) && (1LL + (long long )main$tmp_guard1) - (long long )weak$$choice0 >= 0LL) && (1LL + (long long )weak$$choice0) - (long long )x >= 0LL) && (1LL + (long long )weak$$choice2) - (long long )x >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff0_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd0 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff0_thd1) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$r_buff1_thd1 >= 0LL) && (0LL - (long long )y$r_buff1_thd0) - (long long )y$read_delayed >= 0LL) && (0LL - (long long )y$r_buff1_thd1) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p1_EBX) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )x) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )x) - (long long )y$read_delayed >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff0_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd0 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$r_buff1_thd1 >= 0LL) && (1LL - (long long )weak$$choice0) - (long long )y$read_delayed >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )x >= 0LL) && (2LL - (long long )__unbuffered_p1_EBX) - (long long )weak$$choice0 >= 0LL) && (2LL - (long long )weak$$choice0) - (long long )x >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_cnt - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p0_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )y$read_delayed >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff0_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd0 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$r_buff1_thd1 >= 0LL) && (long long )__unbuffered_p1_EBX - (long long )y$read_delayed >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )main$tmp_guard1 - (long long )y$read_delayed >= 0LL) && (long long )x - (long long )y$r_buff0_thd0 >= 0LL) && (long long )x - (long long )y$r_buff0_thd1 >= 0LL) && (long long )x - (long long )y$r_buff1_thd0 >= 0LL) && (long long )x - (long long )y$r_buff1_thd1 >= 0LL) && (long long )x - (long long )y$read_delayed >= 0LL) && (long long )y - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y - (long long )y$read_delayed >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$flush_delayed - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$flush_delayed - (long long )y$read_delayed >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$mem_tmp - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$mem_tmp - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff0_thd1 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )y$r_buff1_thd0 - (long long )y$read_delayed >= 0LL) && (long long )y$r_buff1_thd1 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice0 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice0 - (long long )y$read_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$flush_delayed >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff0_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd0 >= 0LL) && (long long )weak$$choice2 - (long long )y$r_buff1_thd1 >= 0LL) && (long long )weak$$choice2 - (long long )y$read_delayed >= 0LL))) && (! multithreaded || (((((((((((((((((((((((((0 <= __unbuffered_cnt && 0 <= __unbuffered_p0_EAX) && 0 <= __unbuffered_p1_EAX) && 0 <= __unbuffered_p1_EBX) && 0 <= x) && 0 <= y) && 0 <= y$mem_tmp) && 0 <= y$w_buff0) && 0 <= y$w_buff1) && __unbuffered_p1_EBX <= 1) && x <= 1) && y$flush_delayed == (_Bool)0) && y$r_buff0_thd0 == (_Bool)0) && y$r_buff0_thd1 == (_Bool)0) && y$r_buff1_thd0 == (_Bool)0) && y$r_buff1_thd1 == (_Bool)0) && y$read_delayed == (_Bool)0) && y$read_delayed_var == 0) && (__unbuffered_p1_EBX == 0 || __unbuffered_p1_EBX == 1)) && (x == 0 || x == 1)) && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)) && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)) && ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2)) && ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2)))) && (! multithreaded || y$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || ((0 <= x && x <= 1) && (x == 0 || x == 1)))) && (! multithreaded || y$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (0 <= __unbuffered_p1_EAX && ((__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1) || __unbuffered_p1_EAX == 2)))) && (! multithreaded || (0 <= __unbuffered_p0_EAX && ((__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1) || __unbuffered_p0_EAX == 2)))) && (! multithreaded || y$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || y$r_buff0_thd0 == (_Bool)0)) && (! multithreaded || (0 <= y$w_buff1 && ((y$w_buff1 == 0 || y$w_buff1 == 1) || y$w_buff1 == 2)))) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (0 <= y$mem_tmp && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2)))) && (! multithreaded || y$read_delayed == (_Bool)0)) && (! multithreaded || (0 <= y$w_buff0 && ((y$w_buff0 == 0 || y$w_buff0 == 1) || y$w_buff0 == 2))) [2024-06-14 15:41:05,884 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 15:41:05,884 INFO L106 edCorrectnessWitness]: ghost_update [L835-L835] multithreaded = 1; [2024-06-14 15:41:05,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 15:41:06,310 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:41:06,323 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 15:41:06,644 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 15:41:06,679 INFO L206 MainTranslator]: Completed translation [2024-06-14 15:41:06,681 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06 WrapperNode [2024-06-14 15:41:06,681 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 15:41:06,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 15:41:06,683 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 15:41:06,683 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 15:41:06,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:06,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:06,900 INFO L138 Inliner]: procedures = 174, calls = 41, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 174 [2024-06-14 15:41:06,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 15:41:06,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 15:41:06,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 15:41:06,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 15:41:06,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:06,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:06,960 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:07,013 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-14 15:41:07,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:07,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:07,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:07,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:07,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:07,072 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:07,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 15:41:07,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 15:41:07,095 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 15:41:07,095 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 15:41:07,096 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (1/1) ... [2024-06-14 15:41:07,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 15:41:07,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 15:41:07,128 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-14 15:41:07,137 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-14 15:41:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-14 15:41:07,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 15:41:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-06-14 15:41:07,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-06-14 15:41:07,167 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-06-14 15:41:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-06-14 15:41:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 15:41:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-14 15:41:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 15:41:07,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 15:41:07,170 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 15:41:07,323 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 15:41:07,325 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 15:41:08,176 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 15:41:08,176 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 15:41:08,408 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 15:41:08,408 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-06-14 15:41:08,411 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:41:08 BoogieIcfgContainer [2024-06-14 15:41:08,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 15:41:08,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 15:41:08,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 15:41:08,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 15:41:08,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 03:41:05" (1/4) ... [2024-06-14 15:41:08,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b5abf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 03:41:08, skipping insertion in model container [2024-06-14 15:41:08,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 03:41:05" (2/4) ... [2024-06-14 15:41:08,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b5abf9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:41:08, skipping insertion in model container [2024-06-14 15:41:08,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 03:41:06" (3/4) ... [2024-06-14 15:41:08,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58b5abf9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 03:41:08, skipping insertion in model container [2024-06-14 15:41:08,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 03:41:08" (4/4) ... [2024-06-14 15:41:08,425 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi005.i [2024-06-14 15:41:08,440 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 15:41:08,441 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 15:41:08,441 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 15:41:08,537 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-14 15:41:08,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 15:41:08,612 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-06-14 15:41:08,613 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:41:08,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-06-14 15:41:08,615 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 33 transitions, 74 flow [2024-06-14 15:41:08,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 25 transitions, 56 flow [2024-06-14 15:41:08,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 15:41:08,632 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;@42c0eaaa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 15:41:08,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 15:41:08,644 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 15:41:08,646 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 15:41:08,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 15:41:08,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:08,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 15:41:08,648 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:08,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash 865260380, now seen corresponding path program 1 times [2024-06-14 15:41:08,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:08,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815236016] [2024-06-14 15:41:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:08,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:13,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:13,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815236016] [2024-06-14 15:41:13,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815236016] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:13,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:13,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 15:41:13,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725694656] [2024-06-14 15:41:13,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:13,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:41:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:13,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:41:13,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:41:13,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 33 [2024-06-14 15:41:13,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 15:41:13,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:13,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 33 [2024-06-14 15:41:13,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:13,898 INFO L124 PetriNetUnfolderBase]: 153/306 cut-off events. [2024-06-14 15:41:13,898 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-14 15:41:13,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 306 events. 153/306 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1219 event pairs, 89 based on Foata normal form. 1/302 useless extension candidates. Maximal degree in co-relation 587. Up to 272 conditions per place. [2024-06-14 15:41:13,904 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 23 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-06-14 15:41:13,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 123 flow [2024-06-14 15:41:13,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:41:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:41:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-14 15:41:13,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2024-06-14 15:41:13,916 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 56 flow. Second operand 3 states and 55 transitions. [2024-06-14 15:41:13,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 123 flow [2024-06-14 15:41:13,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 31 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 15:41:13,921 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 75 flow [2024-06-14 15:41:13,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-14 15:41:13,926 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-06-14 15:41:13,927 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 75 flow [2024-06-14 15:41:13,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-14 15:41:13,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:13,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:13,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 15:41:13,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:13,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:13,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1708396933, now seen corresponding path program 1 times [2024-06-14 15:41:13,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052818075] [2024-06-14 15:41:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:13,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:17,268 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-14 15:41:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052818075] [2024-06-14 15:41:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052818075] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:17,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:17,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 15:41:17,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068177129] [2024-06-14 15:41:17,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:17,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 15:41:17,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 15:41:17,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 15:41:17,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:17,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:17,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:17,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:17,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:17,544 INFO L124 PetriNetUnfolderBase]: 172/323 cut-off events. [2024-06-14 15:41:17,545 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-06-14 15:41:17,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 323 events. 172/323 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1248 event pairs, 79 based on Foata normal form. 2/325 useless extension candidates. Maximal degree in co-relation 723. Up to 295 conditions per place. [2024-06-14 15:41:17,548 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 28 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2024-06-14 15:41:17,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 167 flow [2024-06-14 15:41:17,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 15:41:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 15:41:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2024-06-14 15:41:17,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-06-14 15:41:17,550 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 75 flow. Second operand 4 states and 67 transitions. [2024-06-14 15:41:17,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 167 flow [2024-06-14 15:41:17,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 37 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 15:41:17,552 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 99 flow [2024-06-14 15:41:17,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2024-06-14 15:41:17,553 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-14 15:41:17,554 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 99 flow [2024-06-14 15:41:17,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:17,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:17,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:17,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 15:41:17,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:17,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1091910246, now seen corresponding path program 1 times [2024-06-14 15:41:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:17,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054699186] [2024-06-14 15:41:17,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:17,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:17,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:22,156 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-14 15:41:22,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:22,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054699186] [2024-06-14 15:41:22,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054699186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:22,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:22,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:41:22,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046219467] [2024-06-14 15:41:22,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:22,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-14 15:41:22,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:22,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-14 15:41:22,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-14 15:41:22,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:22,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-14 15:41:22,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:22,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:22,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:22,592 INFO L124 PetriNetUnfolderBase]: 169/318 cut-off events. [2024-06-14 15:41:22,593 INFO L125 PetriNetUnfolderBase]: For 194/194 co-relation queries the response was YES. [2024-06-14 15:41:22,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809 conditions, 318 events. 169/318 cut-off events. For 194/194 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1212 event pairs, 55 based on Foata normal form. 2/320 useless extension candidates. Maximal degree in co-relation 792. Up to 281 conditions per place. [2024-06-14 15:41:22,596 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 32 selfloop transitions, 7 changer transitions 0/43 dead transitions. [2024-06-14 15:41:22,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 43 transitions, 215 flow [2024-06-14 15:41:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:41:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:41:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2024-06-14 15:41:22,603 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2024-06-14 15:41:22,603 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 99 flow. Second operand 5 states and 81 transitions. [2024-06-14 15:41:22,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 43 transitions, 215 flow [2024-06-14 15:41:22,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 43 transitions, 206 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 15:41:22,609 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 123 flow [2024-06-14 15:41:22,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2024-06-14 15:41:22,611 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 7 predicate places. [2024-06-14 15:41:22,611 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 123 flow [2024-06-14 15:41:22,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 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-14 15:41:22,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:22,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:22,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 15:41:22,612 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:22,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash -20141193, now seen corresponding path program 1 times [2024-06-14 15:41:22,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270756527] [2024-06-14 15:41:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:28,076 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-14 15:41:28,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:28,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270756527] [2024-06-14 15:41:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270756527] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:28,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:28,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:41:28,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213867278] [2024-06-14 15:41:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:28,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:41:28,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:28,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:41:28,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:41:28,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:28,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:28,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:28,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:28,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:28,419 INFO L124 PetriNetUnfolderBase]: 145/290 cut-off events. [2024-06-14 15:41:28,420 INFO L125 PetriNetUnfolderBase]: For 301/301 co-relation queries the response was YES. [2024-06-14 15:41:28,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 290 events. 145/290 cut-off events. For 301/301 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1127 event pairs, 46 based on Foata normal form. 1/288 useless extension candidates. Maximal degree in co-relation 779. Up to 256 conditions per place. [2024-06-14 15:41:28,423 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 27 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-14 15:41:28,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 207 flow [2024-06-14 15:41:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:41:28,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:41:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-06-14 15:41:28,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-06-14 15:41:28,427 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 123 flow. Second operand 5 states and 70 transitions. [2024-06-14 15:41:28,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 207 flow [2024-06-14 15:41:28,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 192 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-06-14 15:41:28,430 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2024-06-14 15:41:28,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2024-06-14 15:41:28,432 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2024-06-14 15:41:28,432 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2024-06-14 15:41:28,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:28,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:28,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:28,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 15:41:28,433 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:28,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:28,434 INFO L85 PathProgramCache]: Analyzing trace with hash 2049103687, now seen corresponding path program 1 times [2024-06-14 15:41:28,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:28,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502804371] [2024-06-14 15:41:28,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:28,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:32,611 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-14 15:41:32,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502804371] [2024-06-14 15:41:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502804371] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:32,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 15:41:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888859606] [2024-06-14 15:41:32,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:32,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:41:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:32,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:41:32,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:41:32,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 33 [2024-06-14 15:41:32,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:32,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:32,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 33 [2024-06-14 15:41:32,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:33,014 INFO L124 PetriNetUnfolderBase]: 163/307 cut-off events. [2024-06-14 15:41:33,014 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2024-06-14 15:41:33,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 307 events. 163/307 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1156 event pairs, 29 based on Foata normal form. 4/311 useless extension candidates. Maximal degree in co-relation 890. Up to 252 conditions per place. [2024-06-14 15:41:33,018 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2024-06-14 15:41:33,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 245 flow [2024-06-14 15:41:33,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:41:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:41:33,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-06-14 15:41:33,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2024-06-14 15:41:33,019 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 6 states and 90 transitions. [2024-06-14 15:41:33,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 245 flow [2024-06-14 15:41:33,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 234 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-14 15:41:33,022 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 136 flow [2024-06-14 15:41:33,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2024-06-14 15:41:33,023 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 11 predicate places. [2024-06-14 15:41:33,023 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 136 flow [2024-06-14 15:41:33,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:33,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:33,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:33,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 15:41:33,024 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:33,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:33,025 INFO L85 PathProgramCache]: Analyzing trace with hash -602926624, now seen corresponding path program 1 times [2024-06-14 15:41:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:33,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112075558] [2024-06-14 15:41:33,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:33,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:33,205 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-14 15:41:33,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:33,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112075558] [2024-06-14 15:41:33,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112075558] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:33,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:33,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 15:41:33,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021565348] [2024-06-14 15:41:33,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:33,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 15:41:33,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:33,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 15:41:33,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 15:41:33,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 33 [2024-06-14 15:41:33,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-14 15:41:33,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:33,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 33 [2024-06-14 15:41:33,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:33,297 INFO L124 PetriNetUnfolderBase]: 47/133 cut-off events. [2024-06-14 15:41:33,298 INFO L125 PetriNetUnfolderBase]: For 200/205 co-relation queries the response was YES. [2024-06-14 15:41:33,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 133 events. 47/133 cut-off events. For 200/205 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 513 event pairs, 30 based on Foata normal form. 18/144 useless extension candidates. Maximal degree in co-relation 346. Up to 68 conditions per place. [2024-06-14 15:41:33,299 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 14 selfloop transitions, 7 changer transitions 0/32 dead transitions. [2024-06-14 15:41:33,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 32 transitions, 172 flow [2024-06-14 15:41:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 15:41:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 15:41:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-14 15:41:33,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2024-06-14 15:41:33,301 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 136 flow. Second operand 3 states and 61 transitions. [2024-06-14 15:41:33,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 32 transitions, 172 flow [2024-06-14 15:41:33,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 152 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:33,303 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 120 flow [2024-06-14 15:41:33,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2024-06-14 15:41:33,304 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 9 predicate places. [2024-06-14 15:41:33,304 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 120 flow [2024-06-14 15:41:33,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-14 15:41:33,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:33,305 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:33,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 15:41:33,305 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:33,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2118930808, now seen corresponding path program 1 times [2024-06-14 15:41:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:33,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652404092] [2024-06-14 15:41:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:33,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:38,554 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-14 15:41:38,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:38,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652404092] [2024-06-14 15:41:38,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652404092] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:38,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:38,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:41:38,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901919814] [2024-06-14 15:41:38,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:38,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:41:38,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:38,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:41:38,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:41:38,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:41:38,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 120 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-14 15:41:38,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:38,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:41:38,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:38,929 INFO L124 PetriNetUnfolderBase]: 111/238 cut-off events. [2024-06-14 15:41:38,929 INFO L125 PetriNetUnfolderBase]: For 478/478 co-relation queries the response was YES. [2024-06-14 15:41:38,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 238 events. 111/238 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 842 event pairs, 52 based on Foata normal form. 2/240 useless extension candidates. Maximal degree in co-relation 706. Up to 198 conditions per place. [2024-06-14 15:41:38,931 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 30 selfloop transitions, 8 changer transitions 0/42 dead transitions. [2024-06-14 15:41:38,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 42 transitions, 234 flow [2024-06-14 15:41:38,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:41:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:41:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2024-06-14 15:41:38,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.398989898989899 [2024-06-14 15:41:38,934 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 120 flow. Second operand 6 states and 79 transitions. [2024-06-14 15:41:38,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 42 transitions, 234 flow [2024-06-14 15:41:38,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 15:41:38,937 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 155 flow [2024-06-14 15:41:38,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=155, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2024-06-14 15:41:38,939 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 15 predicate places. [2024-06-14 15:41:38,939 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 155 flow [2024-06-14 15:41:38,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-14 15:41:38,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:38,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:38,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 15:41:38,940 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:38,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1068619022, now seen corresponding path program 2 times [2024-06-14 15:41:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:38,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397535759] [2024-06-14 15:41:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:38,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:44,394 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-14 15:41:44,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397535759] [2024-06-14 15:41:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397535759] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:44,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-14 15:41:44,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867832013] [2024-06-14 15:41:44,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:44,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-14 15:41:44,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:44,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-14 15:41:44,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-06-14 15:41:44,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:41:44,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 32 transitions, 155 flow. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-14 15:41:44,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:44,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:41:44,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:44,681 INFO L124 PetriNetUnfolderBase]: 110/233 cut-off events. [2024-06-14 15:41:44,681 INFO L125 PetriNetUnfolderBase]: For 694/694 co-relation queries the response was YES. [2024-06-14 15:41:44,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 233 events. 110/233 cut-off events. For 694/694 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 806 event pairs, 55 based on Foata normal form. 1/233 useless extension candidates. Maximal degree in co-relation 771. Up to 193 conditions per place. [2024-06-14 15:41:44,683 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 27 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2024-06-14 15:41:44,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 39 transitions, 245 flow [2024-06-14 15:41:44,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-14 15:41:44,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-14 15:41:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2024-06-14 15:41:44,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3686868686868687 [2024-06-14 15:41:44,685 INFO L175 Difference]: Start difference. First operand has 47 places, 32 transitions, 155 flow. Second operand 6 states and 73 transitions. [2024-06-14 15:41:44,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 39 transitions, 245 flow [2024-06-14 15:41:44,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 228 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:44,688 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 164 flow [2024-06-14 15:41:44,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2024-06-14 15:41:44,689 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2024-06-14 15:41:44,689 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 164 flow [2024-06-14 15:41:44,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-14 15:41:44,689 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:44,689 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:44,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 15:41:44,690 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:44,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:44,690 INFO L85 PathProgramCache]: Analyzing trace with hash 199282669, now seen corresponding path program 1 times [2024-06-14 15:41:44,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:44,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398235580] [2024-06-14 15:41:44,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:44,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:49,680 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-14 15:41:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398235580] [2024-06-14 15:41:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398235580] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:49,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:41:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763488985] [2024-06-14 15:41:49,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:49,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:41:49,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:49,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:41:49,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:41:49,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:41:49,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 164 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:49,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:49,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:41:49,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:50,084 INFO L124 PetriNetUnfolderBase]: 119/257 cut-off events. [2024-06-14 15:41:50,085 INFO L125 PetriNetUnfolderBase]: For 892/892 co-relation queries the response was YES. [2024-06-14 15:41:50,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 257 events. 119/257 cut-off events. For 892/892 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 935 event pairs, 51 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 868. Up to 209 conditions per place. [2024-06-14 15:41:50,087 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 35 selfloop transitions, 12 changer transitions 0/51 dead transitions. [2024-06-14 15:41:50,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 51 transitions, 328 flow [2024-06-14 15:41:50,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:41:50,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:41:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 99 transitions. [2024-06-14 15:41:50,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.375 [2024-06-14 15:41:50,089 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 164 flow. Second operand 8 states and 99 transitions. [2024-06-14 15:41:50,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 51 transitions, 328 flow [2024-06-14 15:41:50,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 300 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:50,092 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 217 flow [2024-06-14 15:41:50,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2024-06-14 15:41:50,093 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 23 predicate places. [2024-06-14 15:41:50,093 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 217 flow [2024-06-14 15:41:50,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:50,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:50,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:50,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 15:41:50,094 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:50,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash 238919807, now seen corresponding path program 2 times [2024-06-14 15:41:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:50,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807110944] [2024-06-14 15:41:50,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:41:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:41:55,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:41:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807110944] [2024-06-14 15:41:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807110944] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:41:55,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:41:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:41:55,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31254820] [2024-06-14 15:41:55,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:41:55,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:41:55,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:41:55,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:41:55,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:41:55,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:41:55,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 217 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:55,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:41:55,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:41:55,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:41:56,017 INFO L124 PetriNetUnfolderBase]: 118/255 cut-off events. [2024-06-14 15:41:56,018 INFO L125 PetriNetUnfolderBase]: For 1137/1137 co-relation queries the response was YES. [2024-06-14 15:41:56,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 255 events. 118/255 cut-off events. For 1137/1137 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 931 event pairs, 51 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 913. Up to 195 conditions per place. [2024-06-14 15:41:56,020 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 34 selfloop transitions, 14 changer transitions 0/52 dead transitions. [2024-06-14 15:41:56,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 355 flow [2024-06-14 15:41:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:41:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:41:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2024-06-14 15:41:56,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38961038961038963 [2024-06-14 15:41:56,022 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 217 flow. Second operand 7 states and 90 transitions. [2024-06-14 15:41:56,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 355 flow [2024-06-14 15:41:56,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 52 transitions, 334 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-14 15:41:56,025 INFO L231 Difference]: Finished difference. Result has 58 places, 40 transitions, 240 flow [2024-06-14 15:41:56,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=58, PETRI_TRANSITIONS=40} [2024-06-14 15:41:56,026 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2024-06-14 15:41:56,026 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 40 transitions, 240 flow [2024-06-14 15:41:56,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:41:56,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:41:56,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:41:56,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-14 15:41:56,027 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:41:56,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:41:56,028 INFO L85 PathProgramCache]: Analyzing trace with hash -241547515, now seen corresponding path program 3 times [2024-06-14 15:41:56,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:41:56,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284019657] [2024-06-14 15:41:56,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:41:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:41:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 15:42:01,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:01,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284019657] [2024-06-14 15:42:01,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284019657] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:01,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:01,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:42:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043058116] [2024-06-14 15:42:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:01,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-14 15:42:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:01,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-14 15:42:01,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-06-14 15:42:01,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:42:01,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 40 transitions, 240 flow. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:01,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:01,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:42:01,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:01,757 INFO L124 PetriNetUnfolderBase]: 116/250 cut-off events. [2024-06-14 15:42:01,758 INFO L125 PetriNetUnfolderBase]: For 1448/1448 co-relation queries the response was YES. [2024-06-14 15:42:01,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 250 events. 116/250 cut-off events. For 1448/1448 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 890 event pairs, 54 based on Foata normal form. 1/250 useless extension candidates. Maximal degree in co-relation 948. Up to 195 conditions per place. [2024-06-14 15:42:01,760 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 32 selfloop transitions, 13 changer transitions 0/49 dead transitions. [2024-06-14 15:42:01,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 49 transitions, 365 flow [2024-06-14 15:42:01,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-14 15:42:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-14 15:42:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 85 transitions. [2024-06-14 15:42:01,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36796536796536794 [2024-06-14 15:42:01,762 INFO L175 Difference]: Start difference. First operand has 58 places, 40 transitions, 240 flow. Second operand 7 states and 85 transitions. [2024-06-14 15:42:01,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 49 transitions, 365 flow [2024-06-14 15:42:01,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 331 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-06-14 15:42:01,765 INFO L231 Difference]: Finished difference. Result has 60 places, 42 transitions, 258 flow [2024-06-14 15:42:01,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=60, PETRI_TRANSITIONS=42} [2024-06-14 15:42:01,766 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2024-06-14 15:42:01,766 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 42 transitions, 258 flow [2024-06-14 15:42:01,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 15:42:01,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:01,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:01,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-14 15:42:01,767 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:01,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash -916684494, now seen corresponding path program 1 times [2024-06-14 15:42:01,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:01,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532169473] [2024-06-14 15:42:01,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:02,038 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-14 15:42:02,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:02,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532169473] [2024-06-14 15:42:02,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532169473] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:02,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:02,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-14 15:42:02,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014947285] [2024-06-14 15:42:02,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:02,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-14 15:42:02,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:02,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-14 15:42:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-14 15:42:02,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 33 [2024-06-14 15:42:02,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 42 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-14 15:42:02,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:02,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 33 [2024-06-14 15:42:02,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:02,170 INFO L124 PetriNetUnfolderBase]: 34/106 cut-off events. [2024-06-14 15:42:02,170 INFO L125 PetriNetUnfolderBase]: For 408/413 co-relation queries the response was YES. [2024-06-14 15:42:02,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 106 events. 34/106 cut-off events. For 408/413 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 414 event pairs, 10 based on Foata normal form. 11/112 useless extension candidates. Maximal degree in co-relation 340. Up to 36 conditions per place. [2024-06-14 15:42:02,171 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 14 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2024-06-14 15:42:02,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 35 transitions, 259 flow [2024-06-14 15:42:02,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-14 15:42:02,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-14 15:42:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-06-14 15:42:02,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48484848484848486 [2024-06-14 15:42:02,173 INFO L175 Difference]: Start difference. First operand has 60 places, 42 transitions, 258 flow. Second operand 5 states and 80 transitions. [2024-06-14 15:42:02,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 35 transitions, 259 flow [2024-06-14 15:42:02,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 35 transitions, 225 flow, removed 3 selfloop flow, removed 6 redundant places. [2024-06-14 15:42:02,175 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 193 flow [2024-06-14 15:42:02,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2024-06-14 15:42:02,176 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 20 predicate places. [2024-06-14 15:42:02,176 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 193 flow [2024-06-14 15:42:02,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-14 15:42:02,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:02,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:02,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-14 15:42:02,177 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:02,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash -866170, now seen corresponding path program 1 times [2024-06-14 15:42:02,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:02,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234845646] [2024-06-14 15:42:02,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:02,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:07,664 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-14 15:42:07,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:07,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234845646] [2024-06-14 15:42:07,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234845646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:07,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:07,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:07,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793425889] [2024-06-14 15:42:07,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:07,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:07,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:07,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:07,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:07,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:42:07,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 193 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:07,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:07,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:42:07,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:08,072 INFO L124 PetriNetUnfolderBase]: 51/141 cut-off events. [2024-06-14 15:42:08,073 INFO L125 PetriNetUnfolderBase]: For 373/373 co-relation queries the response was YES. [2024-06-14 15:42:08,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 141 events. 51/141 cut-off events. For 373/373 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 550 event pairs, 3 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 450. Up to 66 conditions per place. [2024-06-14 15:42:08,074 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 29 selfloop transitions, 14 changer transitions 7/54 dead transitions. [2024-06-14 15:42:08,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 367 flow [2024-06-14 15:42:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-14 15:42:08,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-14 15:42:08,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2024-06-14 15:42:08,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3569023569023569 [2024-06-14 15:42:08,075 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 193 flow. Second operand 9 states and 106 transitions. [2024-06-14 15:42:08,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 367 flow [2024-06-14 15:42:08,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 355 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 15:42:08,077 INFO L231 Difference]: Finished difference. Result has 60 places, 35 transitions, 237 flow [2024-06-14 15:42:08,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=237, PETRI_PLACES=60, PETRI_TRANSITIONS=35} [2024-06-14 15:42:08,078 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 28 predicate places. [2024-06-14 15:42:08,078 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 237 flow [2024-06-14 15:42:08,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:08,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:08,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:08,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-06-14 15:42:08,079 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:08,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:08,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2079900820, now seen corresponding path program 2 times [2024-06-14 15:42:08,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:08,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389248186] [2024-06-14 15:42:08,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:08,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:13,490 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-14 15:42:13,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:13,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389248186] [2024-06-14 15:42:13,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389248186] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:13,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:13,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:13,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784099999] [2024-06-14 15:42:13,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:13,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:13,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:13,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:13,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:13,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:42:13,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 35 transitions, 237 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:13,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:13,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:42:13,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:13,982 INFO L124 PetriNetUnfolderBase]: 43/127 cut-off events. [2024-06-14 15:42:13,982 INFO L125 PetriNetUnfolderBase]: For 491/491 co-relation queries the response was YES. [2024-06-14 15:42:13,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 127 events. 43/127 cut-off events. For 491/491 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 470 event pairs, 1 based on Foata normal form. 2/129 useless extension candidates. Maximal degree in co-relation 457. Up to 41 conditions per place. [2024-06-14 15:42:13,984 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 24 selfloop transitions, 11 changer transitions 10/49 dead transitions. [2024-06-14 15:42:13,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 49 transitions, 365 flow [2024-06-14 15:42:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:13,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:13,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2024-06-14 15:42:13,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3522727272727273 [2024-06-14 15:42:13,985 INFO L175 Difference]: Start difference. First operand has 60 places, 35 transitions, 237 flow. Second operand 8 states and 93 transitions. [2024-06-14 15:42:13,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 49 transitions, 365 flow [2024-06-14 15:42:13,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 49 transitions, 331 flow, removed 4 selfloop flow, removed 7 redundant places. [2024-06-14 15:42:13,988 INFO L231 Difference]: Finished difference. Result has 59 places, 32 transitions, 204 flow [2024-06-14 15:42:13,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=204, PETRI_PLACES=59, PETRI_TRANSITIONS=32} [2024-06-14 15:42:13,989 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2024-06-14 15:42:13,989 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 32 transitions, 204 flow [2024-06-14 15:42:13,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:13,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:13,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:13,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-06-14 15:42:13,990 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:13,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2082757780, now seen corresponding path program 3 times [2024-06-14 15:42:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:13,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615790283] [2024-06-14 15:42:13,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:13,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:19,056 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-14 15:42:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:19,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615790283] [2024-06-14 15:42:19,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615790283] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:19,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072704972] [2024-06-14 15:42:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:19,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:19,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:19,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:42:19,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 32 transitions, 204 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:19,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:19,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:42:19,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:19,404 INFO L124 PetriNetUnfolderBase]: 28/102 cut-off events. [2024-06-14 15:42:19,404 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2024-06-14 15:42:19,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 102 events. 28/102 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 373 event pairs, 1 based on Foata normal form. 2/104 useless extension candidates. Maximal degree in co-relation 344. Up to 29 conditions per place. [2024-06-14 15:42:19,405 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 18 selfloop transitions, 6 changer transitions 14/42 dead transitions. [2024-06-14 15:42:19,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 42 transitions, 304 flow [2024-06-14 15:42:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:19,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 88 transitions. [2024-06-14 15:42:19,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3333333333333333 [2024-06-14 15:42:19,408 INFO L175 Difference]: Start difference. First operand has 59 places, 32 transitions, 204 flow. Second operand 8 states and 88 transitions. [2024-06-14 15:42:19,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 42 transitions, 304 flow [2024-06-14 15:42:19,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 42 transitions, 278 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-06-14 15:42:19,411 INFO L231 Difference]: Finished difference. Result has 57 places, 24 transitions, 129 flow [2024-06-14 15:42:19,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=129, PETRI_PLACES=57, PETRI_TRANSITIONS=24} [2024-06-14 15:42:19,412 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2024-06-14 15:42:19,412 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 24 transitions, 129 flow [2024-06-14 15:42:19,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:19,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:19,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:19,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-14 15:42:19,413 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:19,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1931279212, now seen corresponding path program 4 times [2024-06-14 15:42:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:19,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655530457] [2024-06-14 15:42:19,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:19,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:24,759 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-14 15:42:24,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:24,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655530457] [2024-06-14 15:42:24,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655530457] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:24,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:24,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:24,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111676689] [2024-06-14 15:42:24,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:24,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:24,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:24,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:24,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:24,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:42:24,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 24 transitions, 129 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:24,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:24,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:42:24,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:25,000 INFO L124 PetriNetUnfolderBase]: 15/65 cut-off events. [2024-06-14 15:42:25,000 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2024-06-14 15:42:25,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 65 events. 15/65 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 156 event pairs, 1 based on Foata normal form. 2/67 useless extension candidates. Maximal degree in co-relation 208. Up to 19 conditions per place. [2024-06-14 15:42:25,000 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 12 selfloop transitions, 3 changer transitions 13/32 dead transitions. [2024-06-14 15:42:25,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 32 transitions, 203 flow [2024-06-14 15:42:25,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:25,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2024-06-14 15:42:25,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2024-06-14 15:42:25,002 INFO L175 Difference]: Start difference. First operand has 57 places, 24 transitions, 129 flow. Second operand 8 states and 84 transitions. [2024-06-14 15:42:25,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 32 transitions, 203 flow [2024-06-14 15:42:25,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 32 transitions, 183 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-06-14 15:42:25,004 INFO L231 Difference]: Finished difference. Result has 49 places, 18 transitions, 81 flow [2024-06-14 15:42:25,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=81, PETRI_PLACES=49, PETRI_TRANSITIONS=18} [2024-06-14 15:42:25,004 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 17 predicate places. [2024-06-14 15:42:25,004 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 18 transitions, 81 flow [2024-06-14 15:42:25,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:25,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 15:42:25,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:25,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-14 15:42:25,005 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 15:42:25,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 15:42:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash -206783340, now seen corresponding path program 5 times [2024-06-14 15:42:25,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 15:42:25,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755550455] [2024-06-14 15:42:25,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 15:42:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 15:42:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 15:42:30,753 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-14 15:42:30,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 15:42:30,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755550455] [2024-06-14 15:42:30,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755550455] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 15:42:30,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 15:42:30,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-06-14 15:42:30,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302125240] [2024-06-14 15:42:30,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 15:42:30,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-14 15:42:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 15:42:30,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-14 15:42:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-06-14 15:42:30,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 33 [2024-06-14 15:42:30,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 18 transitions, 81 flow. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:30,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 15:42:30,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 33 [2024-06-14 15:42:30,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 15:42:30,971 INFO L124 PetriNetUnfolderBase]: 5/29 cut-off events. [2024-06-14 15:42:30,971 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-06-14 15:42:30,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 29 events. 5/29 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 21 event pairs, 0 based on Foata normal form. 2/31 useless extension candidates. Maximal degree in co-relation 80. Up to 7 conditions per place. [2024-06-14 15:42:30,972 INFO L140 encePairwiseOnDemand]: 26/33 looper letters, 0 selfloop transitions, 0 changer transitions 21/21 dead transitions. [2024-06-14 15:42:30,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 21 transitions, 107 flow [2024-06-14 15:42:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-14 15:42:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-14 15:42:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2024-06-14 15:42:30,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2803030303030303 [2024-06-14 15:42:30,973 INFO L175 Difference]: Start difference. First operand has 49 places, 18 transitions, 81 flow. Second operand 8 states and 74 transitions. [2024-06-14 15:42:30,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 21 transitions, 107 flow [2024-06-14 15:42:30,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 21 transitions, 83 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-06-14 15:42:30,973 INFO L231 Difference]: Finished difference. Result has 36 places, 0 transitions, 0 flow [2024-06-14 15:42:30,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=36, PETRI_TRANSITIONS=0} [2024-06-14 15:42:30,974 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-06-14 15:42:30,974 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 0 transitions, 0 flow [2024-06-14 15:42:30,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 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-14 15:42:30,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 15:42:30,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 15:42:30,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 15:42:30,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 15:42:30,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-14 15:42:30,978 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 15:42:30,980 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 15:42:30,980 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 15:42:30,983 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 15:42:30,983 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 15:42:30,984 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 03:42:30 BasicIcfg [2024-06-14 15:42:30,984 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 15:42:30,985 INFO L158 Benchmark]: Toolchain (without parser) took 85189.64ms. Allocated memory was 186.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 119.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-06-14 15:42:30,985 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 186.6MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 15:42:30,985 INFO L158 Benchmark]: Witness Parser took 1.67ms. Allocated memory is still 186.6MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 15:42:30,985 INFO L158 Benchmark]: CACSL2BoogieTranslator took 885.21ms. Allocated memory is still 186.6MB. Free memory was 118.5MB in the beginning and 64.0MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-06-14 15:42:30,985 INFO L158 Benchmark]: Boogie Procedure Inliner took 217.45ms. Allocated memory was 186.6MB in the beginning and 266.3MB in the end (delta: 79.7MB). Free memory was 64.0MB in the beginning and 220.7MB in the end (delta: -156.7MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2024-06-14 15:42:30,986 INFO L158 Benchmark]: Boogie Preprocessor took 192.43ms. Allocated memory is still 266.3MB. Free memory was 220.7MB in the beginning and 213.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-06-14 15:42:30,986 INFO L158 Benchmark]: RCFGBuilder took 1316.49ms. Allocated memory is still 266.3MB. Free memory was 213.3MB in the beginning and 118.6MB in the end (delta: 94.8MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. [2024-06-14 15:42:30,986 INFO L158 Benchmark]: TraceAbstraction took 82570.29ms. Allocated memory was 266.3MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 117.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 15:42:30,987 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 186.6MB. Free memory is still 151.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 1.67ms. Allocated memory is still 186.6MB. Free memory is still 127.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 885.21ms. Allocated memory is still 186.6MB. Free memory was 118.5MB in the beginning and 64.0MB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 217.45ms. Allocated memory was 186.6MB in the beginning and 266.3MB in the end (delta: 79.7MB). Free memory was 64.0MB in the beginning and 220.7MB in the end (delta: -156.7MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 192.43ms. Allocated memory is still 266.3MB. Free memory was 220.7MB in the beginning and 213.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1316.49ms. Allocated memory is still 266.3MB. Free memory was 213.3MB in the beginning and 118.6MB in the end (delta: 94.8MB). Peak memory consumption was 117.4MB. Max. memory is 16.1GB. * TraceAbstraction took 82570.29ms. Allocated memory was 266.3MB in the beginning and 1.3GB in the end (delta: 1.0GB). Free memory was 117.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 837]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 838]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 53 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 82.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 508 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 409 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2456 IncrementalHoareTripleChecker+Invalid, 2538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 30 mSDtfsCounter, 2456 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=11, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 75.2s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 214 ConstructedInterpolants, 0 QuantifiedInterpolants, 9341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-14 15:42:31,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE