./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i ./goblint.2024-09-02_08-21-23.files/mutex-meet-local/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_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:02:13,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-23 22:02:13,510 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-09-23 22:02:13,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-23 22:02:13,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-23 22:02:13,532 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-23 22:02:13,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-23 22:02:13,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-23 22:02:13,534 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-23 22:02:13,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-23 22:02:13,535 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-23 22:02:13,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-23 22:02:13,536 INFO L153 SettingsManager]: * Use SBE=true [2024-09-23 22:02:13,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-23 22:02:13,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-23 22:02:13,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-23 22:02:13,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-23 22:02:13,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-23 22:02:13,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-23 22:02:13,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-23 22:02:13,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-23 22:02:13,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-23 22:02:13,539 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-23 22:02:13,540 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-23 22:02:13,540 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-23 22:02:13,540 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-23 22:02:13,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-23 22:02:13,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-23 22:02:13,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-23 22:02:13,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-23 22:02:13,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-23 22:02:13,542 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-23 22:02:13,542 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-23 22:02:13,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-23 22:02:13,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-23 22:02:13,543 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-09-23 22:02:13,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-23 22:02:13,544 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-23 22:02:13,544 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-09-23 22:02:13,544 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-09-23 22:02:13,544 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-09-23 22:02:13,546 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:02:13,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-23 22:02:13,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-23 22:02:13,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-23 22:02:13,801 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-09-23 22:02:13,801 INFO L274 PluginConnector]: Witness Parser initialized [2024-09-23 22:02:13,803 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.yml/witness.yml [2024-09-23 22:02:14,000 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-23 22:02:14,000 INFO L274 PluginConnector]: CDTParser initialized [2024-09-23 22:02:14,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-09-23 22:02:15,394 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-23 22:02:15,625 INFO L384 CDTParser]: Found 1 translation units. [2024-09-23 22:02:15,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-09-23 22:02:15,639 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6dbd24791/114a8a2233d846138651bddd37d4222f/FLAG1db8ca916 [2024-09-23 22:02:15,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/6dbd24791/114a8a2233d846138651bddd37d4222f [2024-09-23 22:02:15,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-23 22:02:15,656 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-09-23 22:02:15,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-23 22:02:15,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-23 22:02:15,661 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-23 22:02:15,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 10:02:13" (1/2) ... [2024-09-23 22:02:15,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5a40c2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:02:15, skipping insertion in model container [2024-09-23 22:02:15,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 10:02:13" (1/2) ... [2024-09-23 22:02:15,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25ecc5dc and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 23.09 10:02:15, skipping insertion in model container [2024-09-23 22:02:15,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.09 10:02:15" (2/2) ... [2024-09-23 22:02:15,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5a40c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:15, skipping insertion in model container [2024-09-23 22:02:15,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.09 10:02:15" (2/2) ... [2024-09-23 22:02:15,994 INFO L93 nessWitnessExtractor]: Found the following entries in the witness: [2024-09-23 22:02:15,995 INFO L1541 ArrayList]: Location invariant before [L754-L754] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,995 INFO L1541 ArrayList]: Location invariant before [L817-L817] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,995 INFO L1541 ArrayList]: Location invariant before [L828-L828] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,995 INFO L1541 ArrayList]: Location invariant before [L821-L821] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,996 INFO L1541 ArrayList]: Location invariant before [L797-L797] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,996 INFO L1541 ArrayList]: Location invariant before [L784-L784] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,996 INFO L1541 ArrayList]: Location invariant before [L777-L777] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,996 INFO L1541 ArrayList]: Location invariant before [L772-L772] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,996 INFO L1541 ArrayList]: Location invariant before [L775-L775] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,997 INFO L1541 ArrayList]: Location invariant before [L787-L787] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:15,997 INFO L1541 ArrayList]: Location invariant before [L790-L790] ((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && ((0LL - (long long )__unbuffered_p1_EAX) + (long long )x >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )y$mem_tmp >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice0 >= 0LL)) && ((long long )__unbuffered_p0_EAX$read_delayed - (long long )weak$$choice2 >= 0LL)) && ((long long )y - (long long )y$mem_tmp >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool)0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool)0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool)0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool)0)) && (y$flush_delayed == (_Bool)0)) && (y$r_buff0_thd0 == (_Bool)0)) && (y$r_buff0_thd1 == (_Bool)0)) && (y$r_buff0_thd2 == (_Bool)0)) && (y$r_buff1_thd0 == (_Bool)0)) && (y$r_buff1_thd1 == (_Bool)0)) && (y$r_buff1_thd2 == (_Bool)0)) && (y$read_delayed == (_Bool)0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool)0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool)0)) && (__unbuffered_p0_EAX == 0 || __unbuffered_p0_EAX == 1)) && (__unbuffered_p0_EAX$read_delayed_var == 0 || (__unbuffered_p0_EAX$read_delayed_var == & y && (*__unbuffered_p0_EAX$read_delayed_var == 0 || *__unbuffered_p0_EAX$read_delayed_var == 1)))) && (__unbuffered_p1_EAX == 0 || __unbuffered_p1_EAX == 1)) && (x == 0 || x == 1)) && (y == 0 || y == 1)) && (y$mem_tmp == 0 || y$mem_tmp == 1) [2024-09-23 22:02:16,039 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-23 22:02:16,207 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] [2024-09-23 22:02:16,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-23 22:02:16,381 INFO L200 MainTranslator]: Completed pre-run [2024-09-23 22:02:16,393 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/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i[1026,1039] 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:02:16,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-23 22:02:16,632 INFO L204 MainTranslator]: Completed translation [2024-09-23 22:02:16,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16 WrapperNode [2024-09-23 22:02:16,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-23 22:02:16,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-23 22:02:16,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-23 22:02:16,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-23 22:02:16,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,698 INFO L138 Inliner]: procedures = 174, calls = 101, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 149 [2024-09-23 22:02:16,699 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-23 22:02:16,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-23 22:02:16,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-23 22:02:16,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-23 22:02:16,711 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,711 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,740 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-23 22:02:16,746 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-23 22:02:16,746 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-23 22:02:16,746 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-23 22:02:16,747 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (1/1) ... [2024-09-23 22:02:16,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-09-23 22:02:16,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 22:02:16,797 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:02:16,808 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:02:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-09-23 22:02:16,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-09-23 22:02:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-09-23 22:02:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-23 22:02:16,854 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-09-23 22:02:16,854 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-09-23 22:02:16,855 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-09-23 22:02:16,856 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-09-23 22:02:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-09-23 22:02:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-09-23 22:02:16,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-23 22:02:16,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-23 22:02:16,858 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:02:16,988 INFO L242 CfgBuilder]: Building ICFG [2024-09-23 22:02:16,989 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-23 22:02:17,740 INFO L287 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-09-23 22:02:17,741 INFO L291 CfgBuilder]: Performing block encoding [2024-09-23 22:02:18,324 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-23 22:02:18,325 INFO L318 CfgBuilder]: Removed 0 assume(true) statements. [2024-09-23 22:02:18,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 10:02:18 BoogieIcfgContainer [2024-09-23 22:02:18,325 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-23 22:02:18,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-23 22:02:18,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-23 22:02:18,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-23 22:02:18,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 23.09 10:02:13" (1/4) ... [2024-09-23 22:02:18,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5563e60c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 23.09 10:02:18, skipping insertion in model container [2024-09-23 22:02:18,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.09 10:02:15" (2/4) ... [2024-09-23 22:02:18,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5563e60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 10:02:18, skipping insertion in model container [2024-09-23 22:02:18,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.09 10:02:16" (3/4) ... [2024-09-23 22:02:18,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5563e60c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 10:02:18, skipping insertion in model container [2024-09-23 22:02:18,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 10:02:18" (4/4) ... [2024-09-23 22:02:18,334 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2024-09-23 22:02:18,350 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-23 22:02:18,350 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-09-23 22:02:18,351 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-09-23 22:02:18,477 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-09-23 22:02:18,520 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 22:02:18,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-23 22:02:18,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 22:02:18,523 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:02:18,525 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:02:18,560 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-23 22:02:18,572 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == P1Thread1of1ForFork0 ======== [2024-09-23 22:02:18,578 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;@41b58d41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 22:02:18,578 INFO L337 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-09-23 22:02:18,902 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:02:18,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:18,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1385420060, now seen corresponding path program 1 times [2024-09-23 22:02:18,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:18,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425314475] [2024-09-23 22:02:18,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:18,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 22:02:21,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:21,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425314475] [2024-09-23 22:02:21,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425314475] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:21,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:21,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-09-23 22:02:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537709716] [2024-09-23 22:02:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:21,388 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-09-23 22:02:21,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:21,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-09-23 22:02:21,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-09-23 22:02:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:21,415 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:21,416 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:02:21,416 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:21,933 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-23 22:02:21,933 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:02:21,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:21,934 INFO L85 PathProgramCache]: Analyzing trace with hash -51158914, now seen corresponding path program 1 times [2024-09-23 22:02:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:21,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781790771] [2024-09-23 22:02:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:21,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:23,536 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:02:23,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:23,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781790771] [2024-09-23 22:02:23,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781790771] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:23,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:23,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-09-23 22:02:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716335509] [2024-09-23 22:02:23,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:23,540 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 22:02:23,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:23,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 22:02:23,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-23 22:02:23,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:23,545 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:23,545 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:02:23,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:23,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:24,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:24,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:24,336 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-09-23 22:02:24,336 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:02:24,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash -861428445, now seen corresponding path program 1 times [2024-09-23 22:02:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:24,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947582365] [2024-09-23 22:02:24,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:28,751 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:02:28,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:28,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947582365] [2024-09-23 22:02:28,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947582365] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:28,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:28,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-23 22:02:28,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115678344] [2024-09-23 22:02:28,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:28,754 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-23 22:02:28,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:28,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-23 22:02:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-09-23 22:02:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:28,758 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:28,758 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 22:02:28,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:28,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:28,758 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:29,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:29,444 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-09-23 22:02:29,444 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:02:29,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:29,444 INFO L85 PathProgramCache]: Analyzing trace with hash -366446800, now seen corresponding path program 1 times [2024-09-23 22:02:29,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:29,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183501660] [2024-09-23 22:02:29,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:29,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:33,645 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:02:33,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:33,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183501660] [2024-09-23 22:02:33,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183501660] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:33,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:33,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-23 22:02:33,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092618889] [2024-09-23 22:02:33,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:33,647 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-23 22:02:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:33,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-23 22:02:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-09-23 22:02:33,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:33,649 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:33,649 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 22:02:33,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:33,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:33,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:33,649 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:35,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:02:35,509 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-09-23 22:02:35,510 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:02:35,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:35,510 INFO L85 PathProgramCache]: Analyzing trace with hash -146518316, now seen corresponding path program 1 times [2024-09-23 22:02:35,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:35,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685906528] [2024-09-23 22:02:35,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:35,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:35,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:38,440 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:02:38,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:38,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685906528] [2024-09-23 22:02:38,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685906528] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:38,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:38,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-09-23 22:02:38,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084909980] [2024-09-23 22:02:38,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:38,441 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-09-23 22:02:38,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:38,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-09-23 22:02:38,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-09-23 22:02:38,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:38,443 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:38,443 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:02:38,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:38,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:38,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:38,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:02:38,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:39,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:39,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:02:39,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:39,347 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-09-23 22:02:39,347 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:02:39,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash -947411929, now seen corresponding path program 1 times [2024-09-23 22:02:39,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:39,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134798573] [2024-09-23 22:02:39,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:43,479 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:02:43,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:43,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134798573] [2024-09-23 22:02:43,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134798573] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:43,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:43,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-23 22:02:43,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401345033] [2024-09-23 22:02:43,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:43,480 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-23 22:02:43,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-23 22:02:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-09-23 22:02:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:43,481 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:43,482 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 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:02:43,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:43,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:43,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:43,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:02:43,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:43,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:44,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:02:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 22:02:44,916 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-09-23 22:02:44,917 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:02:44,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:44,917 INFO L85 PathProgramCache]: Analyzing trace with hash -922801696, now seen corresponding path program 1 times [2024-09-23 22:02:44,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:44,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927993625] [2024-09-23 22:02:44,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:44,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 22:02:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:47,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927993625] [2024-09-23 22:02:47,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927993625] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:47,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:47,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-09-23 22:02:47,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333749953] [2024-09-23 22:02:47,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:47,637 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-09-23 22:02:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:47,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-09-23 22:02:47,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2024-09-23 22:02:47,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:47,638 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:47,638 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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:02:47,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:47,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:47,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:47,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:02:47,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:47,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 22:02:47,639 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:02:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 22:02:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:02:48,269 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-09-23 22:02:48,269 INFO L399 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT === [P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT, P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (and 1 more)] === [2024-09-23 22:02:48,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:48,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1457919285, now seen corresponding path program 1 times [2024-09-23 22:02:48,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:48,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087534402] [2024-09-23 22:02:48,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:50,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-23 22:02:50,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:50,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087534402] [2024-09-23 22:02:50,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087534402] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:50,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:50,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-23 22:02:50,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950758436] [2024-09-23 22:02:50,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:50,944 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-23 22:02:50,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:50,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-23 22:02:50,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-09-23 22:02:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:50,945 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:50,945 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 22:02:50,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:50,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:50,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:50,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:02:50,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:50,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 22:02:50,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:02:50,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:02:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 22:02:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:02:52,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-23 22:02:52,283 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-09-23 22:02:52,283 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-09-23 22:02:52,283 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err2ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 4 remaining) [2024-09-23 22:02:52,284 INFO L785 garLoopResultBuilder]: Registering result SAFE for location P1Err3ASSERT_VIOLATIONWITNESS_INVARIANT (0 of 4 remaining) [2024-09-23 22:02:52,284 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-09-23 22:02:52,291 INFO L408 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-09-23 22:02:52,294 INFO L312 ceAbstractionStarter]: Result for error location P1Thread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE (1/3) [2024-09-23 22:02:52,297 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 22:02:52,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-09-23 22:02:52,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-09-23 22:02:52,317 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:02:52,318 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:02:52,322 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-09-23 22:02:52,322 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-09-23 22:02:52,322 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;@41b58d41, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-23 22:02:52,323 INFO L337 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-09-23 22:02:52,536 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:02:52,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:52,536 INFO L85 PathProgramCache]: Analyzing trace with hash -51160917, now seen corresponding path program 1 times [2024-09-23 22:02:52,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:52,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806385836] [2024-09-23 22:02:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:52,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:54,119 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:02:54,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:54,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806385836] [2024-09-23 22:02:54,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806385836] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:54,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:54,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-23 22:02:54,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553539512] [2024-09-23 22:02:54,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:54,120 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-09-23 22:02:54,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:54,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-09-23 22:02:54,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-09-23 22:02:54,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:54,121 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:54,121 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:02:54,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:54,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:54,447 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-09-23 22:02:54,447 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:02:54,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1919052915, now seen corresponding path program 1 times [2024-09-23 22:02:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261432197] [2024-09-23 22:02:54,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:54,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:55,463 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:02:55,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:55,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261432197] [2024-09-23 22:02:55,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261432197] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:55,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:55,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 22:02:55,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029200592] [2024-09-23 22:02:55,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:55,464 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 22:02:55,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:55,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 22:02:55,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-09-23 22:02:55,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:55,465 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:55,465 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:02:55,465 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:55,466 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:55,614 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-09-23 22:02:55,614 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:02:55,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1666810257, now seen corresponding path program 1 times [2024-09-23 22:02:55,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:55,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707106039] [2024-09-23 22:02:55,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:55,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:57,591 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:02:57,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707106039] [2024-09-23 22:02:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707106039] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:57,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:57,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-23 22:02:57,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933098566] [2024-09-23 22:02:57,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:57,593 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-09-23 22:02:57,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:57,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-09-23 22:02:57,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-09-23 22:02:57,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:57,594 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:57,595 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 22:02:57,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:57,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:57,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:57,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:57,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:57,898 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-09-23 22:02:57,898 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-23 22:02:57,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2071996436, now seen corresponding path program 1 times [2024-09-23 22:02:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:57,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143430477] [2024-09-23 22:02:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:57,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:02:58,060 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:02:58,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:02:58,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143430477] [2024-09-23 22:02:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143430477] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:02:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:02:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-09-23 22:02:58,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966014481] [2024-09-23 22:02:58,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:02:58,061 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-23 22:02:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:02:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-23 22:02:58,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-09-23 22:02:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:58,062 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:02:58,062 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:02:58,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:58,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:58,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:58,062 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:02:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:02:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:02:58,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:02:58,454 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-09-23 22:02:58,454 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-23 22:02:58,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:02:58,454 INFO L85 PathProgramCache]: Analyzing trace with hash 644663421, now seen corresponding path program 1 times [2024-09-23 22:02:58,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:02:58,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809337393] [2024-09-23 22:02:58,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:02:58,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:02:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:03:01,395 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:03:01,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:03:01,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809337393] [2024-09-23 22:03:01,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809337393] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:03:01,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:03:01,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-23 22:03:01,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180352066] [2024-09-23 22:03:01,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:03:01,396 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-23 22:03:01,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:03:01,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-23 22:03:01,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-09-23 22:03:01,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:03:01,397 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:03:01,397 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 22:03:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:03:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:03:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:01,397 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:03:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:03:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:03:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:01,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:03:01,865 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-09-23 22:03:01,865 INFO L399 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-23 22:03:01,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:03:01,866 INFO L85 PathProgramCache]: Analyzing trace with hash 453778451, now seen corresponding path program 1 times [2024-09-23 22:03:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:03:01,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893129596] [2024-09-23 22:03:01,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:03:01,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:03:01,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:03:02,552 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:03:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:03:02,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893129596] [2024-09-23 22:03:02,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893129596] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:03:02,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:03:02,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-09-23 22:03:02,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756450506] [2024-09-23 22:03:02,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:03:02,554 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-23 22:03:02,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:03:02,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-23 22:03:02,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-09-23 22:03:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:03:02,555 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:03:02,555 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) 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:03:02,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:03:02,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:02,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:03:02,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:02,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-09-23 22:03:02,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:03:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:03:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:03:03,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:03,765 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-09-23 22:03:03,765 INFO L399 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-09-23 22:03:03,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:03:03,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1231885795, now seen corresponding path program 2 times [2024-09-23 22:03:03,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:03:03,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649968046] [2024-09-23 22:03:03,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:03:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:03:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:03:06,925 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:03:06,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:03:06,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649968046] [2024-09-23 22:03:06,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649968046] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:03:06,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:03:06,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-23 22:03:06,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255961434] [2024-09-23 22:03:06,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:03:06,926 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-23 22:03:06,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:03:06,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-23 22:03:06,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-09-23 22:03:06,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:03:06,927 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:03:06,927 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 22:03:06,927 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:03:06,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:06,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:03:06,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:06,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:06,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:06,928 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:03:08,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:03:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:03:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:08,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:08,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 22:03:08,027 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-09-23 22:03:08,027 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:03:08,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:03:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash -744032603, now seen corresponding path program 3 times [2024-09-23 22:03:08,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:03:08,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440990716] [2024-09-23 22:03:08,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:03:08,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:03:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-23 22:03:11,016 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:03:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-23 22:03:11,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440990716] [2024-09-23 22:03:11,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440990716] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-23 22:03:11,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-23 22:03:11,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-09-23 22:03:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284810701] [2024-09-23 22:03:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-23 22:03:11,017 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-23 22:03:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-23 22:03:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-23 22:03:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-09-23 22:03:11,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:03:11,019 INFO L474 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-09-23 22:03:11,019 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-09-23 22:03:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:03:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:03:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:11,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:11,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-09-23 22:03:11,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-09-23 22:03:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-09-23 22:03:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-23 22:03:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-09-23 22:03:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-09-23 22:03:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-09-23 22:03:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-09-23 22:03:11,896 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-09-23 22:03:11,896 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:03:11,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-23 22:03:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash 632485435, now seen corresponding path program 2 times [2024-09-23 22:03:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-23 22:03:11,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330898661] [2024-09-23 22:03:11,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-23 22:03:11,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-23 22:03:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 22:03:11,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-09-23 22:03:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-09-23 22:03:12,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-09-23 22:03:12,001 INFO L326 BasicCegarLoop]: Counterexample is feasible [2024-09-23 22:03:12,001 INFO L785 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2024-09-23 22:03:12,002 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (4 of 6 remaining) [2024-09-23 22:03:12,002 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-09-23 22:03:12,003 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 6 remaining) [2024-09-23 22:03:12,003 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2024-09-23 22:03:12,003 INFO L785 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-09-23 22:03:12,003 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-09-23 22:03:12,005 INFO L408 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-09-23 22:03:12,006 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/3) [2024-09-23 22:03:12,115 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-09-23 22:03:12,115 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-09-23 22:03:12,118 INFO L469 ceAbstractionStarter]: Automizer considered 11 witness invariants [2024-09-23 22:03:12,118 INFO L470 ceAbstractionStarter]: WitnessConsidered=11 [2024-09-23 22:03:12,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 10:03:12 BasicIcfg [2024-09-23 22:03:12,119 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-09-23 22:03:12,120 INFO L158 Benchmark]: Toolchain (without parser) took 56463.88ms. Allocated memory was 157.3MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 97.3MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 731.7MB. Max. memory is 16.1GB. [2024-09-23 22:03:12,120 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-23 22:03:12,120 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-09-23 22:03:12,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 976.64ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 96.8MB in the beginning and 128.9MB in the end (delta: -32.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2024-09-23 22:03:12,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.03ms. Allocated memory is still 209.7MB. Free memory was 128.9MB in the beginning and 125.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-23 22:03:12,121 INFO L158 Benchmark]: Boogie Preprocessor took 46.15ms. Allocated memory is still 209.7MB. Free memory was 125.8MB in the beginning and 122.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-09-23 22:03:12,121 INFO L158 Benchmark]: RCFGBuilder took 1578.76ms. Allocated memory is still 209.7MB. Free memory was 122.6MB in the beginning and 68.5MB in the end (delta: 54.1MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-09-23 22:03:12,121 INFO L158 Benchmark]: TraceAbstraction took 53792.83ms. Allocated memory was 209.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 67.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 648.3MB. Max. memory is 16.1GB. [2024-09-23 22:03:12,123 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory is still 100.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 976.64ms. Allocated memory was 157.3MB in the beginning and 209.7MB in the end (delta: 52.4MB). Free memory was 96.8MB in the beginning and 128.9MB in the end (delta: -32.1MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.03ms. Allocated memory is still 209.7MB. Free memory was 128.9MB in the beginning and 125.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.15ms. Allocated memory is still 209.7MB. Free memory was 125.8MB in the beginning and 122.6MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1578.76ms. Allocated memory is still 209.7MB. Free memory was 122.6MB in the beginning and 68.5MB in the end (delta: 54.1MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * TraceAbstraction took 53792.83ms. Allocated memory was 209.7MB in the beginning and 2.2GB in the end (delta: 2.0GB). Free memory was 67.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 648.3MB. 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: 4365, independent: 3668, independent conditional: 2939, independent unconditional: 729, dependent: 697, dependent conditional: 672, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3759, independent: 3668, independent conditional: 2939, independent unconditional: 729, dependent: 91, dependent conditional: 66, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3759, independent: 3668, independent conditional: 2939, independent unconditional: 729, dependent: 91, dependent conditional: 66, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4301, independent: 3668, independent conditional: 2939, independent unconditional: 729, dependent: 633, dependent conditional: 608, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4301, independent: 3668, independent conditional: 153, independent unconditional: 3515, dependent: 633, dependent conditional: 386, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4301, independent: 3668, independent conditional: 153, independent unconditional: 3515, dependent: 633, dependent conditional: 386, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 859, independent: 783, independent conditional: 52, independent unconditional: 731, dependent: 76, dependent conditional: 49, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 859, independent: 555, independent conditional: 0, independent unconditional: 555, dependent: 304, dependent conditional: 0, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 304, independent: 228, independent conditional: 52, independent unconditional: 176, dependent: 76, dependent conditional: 49, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 304, independent: 228, independent conditional: 52, independent unconditional: 176, dependent: 76, dependent conditional: 49, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3953, independent: 2906, independent conditional: 734, independent unconditional: 2172, dependent: 1048, dependent conditional: 724, dependent unconditional: 324, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4301, independent: 2885, independent conditional: 101, independent unconditional: 2784, dependent: 557, dependent conditional: 337, dependent unconditional: 220, unknown: 859, unknown conditional: 101, unknown unconditional: 758] , Statistics on independence cache: Total cache size (in pairs): 859, Positive cache size: 783, Positive conditional cache size: 52, Positive unconditional cache size: 731, Negative cache size: 76, Negative conditional cache size: 49, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3008, Maximal queried relation: 8, Independence queries for same thread: 606, Persistent sets #1 benchmarks: Persistent set computation time: 2.5s, Number of persistent set computation: 208, Number of trivial persistent sets: 113, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 754, independent: 729, independent conditional: 0, independent unconditional: 729, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4365, independent: 3668, independent conditional: 2939, independent unconditional: 729, dependent: 697, dependent conditional: 672, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3759, independent: 3668, independent conditional: 2939, independent unconditional: 729, dependent: 91, dependent conditional: 66, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3759, independent: 3668, independent conditional: 2939, independent unconditional: 729, dependent: 91, dependent conditional: 66, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4301, independent: 3668, independent conditional: 2939, independent unconditional: 729, dependent: 633, dependent conditional: 608, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4301, independent: 3668, independent conditional: 153, independent unconditional: 3515, dependent: 633, dependent conditional: 386, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4301, independent: 3668, independent conditional: 153, independent unconditional: 3515, dependent: 633, dependent conditional: 386, dependent unconditional: 247, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 859, independent: 783, independent conditional: 52, independent unconditional: 731, dependent: 76, dependent conditional: 49, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 859, independent: 555, independent conditional: 0, independent unconditional: 555, dependent: 304, dependent conditional: 0, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 304, independent: 228, independent conditional: 52, independent unconditional: 176, dependent: 76, dependent conditional: 49, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 304, independent: 228, independent conditional: 52, independent unconditional: 176, dependent: 76, dependent conditional: 49, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 3953, independent: 2906, independent conditional: 734, independent unconditional: 2172, dependent: 1048, dependent conditional: 724, dependent unconditional: 324, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4301, independent: 2885, independent conditional: 101, independent unconditional: 2784, dependent: 557, dependent conditional: 337, dependent unconditional: 220, unknown: 859, unknown conditional: 101, unknown unconditional: 758] , Statistics on independence cache: Total cache size (in pairs): 859, Positive cache size: 783, Positive conditional cache size: 52, Positive unconditional cache size: 731, Negative cache size: 76, Negative conditional cache size: 49, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3008, Maximal queried relation: 8, Independence queries for same thread: 606 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2501, independent: 2118, independent conditional: 1565, independent unconditional: 553, dependent: 383, dependent conditional: 366, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2162, independent: 2118, independent conditional: 1565, independent unconditional: 553, dependent: 44, dependent conditional: 27, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2162, independent: 2118, independent conditional: 1565, independent unconditional: 553, dependent: 44, dependent conditional: 27, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2380, independent: 2118, independent conditional: 1565, independent unconditional: 553, dependent: 262, dependent conditional: 245, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2380, independent: 2118, independent conditional: 30, independent unconditional: 2088, dependent: 262, dependent conditional: 188, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2380, independent: 2118, independent conditional: 30, independent unconditional: 2088, dependent: 262, dependent conditional: 188, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 605, independent: 556, independent conditional: 3, independent unconditional: 553, dependent: 49, dependent conditional: 32, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 605, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 197, independent: 148, independent conditional: 3, independent unconditional: 145, dependent: 49, dependent conditional: 32, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 197, independent: 148, independent conditional: 3, independent unconditional: 145, dependent: 49, dependent conditional: 32, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1861, independent: 1391, independent conditional: 16, independent unconditional: 1375, dependent: 470, dependent conditional: 321, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2380, independent: 1562, independent conditional: 27, independent unconditional: 1535, dependent: 213, dependent conditional: 156, dependent unconditional: 57, unknown: 605, unknown conditional: 35, unknown unconditional: 570] , Statistics on independence cache: Total cache size (in pairs): 605, Positive cache size: 556, Positive conditional cache size: 3, Positive unconditional cache size: 553, Negative cache size: 49, Negative conditional cache size: 32, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1592, Maximal queried relation: 8, Independence queries for same thread: 339, Persistent sets #1 benchmarks: Persistent set computation time: 1.6s, Number of persistent set computation: 128, Number of trivial persistent sets: 69, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 570, independent: 553, independent conditional: 0, independent unconditional: 553, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2501, independent: 2118, independent conditional: 1565, independent unconditional: 553, dependent: 383, dependent conditional: 366, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2162, independent: 2118, independent conditional: 1565, independent unconditional: 553, dependent: 44, dependent conditional: 27, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2162, independent: 2118, independent conditional: 1565, independent unconditional: 553, dependent: 44, dependent conditional: 27, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2380, independent: 2118, independent conditional: 1565, independent unconditional: 553, dependent: 262, dependent conditional: 245, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2380, independent: 2118, independent conditional: 30, independent unconditional: 2088, dependent: 262, dependent conditional: 188, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2380, independent: 2118, independent conditional: 30, independent unconditional: 2088, dependent: 262, dependent conditional: 188, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 605, independent: 556, independent conditional: 3, independent unconditional: 553, dependent: 49, dependent conditional: 32, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 605, independent: 408, independent conditional: 0, independent unconditional: 408, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 197, independent: 148, independent conditional: 3, independent unconditional: 145, dependent: 49, dependent conditional: 32, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 197, independent: 148, independent conditional: 3, independent unconditional: 145, dependent: 49, dependent conditional: 32, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1861, independent: 1391, independent conditional: 16, independent unconditional: 1375, dependent: 470, dependent conditional: 321, dependent unconditional: 149, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2380, independent: 1562, independent conditional: 27, independent unconditional: 1535, dependent: 213, dependent conditional: 156, dependent unconditional: 57, unknown: 605, unknown conditional: 35, unknown unconditional: 570] , Statistics on independence cache: Total cache size (in pairs): 605, Positive cache size: 556, Positive conditional cache size: 3, Positive unconditional cache size: 553, Negative cache size: 49, Negative conditional cache size: 32, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1592, Maximal queried relation: 8, Independence queries for same thread: 339 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] 0 pthread_t t1930; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929=-2, t1930=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] FCALL 1 y [L754] FCALL 1 __unbuffered_p0_EAX$read_delayed_var [L754] FCALL 1 __unbuffered_p0_EAX$read_delayed_var [L754] FCALL 1 y [L754] FCALL 1 y [L754] 1 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L754] 1 y [L754] 1 __unbuffered_p0_EAX$read_delayed_var [L754] 1 __unbuffered_p0_EAX$read_delayed_var [L754] 1 y [L754] 1 y [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L772] FCALL 1 y [L772] FCALL 1 __unbuffered_p0_EAX$read_delayed_var [L772] FCALL 1 __unbuffered_p0_EAX$read_delayed_var [L772] FCALL 1 y [L772] FCALL 1 y [L772] 1 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L772] 1 y [L772] 1 __unbuffered_p0_EAX$read_delayed_var [L772] 1 __unbuffered_p0_EAX$read_delayed_var [L772] 1 y [L772] 1 y [L772] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] FCALL 2 y [L784] FCALL 2 __unbuffered_p0_EAX$read_delayed_var [L784] FCALL 2 __unbuffered_p0_EAX$read_delayed_var [L784] FCALL 2 y [L784] FCALL 2 y [L784] 2 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L784] 2 y [L784] 2 __unbuffered_p0_EAX$read_delayed_var [L784] 2 __unbuffered_p0_EAX$read_delayed_var [L784] 2 y [L784] 2 y [L784] 2 __unbuffered_p1_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] FCALL 2 y [L787] FCALL 2 __unbuffered_p0_EAX$read_delayed_var [L787] FCALL 2 __unbuffered_p0_EAX$read_delayed_var [L787] FCALL 2 y [L787] FCALL 2 y [L787] 2 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L787] 2 y [L787] 2 __unbuffered_p0_EAX$read_delayed_var [L787] 2 __unbuffered_p0_EAX$read_delayed_var [L787] 2 y [L787] 2 y [L787] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] FCALL 2 y [L790] FCALL 2 __unbuffered_p0_EAX$read_delayed_var [L790] FCALL 2 __unbuffered_p0_EAX$read_delayed_var [L790] FCALL 2 y [L790] FCALL 2 y [L790] 2 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L790] 2 y [L790] 2 __unbuffered_p0_EAX$read_delayed_var [L790] 2 __unbuffered_p0_EAX$read_delayed_var [L790] 2 y [L790] 2 y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] FCALL 2 y [L797] FCALL 2 __unbuffered_p0_EAX$read_delayed_var [L797] FCALL 2 __unbuffered_p0_EAX$read_delayed_var [L797] FCALL 2 y [L797] FCALL 2 y [L797] 2 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L797] 2 y [L797] 2 __unbuffered_p0_EAX$read_delayed_var [L797] 2 __unbuffered_p0_EAX$read_delayed_var [L797] 2 y [L797] 2 y [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 return 0; [L775] FCALL 1 y [L775] FCALL 1 __unbuffered_p0_EAX$read_delayed_var [L775] FCALL 1 __unbuffered_p0_EAX$read_delayed_var [L775] FCALL 1 y [L775] FCALL 1 y [L775] 1 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L775] 1 y [L775] 1 __unbuffered_p0_EAX$read_delayed_var [L775] 1 __unbuffered_p0_EAX$read_delayed_var [L775] 1 y [L775] 1 y VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L777] FCALL 1 y [L777] FCALL 1 __unbuffered_p0_EAX$read_delayed_var [L777] FCALL 1 __unbuffered_p0_EAX$read_delayed_var [L777] FCALL 1 y [L777] FCALL 1 y [L777] 1 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L777] 1 y [L777] 1 __unbuffered_p0_EAX$read_delayed_var [L777] 1 __unbuffered_p0_EAX$read_delayed_var [L777] 1 y [L777] 1 y [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L817] FCALL 0 y [L817] FCALL 0 __unbuffered_p0_EAX$read_delayed_var [L817] FCALL 0 __unbuffered_p0_EAX$read_delayed_var [L817] FCALL 0 y [L817] FCALL 0 y [L817] 0 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L817] 0 y [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 __unbuffered_p0_EAX$read_delayed_var [L817] 0 y [L817] 0 y [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-2, t1930=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] FCALL 0 y [L821] FCALL 0 __unbuffered_p0_EAX$read_delayed_var [L821] FCALL 0 __unbuffered_p0_EAX$read_delayed_var [L821] FCALL 0 y [L821] FCALL 0 y [L821] 0 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L821] 0 y [L821] 0 __unbuffered_p0_EAX$read_delayed_var [L821] 0 __unbuffered_p0_EAX$read_delayed_var [L821] 0 y [L821] 0 y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-2, t1930=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] FCALL 0 y [L828] FCALL 0 __unbuffered_p0_EAX$read_delayed_var [L828] FCALL 0 __unbuffered_p0_EAX$read_delayed_var [L828] FCALL 0 y [L828] FCALL 0 y [L828] 0 //@ assert (((((((((((((((((((((((((((((((((((((0 <= __unbuffered_cnt) && (((0LL - (long long) __unbuffered_p1_EAX) + (long long) x) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) y$mem_tmp) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice0) >= 0LL)) && (((long long) __unbuffered_p0_EAX$read_delayed - (long long) weak$$choice2) >= 0LL)) && (((long long) y - (long long) y$mem_tmp) >= 0LL)) && (__unbuffered_p0_EAX$flush_delayed == (_Bool) 0)) && (__unbuffered_p0_EAX$mem_tmp == 0)) && (__unbuffered_p0_EAX$r_buff0_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff0_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd0 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd1 == (_Bool) 0)) && (__unbuffered_p0_EAX$r_buff1_thd2 == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff0 == 0)) && (__unbuffered_p0_EAX$w_buff0_used == (_Bool) 0)) && (__unbuffered_p0_EAX$w_buff1 == 0)) && (__unbuffered_p0_EAX$w_buff1_used == (_Bool) 0)) && (y$flush_delayed == (_Bool) 0)) && (y$r_buff0_thd0 == (_Bool) 0)) && (y$r_buff0_thd1 == (_Bool) 0)) && (y$r_buff0_thd2 == (_Bool) 0)) && (y$r_buff1_thd0 == (_Bool) 0)) && (y$r_buff1_thd1 == (_Bool) 0)) && (y$r_buff1_thd2 == (_Bool) 0)) && (y$read_delayed == (_Bool) 0)) && (y$read_delayed_var == 0)) && (y$w_buff0 == 0)) && (y$w_buff0_used == (_Bool) 0)) && (y$w_buff1 == 0)) && (y$w_buff1_used == (_Bool) 0)) && ((__unbuffered_p0_EAX == 0) || (__unbuffered_p0_EAX == 1))) && ((__unbuffered_p0_EAX$read_delayed_var == 0) || ((__unbuffered_p0_EAX$read_delayed_var == &y) && ((*__unbuffered_p0_EAX$read_delayed_var == 0) || (*__unbuffered_p0_EAX$read_delayed_var == 1))))) && ((__unbuffered_p1_EAX == 0) || (__unbuffered_p1_EAX == 1))) && ((x == 0) || (x == 1))) && ((y == 0) || (y == 1))) && ((y$mem_tmp == 0) || (y$mem_tmp == 1))); [L828] 0 y [L828] 0 __unbuffered_p0_EAX$read_delayed_var [L828] 0 __unbuffered_p0_EAX$read_delayed_var [L828] 0 y [L828] 0 y [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929=-2, t1930=-1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L19] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(expression)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 817]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: 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, 64 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 33.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 8.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: 46, 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, 24.7s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 13248 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 64 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 5.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 48, 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.1s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 151 NumberOfCodeBlocks, 151 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 10695 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:03:12,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2024-09-23 22:03:12,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-09-23 22:03:12,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE