./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.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.opt_pso.opt_rmo.opt.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e94c40da 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.opt_pso.opt_rmo.opt.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/safe029_power.opt_pso.opt_rmo.opt.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-dev-e94c40d-m [2024-09-23 22:39:55,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-23 22:39:55,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-23 22:39:55,611 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-23 22:39:55,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-23 22:39:55,645 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-23 22:39:55,646 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-23 22:39:55,646 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-23 22:39:55,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-23 22:39:55,647 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-23 22:39:55,647 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-23 22:39:55,648 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-23 22:39:55,648 INFO L153 SettingsManager]: * Use SBE=true [2024-09-23 22:39:55,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-23 22:39:55,649 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-23 22:39:55,649 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-23 22:39:55,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-23 22:39:55,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-23 22:39:55,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-23 22:39:55,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-23 22:39:55,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-23 22:39:55,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-23 22:39:55,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-23 22:39:55,658 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-23 22:39:55,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-23 22:39:55,658 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-23 22:39:55,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-23 22:39:55,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-23 22:39:55,659 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-23 22:39:55,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-23 22:39:55,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-23 22:39:55,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-23 22:39:55,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-23 22:39:55,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-23 22:39:55,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-23 22:39:55,661 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-23 22:39:55,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-23 22:39:55,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-23 22:39:55,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-23 22:39:55,664 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-23 22:39:55,664 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-23 22:39:55,665 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-23 22:39:55,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-23 22:39:55,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-23 22:39:55,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-23 22:39:55,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-23 22:39:55,940 INFO L274 PluginConnector]: CDTParser initialized [2024-09-23 22:39:55,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-09-23 22:39:57,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-23 22:39:57,589 INFO L384 CDTParser]: Found 1 translation units. [2024-09-23 22:39:57,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt_pso.opt_rmo.opt.i [2024-09-23 22:39:57,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7ad09a903/08792f2f82224d8d9308a24055bddafc/FLAG4ac62a372 [2024-09-23 22:39:57,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7ad09a903/08792f2f82224d8d9308a24055bddafc [2024-09-23 22:39:57,625 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-23 22:39:57,627 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-23 22:39:57,628 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.opt_pso.opt_rmo.opt.yml/witness.yml [2024-09-23 22:39:57,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-23 22:39:57,884 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-23 22:39:57,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-23 22:39:57,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-23 22:39:57,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-23 22:39:57,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.09 10:39:57" (1/2) ... [2024-09-23 22:39:57,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a11e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:39:57, skipping insertion in model container [2024-09-23 22:39:57,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.09 10:39:57" (1/2) ... [2024-09-23 22:39:57,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@10c09d46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:39:57, skipping insertion in model container [2024-09-23 22:39:57,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 10:39:57" (2/2) ... [2024-09-23 22:39:57,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a11e2e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:57, skipping insertion in model container [2024-09-23 22:39:57,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 10:39:57" (2/2) ... [2024-09-23 22:39:58,272 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-23 22:39:58,273 INFO L1541 ArrayList]: Location invariant before [L799-L799] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,273 INFO L1541 ArrayList]: Location invariant before [L765-L765] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,273 INFO L1541 ArrayList]: Location invariant before [L737-L737] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,273 INFO L1541 ArrayList]: Location invariant before [L795-L795] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,274 INFO L1541 ArrayList]: Location invariant before [L747-L747] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,274 INFO L1541 ArrayList]: Location invariant before [L775-L775] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,274 INFO L1541 ArrayList]: Location invariant before [L740-L740] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,274 INFO L1541 ArrayList]: Location invariant before [L754-L754] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,275 INFO L1541 ArrayList]: Location invariant before [L734-L734] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,275 INFO L1541 ArrayList]: Location invariant before [L806-L806] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,275 INFO L1541 ArrayList]: Location invariant before [L768-L768] ((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )x$r_buff0_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$r_buff1_thd2) + (long long )x$w_buff1 >= 0LL)) && ((0LL - (long long )x$w_buff1_used) + (long long )y >= 0LL)) && ((1LL - (long long )x) + (long long )x$r_buff0_thd2 >= 0LL)) && ((1LL - (long long )x) + (long long )x$w_buff0 >= 0LL)) && ((0LL - (long long )x$flush_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff0_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd0) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$r_buff1_thd1) - (long long )x$w_buff1_used >= 0LL)) && ((0LL - (long long )x$read_delayed) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )main$tmp_guard1) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff0_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$r_buff1_thd2) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )x$w_buff0_used) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice0) - (long long )x$w_buff1_used >= 0LL)) && ((1LL - (long long )weak$$choice2) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$mem_tmp) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff0) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1) - (long long )x$w_buff1_used >= 0LL)) && ((2LL - (long long )x$w_buff1_used) - (long long )y >= 0LL)) && ((long long )__unbuffered_cnt - (long long )x$w_buff1_used >= 0LL)) && ((long long )main$tmp_guard1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$flush_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$mem_tmp - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$r_buff1_thd2 >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$r_buff0_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$r_buff1_thd2 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$read_delayed - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff0_used >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1 >= 0LL)) && ((long long )x$w_buff0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff0_used - (long long )x$w_buff1_used >= 0LL)) && ((long long )x$w_buff1 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice0 - (long long )x$w_buff1_used >= 0LL)) && ((long long )weak$$choice2 - (long long )x$w_buff1_used >= 0LL)) && (x$flush_delayed == (_Bool)0)) && (x$r_buff0_thd0 == (_Bool)0)) && (x$r_buff0_thd1 == (_Bool)0)) && (x$r_buff1_thd0 == (_Bool)0)) && (x$r_buff1_thd1 == (_Bool)0)) && (x$read_delayed == (_Bool)0)) && (x$read_delayed_var == 0)) && (x$w_buff0 == 0 || x$w_buff0 == 2)) && (x$w_buff1 == 0 || x$w_buff1 == 2)) && ((x == 0 || x == 1) || x == 2)) && ((x$mem_tmp == 0 || x$mem_tmp == 1) || x$mem_tmp == 2)) && ((y == 0 || y == 1) || y == 2) [2024-09-23 22:39:58,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-23 22:39:58,487 WARN L248 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.opt_pso.opt_rmo.opt.i[967,980] [2024-09-23 22:39:58,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-23 22:39:58,685 INFO L200 MainTranslator]: Completed pre-run [2024-09-23 22:39:58,699 WARN L248 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.opt_pso.opt_rmo.opt.i[967,980] 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-23 22:39:58,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-23 22:39:59,030 INFO L204 MainTranslator]: Completed translation [2024-09-23 22:39:59,030 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59 WrapperNode [2024-09-23 22:39:59,031 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-23 22:39:59,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-23 22:39:59,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-23 22:39:59,032 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-23 22:39:59,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,146 INFO L138 Inliner]: procedures = 174, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 135 [2024-09-23 22:39:59,147 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-23 22:39:59,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-23 22:39:59,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-23 22:39:59,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-23 22:39:59,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-23 22:39:59,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-23 22:39:59,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-23 22:39:59,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-23 22:39:59,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (1/1) ... [2024-09-23 22:39:59,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-23 22:39:59,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 22:39:59,293 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-23 22:39:59,296 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-23 22:39:59,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-23 22:39:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-23 22:39:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-23 22:39:59,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-23 22:39:59,350 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-23 22:39:59,350 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-23 22:39:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-23 22:39:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-23 22:39:59,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-23 22:39:59,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-23 22:39:59,353 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-09-23 22:39:59,486 INFO L242 CfgBuilder]: Building ICFG [2024-09-23 22:39:59,489 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-23 22:40:00,299 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-23 22:40:00,299 INFO L291 CfgBuilder]: Performing block encoding [2024-09-23 22:40:00,791 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-23 22:40:00,792 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-23 22:40:00,793 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 10:40:00 BoogieIcfgContainer [2024-09-23 22:40:00,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-23 22:40:00,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-23 22:40:00,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-23 22:40:00,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-23 22:40:00,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.09 10:39:57" (1/4) ... [2024-09-23 22:40:00,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3802b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 10:40:00, skipping insertion in model container [2024-09-23 22:40:00,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 10:39:57" (2/4) ... [2024-09-23 22:40:00,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3802b9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.09 10:40:00, skipping insertion in model container [2024-09-23 22:40:00,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:39:59" (3/4) ... [2024-09-23 22:40:00,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c3802b9 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.09 10:40:00, skipping insertion in model container [2024-09-23 22:40:00,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 10:40:00" (4/4) ... [2024-09-23 22:40:00,803 INFO L112 eAbstractionObserver]: Analyzing ICFG safe029_power.opt_pso.opt_rmo.opt.i [2024-09-23 22:40:00,819 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-23 22:40:00,819 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-09-23 22:40:00,820 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-23 22:40:00,966 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-23 22:40:01,008 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 22:40:01,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-23 22:40:01,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 22:40:01,010 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-23 22:40:01,011 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-23 22:40:01,047 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-23 22:40:01,061 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-09-23 22:40:01,067 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;@55577e93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 22:40:01,068 INFO L337 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-09-23 22:40:01,312 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:40:01,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:01,318 INFO L85 PathProgramCache]: Analyzing trace with hash -906197387, now seen corresponding path program 1 times [2024-09-23 22:40:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:01,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860282217] [2024-09-23 22:40:01,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:01,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:03,062 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-23 22:40:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860282217] [2024-09-23 22:40:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860282217] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:03,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:03,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-23 22:40:03,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152749612] [2024-09-23 22:40:03,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:03,072 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-23 22:40:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:03,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-23 22:40:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-23 22:40:03,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:03,101 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:03,102 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-23 22:40:03,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:03,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:03,432 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-23 22:40:03,432 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:40:03,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1972652531, now seen corresponding path program 1 times [2024-09-23 22:40:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:03,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414217163] [2024-09-23 22:40:03,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:05,015 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-23 22:40:05,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:05,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414217163] [2024-09-23 22:40:05,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414217163] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:05,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:05,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-23 22:40:05,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856651329] [2024-09-23 22:40:05,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:05,017 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 22:40:05,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:05,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 22:40:05,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 22:40:05,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:05,019 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:05,020 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-23 22:40:05,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:05,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:05,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:05,547 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-23 22:40:05,547 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:40:05,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:05,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1022686744, now seen corresponding path program 1 times [2024-09-23 22:40:05,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:05,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533014906] [2024-09-23 22:40:05,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:05,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:06,780 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-23 22:40:06,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:06,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533014906] [2024-09-23 22:40:06,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533014906] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:06,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:06,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-23 22:40:06,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552791030] [2024-09-23 22:40:06,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:06,782 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 22:40:06,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:06,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 22:40:06,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-23 22:40:06,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:06,783 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:06,783 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-23 22:40:06,783 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:06,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:06,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:07,112 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-23 22:40:07,112 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:40:07,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1638518421, now seen corresponding path program 1 times [2024-09-23 22:40:07,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:07,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143334464] [2024-09-23 22:40:07,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:07,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 22:40:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:10,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143334464] [2024-09-23 22:40:10,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143334464] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:10,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:10,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 22:40:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572324183] [2024-09-23 22:40:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:10,329 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-23 22:40:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:10,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-23 22:40:10,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-23 22:40:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:10,333 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:10,333 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 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-23 22:40:10,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:10,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:10,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:10,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:12,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:12,792 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-23 22:40:12,793 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:40:12,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:12,793 INFO L85 PathProgramCache]: Analyzing trace with hash 419034602, now seen corresponding path program 1 times [2024-09-23 22:40:12,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:12,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550231029] [2024-09-23 22:40:12,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:12,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:13,607 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-23 22:40:13,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550231029] [2024-09-23 22:40:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550231029] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:13,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:13,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-23 22:40:13,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253048878] [2024-09-23 22:40:13,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:13,610 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-23 22:40:13,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:13,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-23 22:40:13,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-23 22:40:13,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:13,612 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:13,613 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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-23 22:40:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:13,613 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:13,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:40:14,062 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-23 22:40:14,062 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:40:14,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:14,062 INFO L85 PathProgramCache]: Analyzing trace with hash 991617622, now seen corresponding path program 1 times [2024-09-23 22:40:14,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:14,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560679916] [2024-09-23 22:40:14,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:14,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:18,997 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-23 22:40:18,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:18,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560679916] [2024-09-23 22:40:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560679916] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:18,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-23 22:40:18,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85538761] [2024-09-23 22:40:18,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:18,998 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-23 22:40:18,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:18,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-23 22:40:18,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-09-23 22:40:18,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:18,999 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:18,999 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 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-23 22:40:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:40:19,000 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:20,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 22:40:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:40:20,206 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-23 22:40:20,206 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:40:20,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1304350500, now seen corresponding path program 1 times [2024-09-23 22:40:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586284883] [2024-09-23 22:40:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:20,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:20,439 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-23 22:40:20,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:20,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586284883] [2024-09-23 22:40:20,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586284883] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:20,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:20,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-23 22:40:20,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805928864] [2024-09-23 22:40:20,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:20,441 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 22:40:20,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:20,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 22:40:20,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 22:40:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:20,443 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:20,443 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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-23 22:40:20,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:20,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:20,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:20,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:20,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 22:40:20,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:40:20,444 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 22:40:20,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:40:20,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:20,577 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-23 22:40:20,577 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:40:20,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:20,577 INFO L85 PathProgramCache]: Analyzing trace with hash 343195320, now seen corresponding path program 1 times [2024-09-23 22:40:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:20,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893307798] [2024-09-23 22:40:20,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:20,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:23,382 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-23 22:40:23,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:23,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893307798] [2024-09-23 22:40:23,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893307798] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:23,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:23,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-23 22:40:23,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530358503] [2024-09-23 22:40:23,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:23,383 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-23 22:40:23,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:23,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-23 22:40:23,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-09-23 22:40:23,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:23,384 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:23,384 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-23 22:40:23,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:23,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:23,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:23,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 22:40:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:40:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:23,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 22:40:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:40:24,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:24,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:24,086 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-23 22:40:24,086 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:40:24,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:24,086 INFO L85 PathProgramCache]: Analyzing trace with hash -812060030, now seen corresponding path program 2 times [2024-09-23 22:40:24,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:24,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164555046] [2024-09-23 22:40:24,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:24,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:27,202 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-23 22:40:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:27,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164555046] [2024-09-23 22:40:27,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164555046] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:27,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:27,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-23 22:40:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648573673] [2024-09-23 22:40:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:27,203 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-23 22:40:27,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:27,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-23 22:40:27,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-23 22:40:27,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:27,204 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:27,204 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 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-23 22:40:27,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:27,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:27,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:27,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:27,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-09-23 22:40:27,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:40:27,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:27,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:27,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-23 22:40:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:40:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 22:40:28,409 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 5 remaining) [2024-09-23 22:40:28,409 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-09-23 22:40:28,409 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-09-23 22:40:28,409 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 5 remaining) [2024-09-23 22:40:28,409 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err4ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 5 remaining) [2024-09-23 22:40:28,410 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-23 22:40:28,416 INFO L408 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-09-23 22:40:28,418 INFO L312 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE,SAFE (1/3) [2024-09-23 22:40:28,420 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 22:40:28,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-23 22:40:28,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 22:40:28,422 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-23 22:40:28,424 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-23 22:40:28,426 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-23 22:40:28,427 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-23 22:40:28,427 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;@55577e93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 22:40:28,427 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-23 22:40:28,572 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-23 22:40:28,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1022683719, now seen corresponding path program 1 times [2024-09-23 22:40:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040259084] [2024-09-23 22:40:28,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:29,255 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-23 22:40:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040259084] [2024-09-23 22:40:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040259084] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:29,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:29,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-23 22:40:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124699279] [2024-09-23 22:40:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:29,258 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-23 22:40:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-23 22:40:29,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-23 22:40:29,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:29,258 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:29,259 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-23 22:40:29,259 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:29,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:29,436 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-23 22:40:29,437 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-23 22:40:29,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1638516293, now seen corresponding path program 1 times [2024-09-23 22:40:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:29,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702396046] [2024-09-23 22:40:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:29,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:29,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:30,408 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-23 22:40:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:30,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702396046] [2024-09-23 22:40:30,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702396046] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:30,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:30,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-23 22:40:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15735203] [2024-09-23 22:40:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:30,410 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 22:40:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 22:40:30,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-09-23 22:40:30,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:30,411 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:30,411 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-23 22:40:30,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:30,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:30,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:30,768 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-23 22:40:30,768 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-23 22:40:30,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:30,769 INFO L85 PathProgramCache]: Analyzing trace with hash -745538262, now seen corresponding path program 1 times [2024-09-23 22:40:30,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:30,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694871010] [2024-09-23 22:40:30,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:30,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:31,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 22:40:31,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694871010] [2024-09-23 22:40:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694871010] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:31,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:31,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 22:40:31,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891720450] [2024-09-23 22:40:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:31,413 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 22:40:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 22:40:31,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-23 22:40:31,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:31,414 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:31,414 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-23 22:40:31,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:31,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:31,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:31,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:31,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:31,601 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-23 22:40:31,602 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-23 22:40:31,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:31,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1636783513, now seen corresponding path program 1 times [2024-09-23 22:40:31,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:31,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339059685] [2024-09-23 22:40:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:31,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:33,302 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-23 22:40:33,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:33,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339059685] [2024-09-23 22:40:33,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339059685] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:33,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:33,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-23 22:40:33,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795071770] [2024-09-23 22:40:33,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:33,303 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-09-23 22:40:33,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:33,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-09-23 22:40:33,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-09-23 22:40:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:33,303 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:33,304 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 22:40:33,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:33,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:33,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:33,304 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:33,775 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-23 22:40:33,775 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-23 22:40:33,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:33,775 INFO L85 PathProgramCache]: Analyzing trace with hash 893776219, now seen corresponding path program 1 times [2024-09-23 22:40:33,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:33,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747254388] [2024-09-23 22:40:33,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:33,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:34,014 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-23 22:40:34,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:34,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747254388] [2024-09-23 22:40:34,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747254388] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:34,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:34,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 22:40:34,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169751305] [2024-09-23 22:40:34,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:34,015 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 22:40:34,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:34,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 22:40:34,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-23 22:40:34,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:34,016 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:34,017 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-23 22:40:34,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:34,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:34,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:34,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:34,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:34,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:34,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:34,653 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-23 22:40:34,653 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-23 22:40:34,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:34,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1648584132, now seen corresponding path program 1 times [2024-09-23 22:40:34,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:34,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166853188] [2024-09-23 22:40:34,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:34,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:36,741 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-23 22:40:36,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:36,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166853188] [2024-09-23 22:40:36,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166853188] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:36,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:36,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-23 22:40:36,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436244147] [2024-09-23 22:40:36,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:36,742 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-09-23 22:40:36,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:36,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-09-23 22:40:36,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=59, Unknown=0, NotChecked=0, Total=110 [2024-09-23 22:40:36,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:36,743 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:36,743 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 10 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-23 22:40:36,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:36,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:36,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:36,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:36,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:36,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:36,938 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-23 22:40:36,938 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-23 22:40:36,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:36,939 INFO L85 PathProgramCache]: Analyzing trace with hash 595996407, now seen corresponding path program 1 times [2024-09-23 22:40:36,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:36,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760392754] [2024-09-23 22:40:36,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:36,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:36,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:37,584 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-23 22:40:37,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:37,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760392754] [2024-09-23 22:40:37,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760392754] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:37,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:37,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-23 22:40:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329665354] [2024-09-23 22:40:37,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:37,585 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-23 22:40:37,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-23 22:40:37,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-09-23 22:40:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:37,586 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:37,586 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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-23 22:40:37,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:37,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:37,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:37,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:37,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:37,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:37,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:38,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:38,606 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-23 22:40:38,607 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-23 22:40:38,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:38,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1986601648, now seen corresponding path program 2 times [2024-09-23 22:40:38,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:38,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626349584] [2024-09-23 22:40:38,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:38,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:40:40,303 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-23 22:40:40,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:40:40,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626349584] [2024-09-23 22:40:40,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626349584] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:40:40,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:40:40,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-23 22:40:40,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223586959] [2024-09-23 22:40:40,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:40:40,304 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-23 22:40:40,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:40:40,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-23 22:40:40,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-09-23 22:40:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:40,304 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:40:40,305 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-23 22:40:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:40,305 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:40:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:40:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:40:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:40:40,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:40:40,596 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-23 22:40:40,597 INFO L399 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-23 22:40:40,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:40:40,597 INFO L85 PathProgramCache]: Analyzing trace with hash 57382371, now seen corresponding path program 2 times [2024-09-23 22:40:40,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:40:40,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067466339] [2024-09-23 22:40:40,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:40:40,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:40:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 22:40:40,646 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-23 22:40:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 22:40:40,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-23 22:40:40,733 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-23 22:40:40,733 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-09-23 22:40:40,733 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-09-23 22:40:40,733 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-09-23 22:40:40,734 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-09-23 22:40:40,734 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-09-23 22:40:40,734 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-09-23 22:40:40,734 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-09-23 22:40:40,735 INFO L408 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-09-23 22:40:40,736 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-09-23 22:40:40,801 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-23 22:40:40,801 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-23 22:40:40,806 INFO L469 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-09-23 22:40:40,806 INFO L470 ceAbstractionStarter]: WitnessConsidered=11 [2024-09-23 22:40:40,807 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 10:40:40 BasicIcfg [2024-09-23 22:40:40,807 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-23 22:40:40,807 INFO L158 Benchmark]: Toolchain (without parser) took 42923.09ms. Allocated memory was 182.5MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 127.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 398.1MB. Max. memory is 16.1GB. [2024-09-23 22:40:40,807 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-23 22:40:40,808 INFO L158 Benchmark]: Witness Parser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-23 22:40:40,808 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1145.20ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 127.2MB in the beginning and 181.2MB in the end (delta: -54.1MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-09-23 22:40:40,808 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.50ms. Allocated memory is still 220.2MB. Free memory was 181.2MB in the beginning and 170.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-09-23 22:40:40,808 INFO L158 Benchmark]: Boogie Preprocessor took 106.51ms. Allocated memory is still 220.2MB. Free memory was 169.7MB in the beginning and 165.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-23 22:40:40,808 INFO L158 Benchmark]: RCFGBuilder took 1537.21ms. Allocated memory is still 220.2MB. Free memory was 165.5MB in the beginning and 83.8MB in the end (delta: 81.7MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2024-09-23 22:40:40,809 INFO L158 Benchmark]: TraceAbstraction took 40011.87ms. Allocated memory was 220.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 83.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 316.0MB. Max. memory is 16.1GB. [2024-09-23 22:40:40,810 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 91.4MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 152.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1145.20ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 127.2MB in the beginning and 181.2MB in the end (delta: -54.1MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.50ms. Allocated memory is still 220.2MB. Free memory was 181.2MB in the beginning and 170.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.51ms. Allocated memory is still 220.2MB. Free memory was 169.7MB in the beginning and 165.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1537.21ms. Allocated memory is still 220.2MB. Free memory was 165.5MB in the beginning and 83.8MB in the end (delta: 81.7MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * TraceAbstraction took 40011.87ms. Allocated memory was 220.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 83.8MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 316.0MB. 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: 2204, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 284, dependent conditional: 257, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1983, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 63, dependent conditional: 36, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1983, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 63, dependent conditional: 36, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 247, dependent conditional: 220, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 154, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 154, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 771, independent: 701, independent conditional: 8, independent unconditional: 693, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 771, independent: 503, independent conditional: 0, independent unconditional: 503, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 268, independent: 198, independent conditional: 8, independent unconditional: 190, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 268, independent: 198, independent conditional: 8, independent unconditional: 190, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4830, independent: 3483, independent conditional: 108, independent unconditional: 3374, dependent: 1347, dependent conditional: 772, dependent unconditional: 575, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2167, independent: 1219, independent conditional: 20, independent unconditional: 1199, dependent: 177, dependent conditional: 111, dependent unconditional: 66, unknown: 771, unknown conditional: 51, unknown unconditional: 720] , Statistics on independence cache: Total cache size (in pairs): 771, Positive cache size: 701, Positive conditional cache size: 8, Positive unconditional cache size: 693, Negative cache size: 70, Negative conditional cache size: 43, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1270, Maximal queried relation: 8, Independence queries for same thread: 221, Persistent sets #1 benchmarks: Persistent set computation time: 4.0s, Number of persistent set computation: 118, Number of trivial persistent sets: 85, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 715, independent: 688, independent conditional: 0, independent unconditional: 688, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2204, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 284, dependent conditional: 257, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1983, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 63, dependent conditional: 36, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1983, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 63, dependent conditional: 36, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 1232, independent unconditional: 688, dependent: 247, dependent conditional: 220, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 154, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2167, independent: 1920, independent conditional: 28, independent unconditional: 1892, dependent: 247, dependent conditional: 154, dependent unconditional: 93, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 771, independent: 701, independent conditional: 8, independent unconditional: 693, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 771, independent: 503, independent conditional: 0, independent unconditional: 503, dependent: 268, dependent conditional: 0, dependent unconditional: 268, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 268, independent: 198, independent conditional: 8, independent unconditional: 190, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 268, independent: 198, independent conditional: 8, independent unconditional: 190, dependent: 70, dependent conditional: 43, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4830, independent: 3483, independent conditional: 108, independent unconditional: 3374, dependent: 1347, dependent conditional: 772, dependent unconditional: 575, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2167, independent: 1219, independent conditional: 20, independent unconditional: 1199, dependent: 177, dependent conditional: 111, dependent unconditional: 66, unknown: 771, unknown conditional: 51, unknown unconditional: 720] , Statistics on independence cache: Total cache size (in pairs): 771, Positive cache size: 701, Positive conditional cache size: 8, Positive unconditional cache size: 693, Negative cache size: 70, Negative conditional cache size: 43, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1270, Maximal queried relation: 8, Independence queries for same thread: 221 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1319, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 175, dependent conditional: 160, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1171, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1171, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 97, dependent conditional: 82, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 539, independent: 506, independent conditional: 3, independent unconditional: 503, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 539, independent: 384, independent conditional: 0, independent unconditional: 384, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 155, independent: 122, independent conditional: 3, independent unconditional: 119, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 155, independent: 122, independent conditional: 3, independent unconditional: 119, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2022, independent: 1580, independent conditional: 21, independent unconditional: 1559, dependent: 442, dependent conditional: 193, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1241, independent: 638, independent conditional: 4, independent unconditional: 634, dependent: 64, dependent conditional: 45, dependent unconditional: 19, unknown: 539, unknown conditional: 21, unknown unconditional: 518] , Statistics on independence cache: Total cache size (in pairs): 539, Positive cache size: 506, Positive conditional cache size: 3, Positive unconditional cache size: 503, Negative cache size: 33, Negative conditional cache size: 18, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 653, Maximal queried relation: 6, Independence queries for same thread: 148, Persistent sets #1 benchmarks: Persistent set computation time: 1.8s, Number of persistent set computation: 80, Number of trivial persistent sets: 43, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 518, independent: 503, independent conditional: 0, independent unconditional: 503, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1319, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 175, dependent conditional: 160, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1171, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1171, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 27, dependent conditional: 12, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 641, independent unconditional: 503, dependent: 97, dependent conditional: 82, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1241, independent: 1144, independent conditional: 7, independent unconditional: 1137, dependent: 97, dependent conditional: 63, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 539, independent: 506, independent conditional: 3, independent unconditional: 503, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 539, independent: 384, independent conditional: 0, independent unconditional: 384, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 155, independent: 122, independent conditional: 3, independent unconditional: 119, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 155, independent: 122, independent conditional: 3, independent unconditional: 119, dependent: 33, dependent conditional: 18, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2022, independent: 1580, independent conditional: 21, independent unconditional: 1559, dependent: 442, dependent conditional: 193, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1241, independent: 638, independent conditional: 4, independent unconditional: 634, dependent: 64, dependent conditional: 45, dependent unconditional: 19, unknown: 539, unknown conditional: 21, unknown unconditional: 518] , Statistics on independence cache: Total cache size (in pairs): 539, Positive cache size: 506, Positive conditional cache size: 3, Positive unconditional cache size: 503, Negative cache size: 33, Negative conditional cache size: 18, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 653, Maximal queried relation: 6, Independence queries for same thread: 148 - 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; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L754] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L758] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L758] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L765] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L765] 2 y = 1 VAL [\old(arg)={0:0}, \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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L734] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L734] 1 y = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L737] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L737] 1 x = 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L768] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L775] 2 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L777] 2 return 0; [L740] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L795] 0 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L806] 0 //@ assert (((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) x$r_buff0_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd2) + (long long) x$w_buff1) >= 0LL)) && (((0LL - (long long) x$w_buff1_used) + (long long) y) >= 0LL)) && (((1LL - (long long) x) + (long long) x$r_buff0_thd2) >= 0LL)) && (((1LL - (long long) x) + (long long) x$w_buff0) >= 0LL)) && (((0LL - (long long) x$flush_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff0_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd0) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$r_buff1_thd1) - (long long) x$w_buff1_used) >= 0LL)) && (((0LL - (long long) x$read_delayed) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) main$tmp_guard1) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff0_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$r_buff1_thd2) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) x$w_buff0_used) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice0) - (long long) x$w_buff1_used) >= 0LL)) && (((1LL - (long long) weak$$choice2) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$mem_tmp) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff0) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1) - (long long) x$w_buff1_used) >= 0LL)) && (((2LL - (long long) x$w_buff1_used) - (long long) y) >= 0LL)) && (((long long) __unbuffered_cnt - (long long) x$w_buff1_used) >= 0LL)) && (((long long) main$tmp_guard1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$flush_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$mem_tmp - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$r_buff1_thd2) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$r_buff0_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$r_buff1_thd2 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$read_delayed - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff0_used) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1) >= 0LL)) && (((long long) x$w_buff0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff0_used - (long long) x$w_buff1_used) >= 0LL)) && (((long long) x$w_buff1 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice0 - (long long) x$w_buff1_used) >= 0LL)) && (((long long) weak$$choice2 - (long long) x$w_buff1_used) >= 0LL)) && (x$flush_delayed == (_Bool) 0)) && (x$r_buff0_thd0 == (_Bool) 0)) && (x$r_buff0_thd1 == (_Bool) 0)) && (x$r_buff1_thd0 == (_Bool) 0)) && (x$r_buff1_thd1 == (_Bool) 0)) && (x$read_delayed == (_Bool) 0)) && (x$read_delayed_var == 0)) && ((x$w_buff0 == 0) || (x$w_buff0 == 2))) && ((x$w_buff1 == 0) || (x$w_buff1 == 2))) && (((x == 0) || (x == 1)) || (x == 2))) && (((x$mem_tmp == 0) || (x$mem_tmp == 1)) || (x$mem_tmp == 2))) && (((y == 0) || (y == 1)) || (y == 2))); [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2475=-2, t2476=-1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L821] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L18] 0 reach_error() VAL [\old(arg)={0:0}, \old(expression)=0, __unbuffered_cnt=2, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=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: 27.4s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 7.6s, 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: 53, 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.5s SatisfiabilityAnalysisTime, 19.0s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 4783 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 - 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: 12.3s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 3.5s, 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.2s SatisfiabilityAnalysisTime, 8.5s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 4767 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 RESULT: Ultimate proved your program to be incorrect! [2024-09-23 22:40:40,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-09-23 22:40:41,047 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-23 22:40:41,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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