./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a4c57e3 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/safe029_power.oepc_pso.oepc_rmo.oepc.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.positions.where.we.compute.the.hoare.annotation None --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-4a4c57e-m [2024-09-08 17:29:19,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-08 17:29:19,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-08 17:29:19,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-08 17:29:19,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-08 17:29:19,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-08 17:29:19,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-08 17:29:19,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-08 17:29:19,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-08 17:29:19,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-08 17:29:19,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-08 17:29:19,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-08 17:29:19,892 INFO L153 SettingsManager]: * Use SBE=true [2024-09-08 17:29:19,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-08 17:29:19,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-08 17:29:19,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-08 17:29:19,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-08 17:29:19,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-08 17:29:19,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-08 17:29:19,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-08 17:29:19,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-08 17:29:19,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-08 17:29:19,900 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-08 17:29:19,900 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-08 17:29:19,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-08 17:29:19,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-08 17:29:19,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-08 17:29:19,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-08 17:29:19,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-08 17:29:19,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-08 17:29:19,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 17:29:19,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-08 17:29:19,902 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-08 17:29:19,902 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-08 17:29:19,902 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-08 17:29:19,902 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-08 17:29:19,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-08 17:29:19,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-08 17:29:19,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-08 17:29:19,904 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-08 17:29:19,905 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-08 17:29:19,905 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: Positions where we compute the Hoare Annotation -> None Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-09-08 17:29:20,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-08 17:29:20,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-08 17:29:20,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-08 17:29:20,169 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-08 17:29:20,170 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-08 17:29:20,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/./goblint.2024-09-02_08-21-23.files/mutex-meet-local/safe029_power.oepc_pso.oepc_rmo.oepc.yml/witness.yml [2024-09-08 17:29:20,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-08 17:29:20,410 INFO L274 PluginConnector]: CDTParser initialized [2024-09-08 17:29:20,411 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-09-08 17:29:21,957 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-08 17:29:22,206 INFO L384 CDTParser]: Found 1 translation units. [2024-09-08 17:29:22,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-09-08 17:29:22,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/def544272/77fd27929fa74e2a86837f4512c87dfe/FLAGfe96c7ee3 [2024-09-08 17:29:22,240 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/def544272/77fd27929fa74e2a86837f4512c87dfe [2024-09-08 17:29:22,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-08 17:29:22,242 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-08 17:29:22,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-08 17:29:22,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-08 17:29:22,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-08 17:29:22,249 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 05:29:20" (1/2) ... [2024-09-08 17:29:22,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa2d388 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 05:29:22, skipping insertion in model container [2024-09-08 17:29:22,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 05:29:20" (1/2) ... [2024-09-08 17:29:22,250 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14f2935c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 08.09 05:29:22, skipping insertion in model container [2024-09-08 17:29:22,251 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:29:22" (2/2) ... [2024-09-08 17:29:22,251 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa2d388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:22, skipping insertion in model container [2024-09-08 17:29:22,251 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 05:29:22" (2/2) ... [2024-09-08 17:29:22,663 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-08 17:29:22,665 INFO L1541 ArrayList]: Location invariant before [L768-L768] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,665 INFO L1541 ArrayList]: Location invariant before [L762-L762] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,666 INFO L1541 ArrayList]: Location invariant before [L795-L795] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,666 INFO L1541 ArrayList]: Location invariant before [L755-L755] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,666 INFO L1541 ArrayList]: Location invariant before [L775-L775] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,666 INFO L1541 ArrayList]: Location invariant before [L806-L806] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,667 INFO L1541 ArrayList]: Location invariant before [L748-L748] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,667 INFO L1541 ArrayList]: Location invariant before [L765-L765] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,667 INFO L1541 ArrayList]: Location invariant before [L799-L799] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,667 INFO L1541 ArrayList]: Location invariant before [L745-L745] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,668 INFO L1541 ArrayList]: Location invariant before [L734-L734] ((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((1LL + (long long )y$r_buff0_thd1) - (long long )y$w_buff0 >= 0LL)) && ((1LL + (long long )y$r_buff1_thd1) - (long long )y$w_buff1 >= 0LL)) && ((0LL - (long long )y$flush_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff0_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd0) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$r_buff1_thd2) - (long long )y$w_buff1_used >= 0LL)) && ((0LL - (long long )y$read_delayed) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff0_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$r_buff1_thd1) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )y$w_buff0_used) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )y$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$mem_tmp) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff0) - (long long )y$w_buff1_used >= 0LL)) && ((2LL - (long long )y$w_buff1) - (long long )y$w_buff1_used >= 0LL)) && ((long long )__unbuffered_cnt - (long long )y$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )x - (long long )y$w_buff1_used >= 0LL)) && ((long long )y - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$flush_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$mem_tmp - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff0_used >= 0LL)) && ((long long )y$r_buff0_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff0_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$r_buff1_thd2 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$read_delayed - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff0_used - (long long )y$w_buff1_used >= 0LL)) && ((long long )y$w_buff1 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )y$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )y$w_buff1_used >= 0LL)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0 || y$w_buff0 == 2)) && (y$w_buff1 == 0 || y$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((y == 0 || y == 1) || y == 2)) && ((y$mem_tmp == 0 || y$mem_tmp == 1) || y$mem_tmp == 2) [2024-09-08 17:29:22,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-08 17:29:22,888 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2024-09-08 17:29:23,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 17:29:23,056 INFO L200 MainTranslator]: Completed pre-run [2024-09-08 17:29:23,068 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/safe029_power.oepc_pso.oepc_rmo.oepc.i[970,983] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-09-08 17:29:23,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-08 17:29:23,332 INFO L204 MainTranslator]: Completed translation [2024-09-08 17:29:23,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23 WrapperNode [2024-09-08 17:29:23,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-08 17:29:23,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-08 17:29:23,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-08 17:29:23,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-08 17:29:23,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,439 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-09-08 17:29:23,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-08 17:29:23,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-08 17:29:23,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-08 17:29:23,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-08 17:29:23,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,457 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,457 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,485 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-08 17:29:23,509 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-08 17:29:23,509 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-08 17:29:23,509 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-08 17:29:23,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (1/1) ... [2024-09-08 17:29:23,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-08 17:29:23,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 17:29:23,542 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-09-08 17:29:23,545 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-09-08 17:29:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-08 17:29:23,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-08 17:29:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-08 17:29:23,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-08 17:29:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-08 17:29:23,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-08 17:29:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-08 17:29:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-08 17:29:23,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-08 17:29:23,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-08 17:29:23,585 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-08 17:29:23,700 INFO L242 CfgBuilder]: Building ICFG [2024-09-08 17:29:23,702 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-08 17:29:24,518 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-08 17:29:24,519 INFO L291 CfgBuilder]: Performing block encoding [2024-09-08 17:29:24,990 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-08 17:29:24,990 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-08 17:29:24,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:29:24 BoogieIcfgContainer [2024-09-08 17:29:24,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-08 17:29:24,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-08 17:29:24,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-08 17:29:24,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-08 17:29:24,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 08.09 05:29:20" (1/4) ... [2024-09-08 17:29:24,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762bab08 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 08.09 05:29:24, skipping insertion in model container [2024-09-08 17:29:24,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 05:29:22" (2/4) ... [2024-09-08 17:29:25,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762bab08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:29:24, skipping insertion in model container [2024-09-08 17:29:25,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 05:29:23" (3/4) ... [2024-09-08 17:29:25,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@762bab08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 05:29:25, skipping insertion in model container [2024-09-08 17:29:25,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 05:29:24" (4/4) ... [2024-09-08 17:29:25,002 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc_pso.oepc_rmo.oepc.i [2024-09-08 17:29:25,017 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-08 17:29:25,018 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-09-08 17:29:25,018 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-08 17:29:25,169 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-08 17:29:25,210 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 17:29:25,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 17:29:25,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 17:29:25,213 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-09-08 17:29:25,215 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-09-08 17:29:25,245 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 17:29:25,259 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-09-08 17:29:25,267 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@b4c332e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 17:29:25,267 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-08 17:29:25,628 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-08 17:29:25,633 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash -820250320, now seen corresponding path program 1 times [2024-09-08 17:29:25,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208798006] [2024-09-08 17:29:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:25,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:27,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:27,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208798006] [2024-09-08 17:29:27,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208798006] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:27,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:27,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 17:29:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336458218] [2024-09-08 17:29:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:27,486 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 17:29:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 17:29:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 17:29:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:27,513 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:27,515 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-09-08 17:29:27,515 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:27,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:27,774 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-08 17:29:27,774 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-08 17:29:27,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:27,775 INFO L85 PathProgramCache]: Analyzing trace with hash 342044281, now seen corresponding path program 1 times [2024-09-08 17:29:27,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:27,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588910767] [2024-09-08 17:29:27,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:27,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:28,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:28,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588910767] [2024-09-08 17:29:28,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588910767] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:28,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:28,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 17:29:28,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070494068] [2024-09-08 17:29:28,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:28,681 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 17:29:28,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:28,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 17:29:28,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-08 17:29:28,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:28,683 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:28,684 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-09-08 17:29:28,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:28,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:29,076 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-08 17:29:29,077 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-08 17:29:29,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:29,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2013438546, now seen corresponding path program 1 times [2024-09-08 17:29:29,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:29,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676423686] [2024-09-08 17:29:29,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:29,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676423686] [2024-09-08 17:29:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676423686] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:30,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 17:29:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172323217] [2024-09-08 17:29:30,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:30,447 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 17:29:30,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:30,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 17:29:30,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-08 17:29:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:30,451 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:30,451 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-09-08 17:29:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:30,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:31,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:31,339 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-08 17:29:31,340 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-08 17:29:31,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:31,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1065503031, now seen corresponding path program 1 times [2024-09-08 17:29:31,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:31,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755658071] [2024-09-08 17:29:31,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:31,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:32,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:32,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755658071] [2024-09-08 17:29:32,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755658071] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:32,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:32,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-08 17:29:32,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131539703] [2024-09-08 17:29:32,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:32,470 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-08 17:29:32,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:32,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-08 17:29:32,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-08 17:29:32,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:32,472 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:32,472 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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-09-08 17:29:32,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:32,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:32,472 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:32,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:32,728 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-08 17:29:32,728 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-08 17:29:32,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:32,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1066158433, now seen corresponding path program 1 times [2024-09-08 17:29:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:32,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545529852] [2024-09-08 17:29:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545529852] [2024-09-08 17:29:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545529852] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:33,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:33,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-08 17:29:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261377239] [2024-09-08 17:29:33,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:33,350 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 17:29:33,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 17:29:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 17:29:33,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:33,351 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:33,351 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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-09-08 17:29:33,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:33,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:33,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:33,351 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:33,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:36,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:36,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:36,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:36,104 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-08 17:29:36,105 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-08 17:29:36,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash -230010782, now seen corresponding path program 1 times [2024-09-08 17:29:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:36,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223838528] [2024-09-08 17:29:36,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:37,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:37,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223838528] [2024-09-08 17:29:37,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223838528] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:37,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:37,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 17:29:37,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820157977] [2024-09-08 17:29:37,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:37,843 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 17:29:37,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:37,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 17:29:37,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-08 17:29:37,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:37,844 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:37,844 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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-09-08 17:29:37,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:37,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:37,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:37,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:37,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:37,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:38,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:38,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:38,697 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-08 17:29:38,698 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-08 17:29:38,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1276830055, now seen corresponding path program 1 times [2024-09-08 17:29:38,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:38,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283001106] [2024-09-08 17:29:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:38,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283001106] [2024-09-08 17:29:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283001106] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:40,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 17:29:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092513211] [2024-09-08 17:29:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:40,571 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 17:29:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 17:29:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-09-08 17:29:40,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:40,573 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:40,574 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-09-08 17:29:40,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:40,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:40,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:40,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:40,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:40,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:40,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:41,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:41,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:41,982 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-08 17:29:41,982 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-08 17:29:41,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1472853179, now seen corresponding path program 1 times [2024-09-08 17:29:41,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:41,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162098923] [2024-09-08 17:29:41,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:41,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:44,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:44,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162098923] [2024-09-08 17:29:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162098923] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:44,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:44,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 17:29:44,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392777283] [2024-09-08 17:29:44,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:44,065 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 17:29:44,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:44,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 17:29:44,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-09-08 17:29:44,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:44,066 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:44,066 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-09-08 17:29:44,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:44,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:44,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:44,066 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:44,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:44,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:44,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:44,067 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:45,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:45,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:45,130 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-09-08 17:29:45,130 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-09-08 17:29:45,130 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-09-08 17:29:45,130 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 4 remaining) [2024-09-08 17:29:45,131 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-08 17:29:45,136 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-08 17:29:45,137 INFO L312 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE (1/3) [2024-09-08 17:29:45,140 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 17:29:45,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-08 17:29:45,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-08 17:29:45,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-09-08 17:29:45,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-09-08 17:29:45,167 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-08 17:29:45,167 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-08 17:29:45,168 INFO L336 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@b4c332e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-08 17:29:45,168 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-08 17:29:45,358 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:45,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:45,359 INFO L85 PathProgramCache]: Analyzing trace with hash 2013436482, now seen corresponding path program 1 times [2024-09-08 17:29:45,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:45,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284335575] [2024-09-08 17:29:45,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:46,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:46,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284335575] [2024-09-08 17:29:46,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284335575] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:46,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:46,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-08 17:29:46,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778856523] [2024-09-08 17:29:46,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:46,299 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-08 17:29:46,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:46,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-08 17:29:46,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-08 17:29:46,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:46,300 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:46,300 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-09-08 17:29:46,300 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:46,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:46,475 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-08 17:29:46,475 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:46,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:46,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2007916213, now seen corresponding path program 1 times [2024-09-08 17:29:46,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:46,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253217919] [2024-09-08 17:29:46,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:46,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:47,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:47,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253217919] [2024-09-08 17:29:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253217919] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:47,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:47,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 17:29:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727666358] [2024-09-08 17:29:47,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:47,092 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 17:29:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:47,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 17:29:47,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-08 17:29:47,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:47,093 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:47,093 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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-09-08 17:29:47,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:47,093 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:47,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:47,405 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-08 17:29:47,405 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:47,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:47,405 INFO L85 PathProgramCache]: Analyzing trace with hash -2115796252, now seen corresponding path program 1 times [2024-09-08 17:29:47,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:47,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432730748] [2024-09-08 17:29:47,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:47,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:48,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:48,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432730748] [2024-09-08 17:29:48,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432730748] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:48,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:48,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 17:29:48,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278234122] [2024-09-08 17:29:48,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:48,517 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 17:29:48,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:48,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 17:29:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-08 17:29:48,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:48,519 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:48,519 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-09-08 17:29:48,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:48,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:48,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:48,649 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-08 17:29:48,649 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:48,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:48,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1758549114, now seen corresponding path program 1 times [2024-09-08 17:29:48,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:48,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910461041] [2024-09-08 17:29:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:48,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:49,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:49,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910461041] [2024-09-08 17:29:49,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910461041] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:49,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:49,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-08 17:29:49,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116933623] [2024-09-08 17:29:49,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:49,946 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-08 17:29:49,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:49,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-08 17:29:49,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-08 17:29:49,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:49,947 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:49,947 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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-09-08 17:29:49,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:49,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:49,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:49,947 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:50,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:50,147 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-08 17:29:50,147 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:50,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:50,148 INFO L85 PathProgramCache]: Analyzing trace with hash 670961942, now seen corresponding path program 1 times [2024-09-08 17:29:50,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:50,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365414283] [2024-09-08 17:29:50,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:50,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365414283] [2024-09-08 17:29:50,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365414283] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:50,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-08 17:29:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990642267] [2024-09-08 17:29:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:50,403 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-08 17:29:50,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-08 17:29:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-08 17:29:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:50,405 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:50,405 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 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-09-08 17:29:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:50,405 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:50,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:50,666 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-08 17:29:50,667 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:50,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:50,667 INFO L85 PathProgramCache]: Analyzing trace with hash -2043537084, now seen corresponding path program 1 times [2024-09-08 17:29:50,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:50,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75240236] [2024-09-08 17:29:50,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:50,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:50,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:50,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75240236] [2024-09-08 17:29:50,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75240236] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:50,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:50,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-08 17:29:50,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355947260] [2024-09-08 17:29:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:50,954 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-08 17:29:50,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:50,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-08 17:29:50,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-08 17:29:50,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:50,955 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:50,955 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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-09-08 17:29:50,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:50,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:50,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:50,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:50,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:50,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:51,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:51,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:51,693 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-08 17:29:51,693 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:51,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash -48541430, now seen corresponding path program 1 times [2024-09-08 17:29:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077348994] [2024-09-08 17:29:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:51,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:53,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:53,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:53,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077348994] [2024-09-08 17:29:53,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077348994] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:53,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:53,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-08 17:29:53,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234849673] [2024-09-08 17:29:53,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:53,468 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 17:29:53,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:53,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 17:29:53,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-08 17:29:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:53,469 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:53,470 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 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-09-08 17:29:53,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:53,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:53,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:53,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:53,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:53,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:53,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:53,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:53,663 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-08 17:29:53,663 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:53,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1850473278, now seen corresponding path program 1 times [2024-09-08 17:29:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:53,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170164154] [2024-09-08 17:29:53,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:53,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:54,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170164154] [2024-09-08 17:29:54,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170164154] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:54,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:54,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-08 17:29:54,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336608734] [2024-09-08 17:29:54,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:54,345 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-08 17:29:54,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:54,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-08 17:29:54,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-08 17:29:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:54,346 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:54,346 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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-09-08 17:29:54,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:54,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:54,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:54,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:54,346 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:54,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:54,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:54,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:56,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:56,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:56,658 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-08 17:29:56,658 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:56,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 988255670, now seen corresponding path program 2 times [2024-09-08 17:29:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675374419] [2024-09-08 17:29:56,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:56,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:56,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-08 17:29:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-08 17:29:58,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-08 17:29:58,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675374419] [2024-09-08 17:29:58,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675374419] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-08 17:29:58,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-08 17:29:58,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-08 17:29:58,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444022650] [2024-09-08 17:29:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-08 17:29:58,335 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-08 17:29:58,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-08 17:29:58,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-08 17:29:58,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-08 17:29:58,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:58,337 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-08 17:29:58,337 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 8 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-09-08 17:29:58,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:58,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:58,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:58,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:58,337 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:58,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:58,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:58,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:58,338 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-08 17:29:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:58,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-08 17:29:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-08 17:29:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-08 17:29:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-08 17:29:58,790 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-08 17:29:58,791 INFO L399 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-08 17:29:58,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-08 17:29:58,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1379005974, now seen corresponding path program 2 times [2024-09-08 17:29:58,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-08 17:29:58,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707680901] [2024-09-08 17:29:58,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-08 17:29:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-08 17:29:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 17:29:58,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-08 17:29:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-08 17:29:58,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-08 17:29:58,968 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-08 17:29:58,968 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-09-08 17:29:58,968 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-09-08 17:29:58,969 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-09-08 17:29:58,969 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-09-08 17:29:58,969 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-09-08 17:29:58,969 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-09-08 17:29:58,970 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-08 17:29:58,971 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1] [2024-09-08 17:29:58,971 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-09-08 17:29:59,050 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-08 17:29:59,051 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-08 17:29:59,053 INFO L469 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-09-08 17:29:59,053 INFO L470 ceAbstractionStarter]: WitnessConsidered=11 [2024-09-08 17:29:59,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 05:29:59 BasicIcfg [2024-09-08 17:29:59,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-08 17:29:59,056 INFO L158 Benchmark]: Toolchain (without parser) took 36814.02ms. Allocated memory was 172.0MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 109.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 143.5MB. Max. memory is 16.1GB. [2024-09-08 17:29:59,056 INFO L158 Benchmark]: Witness Parser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 17:29:59,056 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-08 17:29:59,056 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1090.25ms. Allocated memory was 172.0MB in the beginning and 220.2MB in the end (delta: 48.2MB). Free memory was 109.9MB in the beginning and 126.2MB in the end (delta: -16.3MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. [2024-09-08 17:29:59,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.49ms. Allocated memory is still 220.2MB. Free memory was 126.2MB in the beginning and 115.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-08 17:29:59,057 INFO L158 Benchmark]: Boogie Preprocessor took 67.53ms. Allocated memory is still 220.2MB. Free memory was 115.8MB in the beginning and 111.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-08 17:29:59,057 INFO L158 Benchmark]: RCFGBuilder took 1481.84ms. Allocated memory is still 220.2MB. Free memory was 111.6MB in the beginning and 84.9MB in the end (delta: 26.7MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2024-09-08 17:29:59,057 INFO L158 Benchmark]: TraceAbstraction took 34061.24ms. Allocated memory was 220.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 84.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-09-08 17:29:59,058 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.19ms. Allocated memory is still 172.0MB. Free memory is still 133.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory is still 111.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1090.25ms. Allocated memory was 172.0MB in the beginning and 220.2MB in the end (delta: 48.2MB). Free memory was 109.9MB in the beginning and 126.2MB in the end (delta: -16.3MB). Peak memory consumption was 53.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.49ms. Allocated memory is still 220.2MB. Free memory was 126.2MB in the beginning and 115.8MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.53ms. Allocated memory is still 220.2MB. Free memory was 115.8MB in the beginning and 111.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1481.84ms. Allocated memory is still 220.2MB. Free memory was 111.6MB in the beginning and 84.9MB in the end (delta: 26.7MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. * TraceAbstraction took 34061.24ms. Allocated memory was 220.2MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 84.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5445, independent: 4433, independent conditional: 3673, independent unconditional: 760, dependent: 1012, dependent conditional: 981, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4553, independent: 4433, independent conditional: 3673, independent unconditional: 760, dependent: 120, dependent conditional: 89, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4553, independent: 4433, independent conditional: 3673, independent unconditional: 760, dependent: 120, dependent conditional: 89, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4838, independent: 4433, independent conditional: 3673, independent unconditional: 760, dependent: 405, dependent conditional: 374, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4838, independent: 4433, independent conditional: 29, independent unconditional: 4404, dependent: 405, dependent conditional: 255, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4838, independent: 4433, independent conditional: 29, independent unconditional: 4404, dependent: 405, dependent conditional: 255, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 853, independent: 784, independent conditional: 9, independent unconditional: 775, dependent: 69, dependent conditional: 38, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 853, independent: 565, independent conditional: 0, independent unconditional: 565, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 288, independent: 219, independent conditional: 9, independent unconditional: 210, dependent: 69, dependent conditional: 38, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 288, independent: 219, independent conditional: 9, independent unconditional: 210, dependent: 69, dependent conditional: 38, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5705, independent: 3898, independent conditional: 157, independent unconditional: 3741, dependent: 1808, dependent conditional: 1159, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4838, independent: 3649, independent conditional: 20, independent unconditional: 3629, dependent: 336, dependent conditional: 217, dependent unconditional: 119, unknown: 853, unknown conditional: 47, unknown unconditional: 806] , Statistics on independence cache: Total cache size (in pairs): 853, Positive cache size: 784, Positive conditional cache size: 9, Positive unconditional cache size: 775, Negative cache size: 69, Negative conditional cache size: 38, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3763, Maximal queried relation: 7, Independence queries for same thread: 892, Persistent sets #1 benchmarks: Persistent set computation time: 4.2s, Number of persistent set computation: 278, Number of trivial persistent sets: 165, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 791, independent: 760, independent conditional: 0, independent unconditional: 760, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 5445, independent: 4433, independent conditional: 3673, independent unconditional: 760, dependent: 1012, dependent conditional: 981, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4553, independent: 4433, independent conditional: 3673, independent unconditional: 760, dependent: 120, dependent conditional: 89, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4553, independent: 4433, independent conditional: 3673, independent unconditional: 760, dependent: 120, dependent conditional: 89, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4838, independent: 4433, independent conditional: 3673, independent unconditional: 760, dependent: 405, dependent conditional: 374, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4838, independent: 4433, independent conditional: 29, independent unconditional: 4404, dependent: 405, dependent conditional: 255, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4838, independent: 4433, independent conditional: 29, independent unconditional: 4404, dependent: 405, dependent conditional: 255, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 853, independent: 784, independent conditional: 9, independent unconditional: 775, dependent: 69, dependent conditional: 38, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 853, independent: 565, independent conditional: 0, independent unconditional: 565, dependent: 288, dependent conditional: 0, dependent unconditional: 288, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 288, independent: 219, independent conditional: 9, independent unconditional: 210, dependent: 69, dependent conditional: 38, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 288, independent: 219, independent conditional: 9, independent unconditional: 210, dependent: 69, dependent conditional: 38, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5705, independent: 3898, independent conditional: 157, independent unconditional: 3741, dependent: 1808, dependent conditional: 1159, dependent unconditional: 648, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4838, independent: 3649, independent conditional: 20, independent unconditional: 3629, dependent: 336, dependent conditional: 217, dependent unconditional: 119, unknown: 853, unknown conditional: 47, unknown unconditional: 806] , Statistics on independence cache: Total cache size (in pairs): 853, Positive cache size: 784, Positive conditional cache size: 9, Positive unconditional cache size: 775, Negative cache size: 69, Negative conditional cache size: 38, Negative unconditional cache size: 31, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3763, Maximal queried relation: 7, Independence queries for same thread: 892 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2111, independent: 1753, independent conditional: 1153, independent unconditional: 600, dependent: 358, dependent conditional: 332, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1804, independent: 1753, independent conditional: 1153, independent unconditional: 600, dependent: 51, dependent conditional: 25, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1804, independent: 1753, independent conditional: 1153, independent unconditional: 600, dependent: 51, dependent conditional: 25, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1944, independent: 1753, independent conditional: 1153, independent unconditional: 600, dependent: 191, dependent conditional: 165, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1944, independent: 1753, independent conditional: 19, independent unconditional: 1734, dependent: 191, dependent conditional: 121, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1944, independent: 1753, independent conditional: 19, independent unconditional: 1734, dependent: 191, dependent conditional: 121, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 668, independent: 614, independent conditional: 3, independent unconditional: 611, dependent: 54, dependent conditional: 28, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 668, independent: 449, independent conditional: 0, independent unconditional: 449, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 219, independent: 165, independent conditional: 3, independent unconditional: 162, dependent: 54, dependent conditional: 28, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 219, independent: 165, independent conditional: 3, independent unconditional: 162, dependent: 54, dependent conditional: 28, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2917, independent: 2251, independent conditional: 23, independent unconditional: 2228, dependent: 666, dependent conditional: 309, dependent unconditional: 357, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1944, independent: 1139, independent conditional: 16, independent unconditional: 1123, dependent: 137, dependent conditional: 93, dependent unconditional: 44, unknown: 668, unknown conditional: 31, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 614, Positive conditional cache size: 3, Positive unconditional cache size: 611, Negative cache size: 54, Negative conditional cache size: 28, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1178, Maximal queried relation: 5, Independence queries for same thread: 307, Persistent sets #1 benchmarks: Persistent set computation time: 2.5s, Number of persistent set computation: 137, Number of trivial persistent sets: 81, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 626, independent: 600, independent conditional: 0, independent unconditional: 600, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2111, independent: 1753, independent conditional: 1153, independent unconditional: 600, dependent: 358, dependent conditional: 332, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1804, independent: 1753, independent conditional: 1153, independent unconditional: 600, dependent: 51, dependent conditional: 25, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1804, independent: 1753, independent conditional: 1153, independent unconditional: 600, dependent: 51, dependent conditional: 25, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1944, independent: 1753, independent conditional: 1153, independent unconditional: 600, dependent: 191, dependent conditional: 165, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1944, independent: 1753, independent conditional: 19, independent unconditional: 1734, dependent: 191, dependent conditional: 121, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1944, independent: 1753, independent conditional: 19, independent unconditional: 1734, dependent: 191, dependent conditional: 121, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 668, independent: 614, independent conditional: 3, independent unconditional: 611, dependent: 54, dependent conditional: 28, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 668, independent: 449, independent conditional: 0, independent unconditional: 449, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 219, independent: 165, independent conditional: 3, independent unconditional: 162, dependent: 54, dependent conditional: 28, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 219, independent: 165, independent conditional: 3, independent unconditional: 162, dependent: 54, dependent conditional: 28, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2917, independent: 2251, independent conditional: 23, independent unconditional: 2228, dependent: 666, dependent conditional: 309, dependent unconditional: 357, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1944, independent: 1139, independent conditional: 16, independent unconditional: 1123, dependent: 137, dependent conditional: 93, dependent unconditional: 44, unknown: 668, unknown conditional: 31, unknown unconditional: 637] , Statistics on independence cache: Total cache size (in pairs): 668, Positive cache size: 614, Positive conditional cache size: 3, Positive unconditional cache size: 611, Negative cache size: 54, Negative conditional cache size: 28, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1178, Maximal queried relation: 5, Independence queries for same thread: 307 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2473; [L791] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L792] 0 pthread_t t2474; [L793] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L734] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L738] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L738] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L745] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L745] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L762] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L762] 2 x = 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L765] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L765] 2 y = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L768] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L775] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1] [L777] 2 return 0; [L748] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L755] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 0 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L797] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L797] RET 0 assume_abort_if_not(main$tmp_guard0) [L799] 0 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L799] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L806] 0 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((1LL + (long long) y$r_buff0_thd1) - (long long) y$w_buff0) >= 0LL)) && (((1LL + (long long) y$r_buff1_thd1) - (long long) y$w_buff1) >= 0LL)) && (((0LL - (long long) y$flush_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff0_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd0) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$r_buff1_thd2) - (long long) y$w_buff1_used) >= 0LL)) && (((0LL - (long long) y$read_delayed) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff0_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$r_buff1_thd1) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) y$w_buff0_used) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) y$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$mem_tmp) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff0) - (long long) y$w_buff1_used) >= 0LL)) && (((2LL - (long long) y$w_buff1) - (long long) y$w_buff1_used) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) y$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) x - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$flush_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$mem_tmp - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff0_used) >= 0LL)) && (((long long) y$r_buff0_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff0_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$r_buff1_thd2 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$read_delayed - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff0_used - (long long) y$w_buff1_used) >= 0LL)) && (((long long) y$w_buff1 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) y$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) y$w_buff1_used) >= 0LL)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && ((y$w_buff0 == 0) || (y$w_buff0 == 2))) && ((y$w_buff1 == 0) || (y$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((y == 0) || (y == 1)) || (y == 2))) && (((y$mem_tmp == 0) || (y$mem_tmp == 1)) || (y$mem_tmp == 2))); [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L811] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L812] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L813] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L814] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L816] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2473=-2, t2474=-1, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 795]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 806]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 793]: 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: 791]: 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: P1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 66 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 8.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: 39, 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.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 3468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 66 locations, 24 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 5.0s, 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: 41, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 4793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-09-08 17:29:59,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-09-08 17:29:59,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-09-08 17:29:59,495 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