./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-08-08_07-59-58.files/mutex-meet-ghost/mix052_tso.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c091e2ee Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i ./goblint.2024-08-08_07-59-58.files/mutex-meet-ghost/mix052_tso.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-c091e2e-m [2024-08-13 16:12:13,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-08-13 16:12:13,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-08-13 16:12:13,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-08-13 16:12:13,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-08-13 16:12:13,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-08-13 16:12:13,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-08-13 16:12:13,875 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-08-13 16:12:13,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-08-13 16:12:13,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-08-13 16:12:13,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-08-13 16:12:13,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-08-13 16:12:13,878 INFO L153 SettingsManager]: * Use SBE=true [2024-08-13 16:12:13,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-08-13 16:12:13,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-08-13 16:12:13,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-08-13 16:12:13,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-08-13 16:12:13,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-08-13 16:12:13,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-08-13 16:12:13,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-08-13 16:12:13,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-08-13 16:12:13,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-08-13 16:12:13,882 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-08-13 16:12:13,882 INFO L153 SettingsManager]: * sizeof long double=12 [2024-08-13 16:12:13,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-08-13 16:12:13,883 INFO L153 SettingsManager]: * Use constant arrays=true [2024-08-13 16:12:13,883 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-08-13 16:12:13,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-08-13 16:12:13,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-08-13 16:12:13,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-08-13 16:12:13,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-13 16:12:13,885 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-08-13 16:12:13,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-08-13 16:12:13,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-08-13 16:12:13,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-08-13 16:12:13,886 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-08-13 16:12:13,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-08-13 16:12:13,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-08-13 16:12:13,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-08-13 16:12:13,889 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-08-13 16:12:13,889 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-08-13 16:12:13,889 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-08-13 16:12:13,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-08-13 16:12:14,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-08-13 16:12:14,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-08-13 16:12:14,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-08-13 16:12:14,153 INFO L270 PluginConnector]: Initializing CDTParser... [2024-08-13 16:12:14,153 INFO L274 PluginConnector]: CDTParser initialized [2024-08-13 16:12:14,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-08-13 16:12:15,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-08-13 16:12:15,869 INFO L384 CDTParser]: Found 1 translation units. [2024-08-13 16:12:15,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i [2024-08-13 16:12:15,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1ad848a0a/062b19e057bc447b82edab0ed33e28e2/FLAG345671cd9 [2024-08-13 16:12:16,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/1ad848a0a/062b19e057bc447b82edab0ed33e28e2 [2024-08-13 16:12:16,213 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-08-13 16:12:16,214 INFO L274 PluginConnector]: Witness Parser initialized [2024-08-13 16:12:16,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-08-08_07-59-58.files/mutex-meet-ghost/mix052_tso.oepc.yml/witness.yml [2024-08-13 16:12:16,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-08-13 16:12:16,440 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-08-13 16:12:16,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-08-13 16:12:16,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-08-13 16:12:16,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-08-13 16:12:16,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 04:12:16" (1/2) ... [2024-08-13 16:12:16,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebaacfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:12:16, skipping insertion in model container [2024-08-13 16:12:16,447 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.08 04:12:16" (1/2) ... [2024-08-13 16:12:16,448 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@71229c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.08 04:12:16, skipping insertion in model container [2024-08-13 16:12:16,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.08 04:12:16" (2/2) ... [2024-08-13 16:12:16,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebaacfa and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:16, skipping insertion in model container [2024-08-13 16:12:16,449 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.08 04:12:16" (2/2) ... [2024-08-13 16:12:16,449 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-08-13 16:12:16,546 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-08-13 16:12:16,547 INFO L97 edCorrectnessWitness]: Location invariant before [L826-L826] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$w_buff1_used) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL) && (long long )x - (long long )x$w_buff1_used >= 0LL) && (long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-08-13 16:12:16,547 INFO L97 edCorrectnessWitness]: Location invariant before [L823-L823] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$w_buff1_used) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL) && (long long )x - (long long )x$w_buff1_used >= 0LL) && (long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-08-13 16:12:16,548 INFO L97 edCorrectnessWitness]: Location invariant before [L825-L825] ((((((((((((((((((! multithreaded || x$r_buff0_thd0 == (_Bool)0) && (! multithreaded || x$read_delayed == (_Bool)0)) && (! multithreaded || x$r_buff1_thd0 == (_Bool)0)) && (! multithreaded || (y == 0 || y == 1))) && (! multithreaded || (x$w_buff0 == 0 || x$w_buff0 == 2))) && (! multithreaded || (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1))) && (! multithreaded || x$r_buff0_thd3 == (_Bool)0)) && (! multithreaded || (z == 0 || z == 1))) && (! multithreaded || ((x == 0 || x == 1) || x == 2))) && (! multithreaded || (x$w_buff1 == 0 || x$w_buff1 == 2))) && (! multithreaded || x$r_buff0_thd1 == (_Bool)0)) && (! multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long )__unbuffered_p1_EAX) + (long long )y >= 0LL && (0LL - (long long )__unbuffered_p2_EAX) + (long long )z >= 0LL) && (0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL) && (0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL) && (0LL - (long long )x$w_buff1_used) + (long long )z >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )main$tmp_guard1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$mem_tmp >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd2 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff0_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )y >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) + (long long )weak$$choice2 >= 0LL) && (1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL) && (1LL - (long long )x) + (long long )x$w_buff0 >= 0LL) && (1LL + (long long )__unbuffered_cnt) - (long long )__unbuffered_p2_EAX >= 0LL) && (1LL + (long long )__unbuffered_p1_EAX) - (long long )__unbuffered_p2_EAX >= 0LL) && (0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff0_thd3) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$r_buff1_thd3) - (long long )x$w_buff1_used >= 0LL) && (0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$flush_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff0_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd0 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd1 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$r_buff1_thd3 >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$read_delayed >= 0LL) && (1LL - (long long )__unbuffered_p2_EAX) - (long long )x$w_buff1_used >= 0LL) && (1LL - (long long )x$w_buff1_used) - (long long )z >= 0LL) && (2LL - (long long )__unbuffered_p2_EAX) - (long long )z >= 0LL) && (long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p1_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )__unbuffered_p2_EAX - (long long )x$w_buff1_used >= 0LL) && (long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL) && (long long )x - (long long )x$w_buff1_used >= 0LL) && (long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL) && (long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff0_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL) && (long long )x$r_buff1_thd3 - (long long )x$w_buff1_used >= 0LL) && (long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL) && (long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL) && (long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL) && (long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL))) && (! multithreaded || (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1))) && (! multithreaded || x$r_buff1_thd1 == (_Bool)0)) && (! multithreaded || 0 <= __unbuffered_cnt)) && (! multithreaded || (((((((((((((((((0 <= __unbuffered_cnt && x$flush_delayed == (_Bool)0) && x$r_buff0_thd0 == (_Bool)0) && x$r_buff0_thd1 == (_Bool)0) && x$r_buff0_thd3 == (_Bool)0) && x$r_buff1_thd0 == (_Bool)0) && x$r_buff1_thd1 == (_Bool)0) && x$r_buff1_thd3 == (_Bool)0) && x$read_delayed == (_Bool)0) && x$read_delayed_var == 0) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (__unbuffered_p2_EAX == 0 || __unbuffered_p2_EAX == 1)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && (y == 0 || y == 1)) && (z == 0 || z == 1)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)))) && (! multithreaded || ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2))) && (! multithreaded || x$read_delayed_var == 0)) && (! multithreaded || x$r_buff1_thd3 == (_Bool)0) [2024-08-13 16:12:16,548 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-08-13 16:12:16,548 INFO L106 edCorrectnessWitness]: ghost_update [L821-L821] multithreaded = 1; [2024-08-13 16:12:16,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-08-13 16:12:16,771 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i[949,962] [2024-08-13 16:12:16,941 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-13 16:12:16,954 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local [2024-08-13 16:12:16,985 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix052_tso.oepc.i[949,962] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-08-13 16:12:17,181 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-08-13 16:12:17,238 INFO L206 MainTranslator]: Completed translation [2024-08-13 16:12:17,239 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17 WrapperNode [2024-08-13 16:12:17,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-08-13 16:12:17,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-08-13 16:12:17,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-08-13 16:12:17,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-08-13 16:12:17,248 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 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,279 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 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,332 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2024-08-13 16:12:17,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-08-13 16:12:17,333 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-08-13 16:12:17,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-08-13 16:12:17,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-08-13 16:12:17,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,376 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-08-13 16:12:17,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-08-13 16:12:17,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-08-13 16:12:17,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-08-13 16:12:17,385 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (1/1) ... [2024-08-13 16:12:17,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-08-13 16:12:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 16:12:17,429 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-08-13 16:12:17,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-08-13 16:12:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-08-13 16:12:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-08-13 16:12:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-08-13 16:12:17,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-08-13 16:12:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-08-13 16:12:17,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-08-13 16:12:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-08-13 16:12:17,468 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-08-13 16:12:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-08-13 16:12:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-08-13 16:12:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-08-13 16:12:17,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-08-13 16:12:17,470 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-08-13 16:12:17,625 INFO L244 CfgBuilder]: Building ICFG [2024-08-13 16:12:17,627 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-08-13 16:12:18,182 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-08-13 16:12:18,183 INFO L293 CfgBuilder]: Performing block encoding [2024-08-13 16:12:18,351 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-08-13 16:12:18,351 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-08-13 16:12:18,352 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 04:12:18 BoogieIcfgContainer [2024-08-13 16:12:18,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-08-13 16:12:18,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-08-13 16:12:18,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-08-13 16:12:18,357 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-08-13 16:12:18,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.08 04:12:16" (1/4) ... [2024-08-13 16:12:18,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cee44e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.08 04:12:18, skipping insertion in model container [2024-08-13 16:12:18,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 13.08 04:12:16" (2/4) ... [2024-08-13 16:12:18,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cee44e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.08 04:12:18, skipping insertion in model container [2024-08-13 16:12:18,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 13.08 04:12:17" (3/4) ... [2024-08-13 16:12:18,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67cee44e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 13.08 04:12:18, skipping insertion in model container [2024-08-13 16:12:18,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.08 04:12:18" (4/4) ... [2024-08-13 16:12:18,363 INFO L112 eAbstractionObserver]: Analyzing ICFG mix052_tso.oepc.i [2024-08-13 16:12:18,380 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-08-13 16:12:18,380 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2024-08-13 16:12:18,380 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-08-13 16:12:18,476 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-08-13 16:12:18,521 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 16:12:18,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-08-13 16:12:18,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-08-13 16:12:18,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-08-13 16:12:18,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-08-13 16:12:18,564 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-08-13 16:12:18,580 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-08-13 16:12:18,589 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=PARTIAL_ORDER_FA, 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;@5a4de2bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-08-13 16:12:18,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-08-13 16:12:18,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:18,872 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash 354753175, now seen corresponding path program 1 times [2024-08-13 16:12:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:18,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547364264] [2024-08-13 16:12:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:18,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:21,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:21,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547364264] [2024-08-13 16:12:21,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547364264] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:21,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:21,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-08-13 16:12:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595869080] [2024-08-13 16:12:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:21,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-08-13 16:12:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:21,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-08-13 16:12:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-08-13 16:12:21,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:21,417 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:21,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:21,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:21,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:21,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-08-13 16:12:21,705 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:21,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:21,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1193171335, now seen corresponding path program 1 times [2024-08-13 16:12:21,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:21,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001523961] [2024-08-13 16:12:21,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:21,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:25,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:25,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001523961] [2024-08-13 16:12:25,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001523961] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:25,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:25,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-13 16:12:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636420330] [2024-08-13 16:12:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:25,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-13 16:12:25,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:25,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-13 16:12:25,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-08-13 16:12:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:25,916 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:25,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:25,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:25,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:26,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:26,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:26,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-08-13 16:12:26,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:26,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 142642259, now seen corresponding path program 1 times [2024-08-13 16:12:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323801538] [2024-08-13 16:12:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:26,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:31,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323801538] [2024-08-13 16:12:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323801538] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:31,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:31,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-13 16:12:31,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446661679] [2024-08-13 16:12:31,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:31,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-13 16:12:31,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:31,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-13 16:12:31,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-08-13 16:12:31,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:31,584 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:31,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:31,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:31,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:31,584 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:32,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:32,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:32,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-08-13 16:12:32,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:32,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:32,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1249625609, now seen corresponding path program 1 times [2024-08-13 16:12:32,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:32,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580158547] [2024-08-13 16:12:32,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:32,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:32,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:32,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:32,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580158547] [2024-08-13 16:12:32,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580158547] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:32,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:32,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 16:12:32,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520134071] [2024-08-13 16:12:32,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:32,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-08-13 16:12:32,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:32,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-08-13 16:12:32,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-08-13 16:12:32,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:32,610 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:32,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:32,610 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:32,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:32,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:32,611 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:32,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:32,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-08-13 16:12:32,924 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:32,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash 883244631, now seen corresponding path program 1 times [2024-08-13 16:12:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641790840] [2024-08-13 16:12:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:32,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641790840] [2024-08-13 16:12:34,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641790840] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:34,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:34,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-08-13 16:12:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111094095] [2024-08-13 16:12:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:34,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-13 16:12:34,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:34,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-13 16:12:34,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-08-13 16:12:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:34,126 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:34,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:34,126 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:34,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:34,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:34,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:34,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:35,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:35,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:35,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-08-13 16:12:35,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:35,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:35,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1276161443, now seen corresponding path program 2 times [2024-08-13 16:12:35,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:35,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744866322] [2024-08-13 16:12:35,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:35,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:36,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:36,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:36,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744866322] [2024-08-13 16:12:36,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744866322] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:36,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:36,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-08-13 16:12:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753677292] [2024-08-13 16:12:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:36,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-08-13 16:12:36,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:36,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-08-13 16:12:36,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-08-13 16:12:36,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:36,433 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:36,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:36,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:36,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:36,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:36,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:36,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:36,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:37,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:37,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:37,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:37,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:37,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:37,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:12:37,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-08-13 16:12:37,048 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:37,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:37,049 INFO L85 PathProgramCache]: Analyzing trace with hash -718102127, now seen corresponding path program 1 times [2024-08-13 16:12:37,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:37,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057698293] [2024-08-13 16:12:37,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:37,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:39,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:39,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057698293] [2024-08-13 16:12:39,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057698293] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:39,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:39,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-08-13 16:12:39,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643913253] [2024-08-13 16:12:39,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:39,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-08-13 16:12:39,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:39,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-08-13 16:12:39,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-08-13 16:12:39,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:39,813 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:39,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:39,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:39,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:39,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:39,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:39,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:39,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:12:39,814 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:41,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:41,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-08-13 16:12:41,014 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:41,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash 360464604, now seen corresponding path program 1 times [2024-08-13 16:12:41,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:41,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197038171] [2024-08-13 16:12:41,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:41,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:45,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:45,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:45,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197038171] [2024-08-13 16:12:45,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197038171] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:45,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:45,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-08-13 16:12:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441021285] [2024-08-13 16:12:45,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:45,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-08-13 16:12:45,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:45,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-08-13 16:12:45,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-08-13 16:12:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:45,198 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:45,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:45,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:45,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:45,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:45,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:45,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:45,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:45,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:45,198 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:12:46,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-08-13 16:12:46,285 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:46,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1830614559, now seen corresponding path program 3 times [2024-08-13 16:12:46,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:46,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282168139] [2024-08-13 16:12:46,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:46,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:46,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-08-13 16:12:46,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:46,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282168139] [2024-08-13 16:12:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282168139] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:46,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-13 16:12:46,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836052002] [2024-08-13 16:12:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:46,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-13 16:12:46,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:46,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-13 16:12:46,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-08-13 16:12:46,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:46,682 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:46,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:46,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:46,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:46,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:46,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:46,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:46,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:46,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:46,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:12:46,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:47,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:47,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:12:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:12:47,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-08-13 16:12:47,183 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:47,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:47,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1656225126, now seen corresponding path program 1 times [2024-08-13 16:12:47,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:47,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063652660] [2024-08-13 16:12:47,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:47,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:49,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:49,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063652660] [2024-08-13 16:12:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063652660] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:49,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:49,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-13 16:12:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660076116] [2024-08-13 16:12:49,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:49,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-13 16:12:49,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:49,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-13 16:12:49,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-08-13 16:12:49,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:49,619 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:49,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:49,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:49,619 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:12:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:12:49,620 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:51,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:12:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:12:51,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:12:51,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-08-13 16:12:51,198 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:51,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2038756500, now seen corresponding path program 1 times [2024-08-13 16:12:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:51,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197180969] [2024-08-13 16:12:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:51,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197180969] [2024-08-13 16:12:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197180969] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:54,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:54,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-08-13 16:12:54,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626761684] [2024-08-13 16:12:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:54,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-08-13 16:12:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:54,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-08-13 16:12:54,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-08-13 16:12:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:54,349 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:54,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:12:54,350 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:12:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:12:55,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:12:55,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:12:55,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-08-13 16:12:55,406 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:55,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:55,407 INFO L85 PathProgramCache]: Analyzing trace with hash 158290514, now seen corresponding path program 1 times [2024-08-13 16:12:55,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:55,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549136560] [2024-08-13 16:12:55,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:12:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:12:57,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:12:57,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549136560] [2024-08-13 16:12:57,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549136560] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:12:57,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:12:57,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-08-13 16:12:57,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52722083] [2024-08-13 16:12:57,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:12:57,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-08-13 16:12:57,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:12:57,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-08-13 16:12:57,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-08-13 16:12:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:57,437 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:12:57,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:12:57,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:12:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:12:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:12:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:12:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:12:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:12:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:12:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:12:58,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:12:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:12:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:12:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:12:58,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-08-13 16:12:58,396 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:12:58,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:12:58,399 INFO L85 PathProgramCache]: Analyzing trace with hash 89941243, now seen corresponding path program 1 times [2024-08-13 16:12:58,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:12:58,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552747405] [2024-08-13 16:12:58,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:12:58,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:12:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:13:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:13:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:13:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552747405] [2024-08-13 16:13:01,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552747405] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:13:01,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:13:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-08-13 16:13:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364115851] [2024-08-13 16:13:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:13:01,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-08-13 16:13:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:13:01,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-08-13 16:13:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-08-13 16:13:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:13:01,509 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:13:01,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:13:01,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:13:01,509 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:01,510 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:13:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:13:02,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:02,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-08-13 16:13:02,528 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:13:02,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:13:02,529 INFO L85 PathProgramCache]: Analyzing trace with hash 2145717817, now seen corresponding path program 1 times [2024-08-13 16:13:02,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:13:02,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509397942] [2024-08-13 16:13:02,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:13:02,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:13:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:13:04,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-08-13 16:13:04,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:13:04,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509397942] [2024-08-13 16:13:04,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509397942] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:13:04,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:13:04,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-08-13 16:13:04,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034953697] [2024-08-13 16:13:04,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:13:04,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-08-13 16:13:04,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:13:04,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-08-13 16:13:04,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-08-13 16:13:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:13:04,666 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:13:04,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:13:04,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:13:04,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:13:04,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:04,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:04,667 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:13:06,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:13:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:13:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:13:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:13:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:13:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:06,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:13:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:13:06,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:13:06,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-08-13 16:13:06,017 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:13:06,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:13:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash 939369956, now seen corresponding path program 1 times [2024-08-13 16:13:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:13:06,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564535073] [2024-08-13 16:13:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:13:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:13:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-08-13 16:13:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-08-13 16:13:07,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-08-13 16:13:07,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564535073] [2024-08-13 16:13:07,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564535073] provided 1 perfect and 0 imperfect interpolant sequences [2024-08-13 16:13:07,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-08-13 16:13:07,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-08-13 16:13:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768244737] [2024-08-13 16:13:07,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-08-13 16:13:07,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-08-13 16:13:07,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-08-13 16:13:07,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-08-13 16:13:07,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-08-13 16:13:07,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:13:07,638 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-08-13 16:13:07,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-08-13 16:13:07,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:13:07,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-08-13 16:13:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-08-13 16:13:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-08-13 16:13:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:13:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-08-13 16:13:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-08-13 16:13:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-08-13 16:13:08,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-08-13 16:13:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-08-13 16:13:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-08-13 16:13:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:13:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-08-13 16:13:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-08-13 16:13:08,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-08-13 16:13:08,481 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 4 more)] === [2024-08-13 16:13:08,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-08-13 16:13:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash -707091191, now seen corresponding path program 4 times [2024-08-13 16:13:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-08-13 16:13:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926262190] [2024-08-13 16:13:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-08-13 16:13:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-08-13 16:13:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 16:13:08,513 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-08-13 16:13:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-08-13 16:13:08,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-08-13 16:13:08,589 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-08-13 16:13:08,590 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-08-13 16:13:08,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 7 remaining) [2024-08-13 16:13:08,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 7 remaining) [2024-08-13 16:13:08,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 7 remaining) [2024-08-13 16:13:08,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-08-13 16:13:08,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-08-13 16:13:08,593 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2024-08-13 16:13:08,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-08-13 16:13:08,600 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-08-13 16:13:08,602 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2024-08-13 16:13:08,606 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-08-13 16:13:08,606 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-08-13 16:13:08,704 INFO L507 ceAbstractionStarter]: Automizer considered 3 witness invariants [2024-08-13 16:13:08,704 INFO L508 ceAbstractionStarter]: WitnessConsidered=3 [2024-08-13 16:13:08,705 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.08 04:13:08 BasicIcfg [2024-08-13 16:13:08,705 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-08-13 16:13:08,706 INFO L158 Benchmark]: Toolchain (without parser) took 52265.31ms. Allocated memory was 190.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 156.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 294.5MB. Max. memory is 16.1GB. [2024-08-13 16:13:08,706 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 132.1MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-08-13 16:13:08,706 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 132.1MB. Free memory was 104.5MB in the beginning and 104.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-08-13 16:13:08,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 798.02ms. Allocated memory is still 190.8MB. Free memory was 156.7MB in the beginning and 110.6MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-08-13 16:13:08,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.96ms. Allocated memory is still 190.8MB. Free memory was 110.6MB in the beginning and 102.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-08-13 16:13:08,707 INFO L158 Benchmark]: Boogie Preprocessor took 50.05ms. Allocated memory is still 190.8MB. Free memory was 102.2MB in the beginning and 99.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-08-13 16:13:08,708 INFO L158 Benchmark]: RCFGBuilder took 967.91ms. Allocated memory is still 190.8MB. Free memory was 99.1MB in the beginning and 87.9MB in the end (delta: 11.2MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2024-08-13 16:13:08,708 INFO L158 Benchmark]: TraceAbstraction took 50351.22ms. Allocated memory was 190.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 86.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 224.7MB. Max. memory is 16.1GB. [2024-08-13 16:13:08,709 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.54ms. Allocated memory is still 132.1MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 132.1MB. Free memory was 104.5MB in the beginning and 104.5MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 798.02ms. Allocated memory is still 190.8MB. Free memory was 156.7MB in the beginning and 110.6MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.96ms. Allocated memory is still 190.8MB. Free memory was 110.6MB in the beginning and 102.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.05ms. Allocated memory is still 190.8MB. Free memory was 102.2MB in the beginning and 99.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 967.91ms. Allocated memory is still 190.8MB. Free memory was 99.1MB in the beginning and 87.9MB in the end (delta: 11.2MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50351.22ms. Allocated memory was 190.8MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 86.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 224.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19429, independent: 18301, independent conditional: 17678, independent unconditional: 623, dependent: 1128, dependent conditional: 1066, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18849, independent: 18301, independent conditional: 17678, independent unconditional: 623, dependent: 548, dependent conditional: 486, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18849, independent: 18301, independent conditional: 17678, independent unconditional: 623, dependent: 548, dependent conditional: 486, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26756, independent: 18301, independent conditional: 1549, independent unconditional: 16752, dependent: 8455, dependent conditional: 6358, dependent unconditional: 2097, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26756, independent: 18301, independent conditional: 1549, independent unconditional: 16752, dependent: 8455, dependent conditional: 3583, dependent unconditional: 4872, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26756, independent: 18301, independent conditional: 1549, independent unconditional: 16752, dependent: 8455, dependent conditional: 3583, dependent unconditional: 4872, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 925, independent: 698, independent conditional: 68, independent unconditional: 630, dependent: 227, dependent conditional: 165, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 925, independent: 586, independent conditional: 0, independent unconditional: 586, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 339, independent: 112, independent conditional: 68, independent unconditional: 44, dependent: 227, dependent conditional: 165, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 339, independent: 112, independent conditional: 68, independent unconditional: 44, dependent: 227, dependent conditional: 165, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3505, independent: 1365, independent conditional: 670, independent unconditional: 694, dependent: 2140, dependent conditional: 1470, dependent unconditional: 670, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 26756, independent: 17603, independent conditional: 1481, independent unconditional: 16122, dependent: 8228, dependent conditional: 3418, dependent unconditional: 4810, unknown: 925, unknown conditional: 233, unknown unconditional: 692] , Statistics on independence cache: Total cache size (in pairs): 925, Positive cache size: 698, Positive conditional cache size: 68, Positive unconditional cache size: 630, Negative cache size: 227, Negative conditional cache size: 165, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2775, Maximal queried relation: 13, Independence queries for same thread: 580 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 1.4s, Number of persistent set computation: 471, Number of trivial persistent sets: 287, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 685, independent: 623, independent conditional: 0, independent unconditional: 623, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19429, independent: 18301, independent conditional: 17678, independent unconditional: 623, dependent: 1128, dependent conditional: 1066, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18849, independent: 18301, independent conditional: 17678, independent unconditional: 623, dependent: 548, dependent conditional: 486, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 18849, independent: 18301, independent conditional: 17678, independent unconditional: 623, dependent: 548, dependent conditional: 486, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26756, independent: 18301, independent conditional: 1549, independent unconditional: 16752, dependent: 8455, dependent conditional: 6358, dependent unconditional: 2097, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26756, independent: 18301, independent conditional: 1549, independent unconditional: 16752, dependent: 8455, dependent conditional: 3583, dependent unconditional: 4872, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26756, independent: 18301, independent conditional: 1549, independent unconditional: 16752, dependent: 8455, dependent conditional: 3583, dependent unconditional: 4872, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 925, independent: 698, independent conditional: 68, independent unconditional: 630, dependent: 227, dependent conditional: 165, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 925, independent: 586, independent conditional: 0, independent unconditional: 586, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 339, independent: 112, independent conditional: 68, independent unconditional: 44, dependent: 227, dependent conditional: 165, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 339, independent: 112, independent conditional: 68, independent unconditional: 44, dependent: 227, dependent conditional: 165, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3505, independent: 1365, independent conditional: 670, independent unconditional: 694, dependent: 2140, dependent conditional: 1470, dependent unconditional: 670, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 26756, independent: 17603, independent conditional: 1481, independent unconditional: 16122, dependent: 8228, dependent conditional: 3418, dependent unconditional: 4810, unknown: 925, unknown conditional: 233, unknown unconditional: 692] , Statistics on independence cache: Total cache size (in pairs): 925, Positive cache size: 698, Positive conditional cache size: 68, Positive unconditional cache size: 630, Negative cache size: 227, Negative conditional cache size: 165, Negative unconditional cache size: 62, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2775, Maximal queried relation: 13, Independence queries for same thread: 580 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t1403; [L821] 0 //@ ghost multithreaded = 1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1403=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L821] FCALL, FORK 0 pthread_create(&t1403, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1403=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L822] 0 pthread_t t1404; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1403=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L823] 0 //@ assert (((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((z == 0) || (z == 1)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) y) >= 0LL) && (((0LL - (long long) __unbuffered_p2_EAX) + (long long) z) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) z) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) weak$$choice2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p2_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p2_EAX) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd3) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd3) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff0_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff1_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff1_used) - (long long) z) >= 0LL)) && (((2LL - (long long) __unbuffered_p2_EAX) - (long long) z) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p2_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)))) && (!multithreaded || ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((((((((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff0_thd3 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$r_buff1_thd3 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))); [L823] FCALL, FORK 0 pthread_create(&t1404, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1403=-1, t1404=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L775] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L824] 0 pthread_t t1405; VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1403=-1, t1404=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L825] 0 //@ assert (((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((z == 0) || (z == 1)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) y) >= 0LL) && (((0LL - (long long) __unbuffered_p2_EAX) + (long long) z) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) z) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) weak$$choice2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p2_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p2_EAX) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd3) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd3) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff0_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff1_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff1_used) - (long long) z) >= 0LL)) && (((2LL - (long long) __unbuffered_p2_EAX) - (long long) z) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p2_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)))) && (!multithreaded || ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((((((((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff0_thd3 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$r_buff1_thd3 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))); [L825] FCALL, FORK 0 pthread_create(&t1405, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1403=-1, t1404=0, t1405=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L792] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L795] 3 __unbuffered_p2_EAX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 return 0; [L826] 0 //@ assert (((((((((((((((((((!multithreaded || (x$r_buff0_thd0 == (_Bool) 0)) && (!multithreaded || (x$read_delayed == (_Bool) 0))) && (!multithreaded || (x$r_buff1_thd0 == (_Bool) 0))) && (!multithreaded || ((y == 0) || (y == 1)))) && (!multithreaded || ((x$w_buff0 == 0) || (x$w_buff0 == 2)))) && (!multithreaded || ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1)))) && (!multithreaded || (x$r_buff0_thd3 == (_Bool) 0))) && (!multithreaded || ((z == 0) || (z == 1)))) && (!multithreaded || (((x == 0) || (x == 1)) || (x == 2)))) && (!multithreaded || ((x$w_buff1 == 0) || (x$w_buff1 == 2)))) && (!multithreaded || (x$r_buff0_thd1 == (_Bool) 0))) && (!multithreaded || (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0LL - (long long) __unbuffered_p1_EAX) + (long long) y) >= 0LL) && (((0LL - (long long) __unbuffered_p2_EAX) + (long long) z) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) z) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) main$tmp_guard1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$mem_tmp) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff0_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd2) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$r_buff1_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff0_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) y) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) weak$$choice0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) + (long long) weak$$choice2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((1LL + (long long) __unbuffered_cnt) - (long long) __unbuffered_p2_EAX) >= 0LL)) && (((1LL + (long long) __unbuffered_p1_EAX) - (long long) __unbuffered_p2_EAX) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd3) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd3) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$flush_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff0_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff0_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff0_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff1_thd0) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff1_thd1) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$r_buff1_thd3) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$read_delayed) >= 0LL)) && (((1LL - (long long) __unbuffered_p2_EAX) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff1_used) - (long long) z) >= 0LL)) && (((2LL - (long long) __unbuffered_p2_EAX) - (long long) z) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p1_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_p2_EAX - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd3 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)))) && (!multithreaded || ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1)))) && (!multithreaded || (x$r_buff1_thd1 == (_Bool) 0))) && (!multithreaded || (0 <= __unbuffered_cnt))) && (!multithreaded || ((((((((((((((((((0 <= __unbuffered_cnt) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff0_thd3 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$r_buff1_thd3 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((__unbuffered_p2_EAX == 0) || (__unbuffered_p2_EAX == 1))) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && ((y == 0) || (y == 1))) && ((z == 0) || (z == 1))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))))) && (!multithreaded || (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2)))) && (!multithreaded || (x$read_delayed_var == 0))) && (!multithreaded || (x$r_buff1_thd3 == (_Bool) 0))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1403=-1, t1404=0, t1405=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 return 0; [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403=-1, t1404=0, t1405=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403=-1, t1404=0, t1405=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1403=-1, t1404=0, t1405=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 823]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 826]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 71 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 50.1s, OverallIterations: 16, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 13.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 168, 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.6s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 17733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-08-13 16:13:08,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-08-13 16:13:08,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE